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.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:44:07,059 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:44:07,062 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:44:07,081 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:44:07,081 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:44:07,083 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:44:07,084 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:44:07,086 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:44:07,088 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:44:07,088 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:44:07,089 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:44:07,091 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:44:07,091 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:44:07,092 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:44:07,093 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:44:07,094 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:44:07,095 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:44:07,096 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:44:07,098 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:44:07,099 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:44:07,101 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:44:07,102 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:44:07,103 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:44:07,104 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:44:07,106 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:44:07,107 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:44:07,107 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:44:07,108 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:44:07,108 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:44:07,109 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:44:07,109 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:44:07,110 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:44:07,111 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:44:07,112 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:44:07,113 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:44:07,113 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:44:07,113 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:44:07,114 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:44:07,114 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:44:07,115 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:44:07,115 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:44:07,116 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:44:07,132 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:44:07,132 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:44:07,132 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:44:07,133 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:44:07,133 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:44:07,134 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:44:07,134 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:44:07,134 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:44:07,134 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:44:07,134 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:44:07,135 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:44:07,135 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:44:07,136 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:44:07,136 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:44:07,136 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:44:07,136 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:44:07,136 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:44:07,137 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:44:07,137 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:44:07,137 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:44:07,137 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:44:07,137 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:44:07,138 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:44:07,138 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:44:07,138 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:44:07,138 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:44:07,138 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:44:07,139 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:44:07,139 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:44:07,139 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:44:07,169 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:44:07,182 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:44:07,185 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:44:07,187 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:44:07,187 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:44:07,188 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.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-09-10 08:44:07,250 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89d55c3d8/7e0dacd78ac547949c2e971af055cb3f/FLAG7834f06fd [2019-09-10 08:44:07,815 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:44:07,816 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-09-10 08:44:07,838 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89d55c3d8/7e0dacd78ac547949c2e971af055cb3f/FLAG7834f06fd [2019-09-10 08:44:08,086 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89d55c3d8/7e0dacd78ac547949c2e971af055cb3f [2019-09-10 08:44:08,095 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:44:08,097 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:44:08,101 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:44:08,101 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:44:08,106 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:44:08,107 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:44:08" (1/1) ... [2019-09-10 08:44:08,110 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eb9c4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:44:08, skipping insertion in model container [2019-09-10 08:44:08,110 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:44:08" (1/1) ... [2019-09-10 08:44:08,118 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:44:08,199 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:44:08,909 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:44:08,921 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:44:09,374 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:44:09,403 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:44:09,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:44:09 WrapperNode [2019-09-10 08:44:09,404 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:44:09,405 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:44:09,405 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:44:09,405 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:44:09,422 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:44:09" (1/1) ... [2019-09-10 08:44:09,424 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:44:09" (1/1) ... [2019-09-10 08:44:09,478 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:44:09" (1/1) ... [2019-09-10 08:44:09,478 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:44:09" (1/1) ... [2019-09-10 08:44:09,558 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:44:09" (1/1) ... [2019-09-10 08:44:09,587 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:44:09" (1/1) ... [2019-09-10 08:44:09,593 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:44:09" (1/1) ... [2019-09-10 08:44:09,603 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:44:09,604 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:44:09,604 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:44:09,605 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:44:09,606 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:44:09" (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:44:09,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:44:09,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:44:09,680 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:44:09,681 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:44:09,681 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:44:09,681 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:44:09,681 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:44:09,681 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:44:09,682 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:44:09,682 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:44:09,682 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:44:09,682 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:44:09,682 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:44:09,683 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:44:09,683 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:44:09,683 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:44:09,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:44:09,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:44:11,542 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:44:11,543 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:44:11,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:44:11 BoogieIcfgContainer [2019-09-10 08:44:11,546 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:44:11,547 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:44:11,548 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:44:11,551 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:44:11,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:44:08" (1/3) ... [2019-09-10 08:44:11,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7290bfce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:44:11, skipping insertion in model container [2019-09-10 08:44:11,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:44:09" (2/3) ... [2019-09-10 08:44:11,557 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7290bfce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:44:11, skipping insertion in model container [2019-09-10 08:44:11,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:44:11" (3/3) ... [2019-09-10 08:44:11,566 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-09-10 08:44:11,582 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:44:11,613 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-09-10 08:44:11,632 INFO L252 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-09-10 08:44:11,662 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:44:11,663 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:44:11,663 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:44:11,663 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:44:11,663 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:44:11,664 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:44:11,664 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:44:11,664 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:44:11,708 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states. [2019-09-10 08:44:11,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-10 08:44:11,756 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:44:11,758 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:44:11,761 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:44:11,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:44:11,768 INFO L82 PathProgramCache]: Analyzing trace with hash -478150771, now seen corresponding path program 1 times [2019-09-10 08:44:11,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:44:11,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:11,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:44:11,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:11,842 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:44:12,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:44:12,621 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:44:12,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:44:12,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:44:12,625 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:44:12,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:44:12,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:44:12,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:44:12,649 INFO L87 Difference]: Start difference. First operand 418 states. Second operand 3 states. [2019-09-10 08:44:12,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:44:12,852 INFO L93 Difference]: Finished difference Result 607 states and 1058 transitions. [2019-09-10 08:44:12,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:44:12,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-09-10 08:44:12,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:44:12,896 INFO L225 Difference]: With dead ends: 607 [2019-09-10 08:44:12,897 INFO L226 Difference]: Without dead ends: 599 [2019-09-10 08:44:12,899 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:44:12,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-09-10 08:44:13,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 597. [2019-09-10 08:44:13,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2019-09-10 08:44:13,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 876 transitions. [2019-09-10 08:44:13,055 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 876 transitions. Word has length 152 [2019-09-10 08:44:13,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:44:13,056 INFO L475 AbstractCegarLoop]: Abstraction has 597 states and 876 transitions. [2019-09-10 08:44:13,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:44:13,057 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 876 transitions. [2019-09-10 08:44:13,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-10 08:44:13,060 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:44:13,060 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:44:13,060 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:44:13,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:44:13,061 INFO L82 PathProgramCache]: Analyzing trace with hash -387743571, now seen corresponding path program 1 times [2019-09-10 08:44:13,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:44:13,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:13,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:44:13,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:13,063 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:44:13,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:44:13,358 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:44:13,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:44:13,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:44:13,359 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:44:13,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:44:13,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:44:13,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:44:13,364 INFO L87 Difference]: Start difference. First operand 597 states and 876 transitions. Second operand 3 states. [2019-09-10 08:44:13,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:44:13,506 INFO L93 Difference]: Finished difference Result 967 states and 1441 transitions. [2019-09-10 08:44:13,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:44:13,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-09-10 08:44:13,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:44:13,519 INFO L225 Difference]: With dead ends: 967 [2019-09-10 08:44:13,519 INFO L226 Difference]: Without dead ends: 967 [2019-09-10 08:44:13,520 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:44:13,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2019-09-10 08:44:13,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 965. [2019-09-10 08:44:13,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965 states. [2019-09-10 08:44:13,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1440 transitions. [2019-09-10 08:44:13,565 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1440 transitions. Word has length 152 [2019-09-10 08:44:13,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:44:13,566 INFO L475 AbstractCegarLoop]: Abstraction has 965 states and 1440 transitions. [2019-09-10 08:44:13,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:44:13,566 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1440 transitions. [2019-09-10 08:44:13,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-10 08:44:13,569 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:44:13,569 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:44:13,569 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:44:13,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:44:13,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1841947149, now seen corresponding path program 1 times [2019-09-10 08:44:13,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:44:13,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:13,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:44:13,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:13,572 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:44:13,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:44:13,942 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:44:13,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:44:13,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:44:13,944 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:44:13,945 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:44:13,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:44:13,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:44:13,947 INFO L87 Difference]: Start difference. First operand 965 states and 1440 transitions. Second operand 4 states. [2019-09-10 08:44:14,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:44:14,077 INFO L93 Difference]: Finished difference Result 1861 states and 2745 transitions. [2019-09-10 08:44:14,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:44:14,080 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-09-10 08:44:14,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:44:14,092 INFO L225 Difference]: With dead ends: 1861 [2019-09-10 08:44:14,101 INFO L226 Difference]: Without dead ends: 1861 [2019-09-10 08:44:14,102 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:44:14,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1861 states. [2019-09-10 08:44:14,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1861 to 1832. [2019-09-10 08:44:14,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1832 states. [2019-09-10 08:44:14,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1832 states to 1832 states and 2716 transitions. [2019-09-10 08:44:14,200 INFO L78 Accepts]: Start accepts. Automaton has 1832 states and 2716 transitions. Word has length 152 [2019-09-10 08:44:14,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:44:14,201 INFO L475 AbstractCegarLoop]: Abstraction has 1832 states and 2716 transitions. [2019-09-10 08:44:14,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:44:14,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1832 states and 2716 transitions. [2019-09-10 08:44:14,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-10 08:44:14,207 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:44:14,207 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:44:14,207 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:44:14,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:44:14,208 INFO L82 PathProgramCache]: Analyzing trace with hash 966393053, now seen corresponding path program 1 times [2019-09-10 08:44:14,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:44:14,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:14,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:44:14,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:14,210 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:44:14,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:44:14,284 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:44:14,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:44:14,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:44:14,285 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:44:14,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:44:14,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:44:14,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:44:14,286 INFO L87 Difference]: Start difference. First operand 1832 states and 2716 transitions. Second operand 3 states. [2019-09-10 08:44:14,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:44:14,347 INFO L93 Difference]: Finished difference Result 3650 states and 5411 transitions. [2019-09-10 08:44:14,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:44:14,347 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-09-10 08:44:14,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:44:14,368 INFO L225 Difference]: With dead ends: 3650 [2019-09-10 08:44:14,369 INFO L226 Difference]: Without dead ends: 3650 [2019-09-10 08:44:14,369 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:44:14,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3650 states. [2019-09-10 08:44:14,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3650 to 1834. [2019-09-10 08:44:14,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1834 states. [2019-09-10 08:44:14,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1834 states to 1834 states and 2718 transitions. [2019-09-10 08:44:14,438 INFO L78 Accepts]: Start accepts. Automaton has 1834 states and 2718 transitions. Word has length 153 [2019-09-10 08:44:14,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:44:14,438 INFO L475 AbstractCegarLoop]: Abstraction has 1834 states and 2718 transitions. [2019-09-10 08:44:14,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:44:14,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1834 states and 2718 transitions. [2019-09-10 08:44:14,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-10 08:44:14,443 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:44:14,443 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:44:14,443 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:44:14,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:44:14,444 INFO L82 PathProgramCache]: Analyzing trace with hash -617611826, now seen corresponding path program 1 times [2019-09-10 08:44:14,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:44:14,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:14,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:44:14,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:14,446 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:44:14,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:44:14,674 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:44:14,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:44:14,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:44:14,676 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:44:14,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:44:14,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:44:14,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:44:14,678 INFO L87 Difference]: Start difference. First operand 1834 states and 2718 transitions. Second operand 4 states. [2019-09-10 08:44:14,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:44:14,747 INFO L93 Difference]: Finished difference Result 1892 states and 2800 transitions. [2019-09-10 08:44:14,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:44:14,748 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-09-10 08:44:14,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:44:14,761 INFO L225 Difference]: With dead ends: 1892 [2019-09-10 08:44:14,761 INFO L226 Difference]: Without dead ends: 1832 [2019-09-10 08:44:14,762 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:44:14,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1832 states. [2019-09-10 08:44:14,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1832 to 1832. [2019-09-10 08:44:14,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1832 states. [2019-09-10 08:44:14,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1832 states to 1832 states and 2714 transitions. [2019-09-10 08:44:14,844 INFO L78 Accepts]: Start accepts. Automaton has 1832 states and 2714 transitions. Word has length 154 [2019-09-10 08:44:14,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:44:14,844 INFO L475 AbstractCegarLoop]: Abstraction has 1832 states and 2714 transitions. [2019-09-10 08:44:14,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:44:14,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1832 states and 2714 transitions. [2019-09-10 08:44:14,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-10 08:44:14,851 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:44:14,852 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:44:14,852 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:44:14,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:44:14,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1124929589, now seen corresponding path program 1 times [2019-09-10 08:44:14,854 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:44:14,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:14,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:44:14,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:14,860 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:44:14,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:44:15,194 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:44:15,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:44:15,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:44:15,195 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:44:15,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:44:15,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:44:15,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:44:15,198 INFO L87 Difference]: Start difference. First operand 1832 states and 2714 transitions. Second operand 3 states. [2019-09-10 08:44:15,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:44:15,310 INFO L93 Difference]: Finished difference Result 2728 states and 3981 transitions. [2019-09-10 08:44:15,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:44:15,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-09-10 08:44:15,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:44:15,331 INFO L225 Difference]: With dead ends: 2728 [2019-09-10 08:44:15,332 INFO L226 Difference]: Without dead ends: 2728 [2019-09-10 08:44:15,332 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:44:15,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2728 states. [2019-09-10 08:44:15,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2728 to 2699. [2019-09-10 08:44:15,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2699 states. [2019-09-10 08:44:15,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2699 states to 2699 states and 3952 transitions. [2019-09-10 08:44:15,453 INFO L78 Accepts]: Start accepts. Automaton has 2699 states and 3952 transitions. Word has length 154 [2019-09-10 08:44:15,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:44:15,454 INFO L475 AbstractCegarLoop]: Abstraction has 2699 states and 3952 transitions. [2019-09-10 08:44:15,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:44:15,454 INFO L276 IsEmpty]: Start isEmpty. Operand 2699 states and 3952 transitions. [2019-09-10 08:44:15,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-10 08:44:15,470 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:44:15,472 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:44:15,474 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:44:15,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:44:15,476 INFO L82 PathProgramCache]: Analyzing trace with hash -919857140, now seen corresponding path program 1 times [2019-09-10 08:44:15,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:44:15,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:15,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:44:15,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:15,480 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:44:15,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:44:15,619 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:44:15,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:44:15,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:44:15,620 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:44:15,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:44:15,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:44:15,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:44:15,622 INFO L87 Difference]: Start difference. First operand 2699 states and 3952 transitions. Second operand 3 states. [2019-09-10 08:44:15,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:44:15,735 INFO L93 Difference]: Finished difference Result 4177 states and 6230 transitions. [2019-09-10 08:44:15,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:44:15,736 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-09-10 08:44:15,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:44:15,761 INFO L225 Difference]: With dead ends: 4177 [2019-09-10 08:44:15,762 INFO L226 Difference]: Without dead ends: 4177 [2019-09-10 08:44:15,762 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:44:15,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4177 states. [2019-09-10 08:44:15,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4177 to 3547. [2019-09-10 08:44:15,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3547 states. [2019-09-10 08:44:15,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3547 states to 3547 states and 5333 transitions. [2019-09-10 08:44:15,876 INFO L78 Accepts]: Start accepts. Automaton has 3547 states and 5333 transitions. Word has length 156 [2019-09-10 08:44:15,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:44:15,876 INFO L475 AbstractCegarLoop]: Abstraction has 3547 states and 5333 transitions. [2019-09-10 08:44:15,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:44:15,877 INFO L276 IsEmpty]: Start isEmpty. Operand 3547 states and 5333 transitions. [2019-09-10 08:44:15,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-10 08:44:15,885 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:44:15,885 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:15,886 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:44:15,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:44:15,886 INFO L82 PathProgramCache]: Analyzing trace with hash -2146763757, now seen corresponding path program 1 times [2019-09-10 08:44:15,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:44:15,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:15,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:44:15,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:15,888 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:44:15,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:44:16,057 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:44:16,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:44:16,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:44:16,058 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:44:16,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:44:16,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:44:16,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:44:16,060 INFO L87 Difference]: Start difference. First operand 3547 states and 5333 transitions. Second operand 3 states. [2019-09-10 08:44:16,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:44:16,172 INFO L93 Difference]: Finished difference Result 5571 states and 8497 transitions. [2019-09-10 08:44:16,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:44:16,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-09-10 08:44:16,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:44:16,205 INFO L225 Difference]: With dead ends: 5571 [2019-09-10 08:44:16,205 INFO L226 Difference]: Without dead ends: 5571 [2019-09-10 08:44:16,206 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:44:16,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5571 states. [2019-09-10 08:44:16,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5571 to 5055. [2019-09-10 08:44:16,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5055 states. [2019-09-10 08:44:16,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5055 states to 5055 states and 7762 transitions. [2019-09-10 08:44:16,376 INFO L78 Accepts]: Start accepts. Automaton has 5055 states and 7762 transitions. Word has length 158 [2019-09-10 08:44:16,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:44:16,376 INFO L475 AbstractCegarLoop]: Abstraction has 5055 states and 7762 transitions. [2019-09-10 08:44:16,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:44:16,376 INFO L276 IsEmpty]: Start isEmpty. Operand 5055 states and 7762 transitions. [2019-09-10 08:44:16,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-10 08:44:16,382 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:44:16,382 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:44:16,383 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:44:16,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:44:16,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1620082222, now seen corresponding path program 1 times [2019-09-10 08:44:16,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:44:16,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:16,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:44:16,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:16,385 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:44:16,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:44:16,578 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:44:16,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:44:16,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:44:16,579 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:44:16,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:44:16,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:44:16,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:44:16,581 INFO L87 Difference]: Start difference. First operand 5055 states and 7762 transitions. Second operand 5 states. [2019-09-10 08:44:17,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:44:17,114 INFO L93 Difference]: Finished difference Result 5057 states and 7728 transitions. [2019-09-10 08:44:17,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:44:17,115 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 159 [2019-09-10 08:44:17,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:44:17,140 INFO L225 Difference]: With dead ends: 5057 [2019-09-10 08:44:17,141 INFO L226 Difference]: Without dead ends: 5057 [2019-09-10 08:44:17,141 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:44:17,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5057 states. [2019-09-10 08:44:17,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5057 to 5055. [2019-09-10 08:44:17,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5055 states. [2019-09-10 08:44:17,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5055 states to 5055 states and 7727 transitions. [2019-09-10 08:44:17,260 INFO L78 Accepts]: Start accepts. Automaton has 5055 states and 7727 transitions. Word has length 159 [2019-09-10 08:44:17,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:44:17,261 INFO L475 AbstractCegarLoop]: Abstraction has 5055 states and 7727 transitions. [2019-09-10 08:44:17,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:44:17,261 INFO L276 IsEmpty]: Start isEmpty. Operand 5055 states and 7727 transitions. [2019-09-10 08:44:17,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-10 08:44:17,266 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:44:17,267 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:44:17,267 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:44:17,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:44:17,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1298246967, now seen corresponding path program 1 times [2019-09-10 08:44:17,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:44:17,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:17,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:44:17,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:17,269 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:44:17,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:44:17,499 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:44:17,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:44:17,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:44:17,500 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:44:17,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:44:17,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:44:17,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:44:17,501 INFO L87 Difference]: Start difference. First operand 5055 states and 7727 transitions. Second operand 8 states. [2019-09-10 08:44:18,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:44:18,644 INFO L93 Difference]: Finished difference Result 13560 states and 20593 transitions. [2019-09-10 08:44:18,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 08:44:18,645 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 159 [2019-09-10 08:44:18,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:44:18,717 INFO L225 Difference]: With dead ends: 13560 [2019-09-10 08:44:18,718 INFO L226 Difference]: Without dead ends: 13560 [2019-09-10 08:44:18,719 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:44:18,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13560 states. [2019-09-10 08:44:18,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13560 to 7049. [2019-09-10 08:44:18,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7049 states. [2019-09-10 08:44:19,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7049 states to 7049 states and 10531 transitions. [2019-09-10 08:44:19,019 INFO L78 Accepts]: Start accepts. Automaton has 7049 states and 10531 transitions. Word has length 159 [2019-09-10 08:44:19,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:44:19,020 INFO L475 AbstractCegarLoop]: Abstraction has 7049 states and 10531 transitions. [2019-09-10 08:44:19,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:44:19,020 INFO L276 IsEmpty]: Start isEmpty. Operand 7049 states and 10531 transitions. [2019-09-10 08:44:19,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-10 08:44:19,027 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:44:19,027 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:44:19,027 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:44:19,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:44:19,028 INFO L82 PathProgramCache]: Analyzing trace with hash 279900072, now seen corresponding path program 1 times [2019-09-10 08:44:19,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:44:19,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:19,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:44:19,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:19,031 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:44:19,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:44:19,254 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:44:19,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:44:19,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:44:19,255 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:44:19,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:44:19,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:44:19,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:44:19,256 INFO L87 Difference]: Start difference. First operand 7049 states and 10531 transitions. Second operand 4 states. [2019-09-10 08:44:19,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:44:19,422 INFO L93 Difference]: Finished difference Result 11977 states and 17754 transitions. [2019-09-10 08:44:19,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:44:19,423 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-09-10 08:44:19,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:44:19,455 INFO L225 Difference]: With dead ends: 11977 [2019-09-10 08:44:19,455 INFO L226 Difference]: Without dead ends: 11977 [2019-09-10 08:44:19,456 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:44:19,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11977 states. [2019-09-10 08:44:19,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11977 to 11954. [2019-09-10 08:44:19,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11954 states. [2019-09-10 08:44:19,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11954 states to 11954 states and 17733 transitions. [2019-09-10 08:44:19,746 INFO L78 Accepts]: Start accepts. Automaton has 11954 states and 17733 transitions. Word has length 159 [2019-09-10 08:44:19,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:44:19,747 INFO L475 AbstractCegarLoop]: Abstraction has 11954 states and 17733 transitions. [2019-09-10 08:44:19,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:44:19,747 INFO L276 IsEmpty]: Start isEmpty. Operand 11954 states and 17733 transitions. [2019-09-10 08:44:19,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-10 08:44:19,760 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:44:19,760 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:44:19,760 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:44:19,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:44:19,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1716884978, now seen corresponding path program 1 times [2019-09-10 08:44:19,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:44:19,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:19,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:44:19,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:19,763 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:44:19,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:44:19,888 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:44:19,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:44:19,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:44:19,889 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:44:19,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:44:19,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:44:19,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:44:19,890 INFO L87 Difference]: Start difference. First operand 11954 states and 17733 transitions. Second operand 3 states. [2019-09-10 08:44:20,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:44:20,063 INFO L93 Difference]: Finished difference Result 22908 states and 33797 transitions. [2019-09-10 08:44:20,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:44:20,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-09-10 08:44:20,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:44:20,122 INFO L225 Difference]: With dead ends: 22908 [2019-09-10 08:44:20,122 INFO L226 Difference]: Without dead ends: 22908 [2019-09-10 08:44:20,123 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:44:20,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22908 states. [2019-09-10 08:44:20,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22908 to 22887. [2019-09-10 08:44:20,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22887 states. [2019-09-10 08:44:20,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22887 states to 22887 states and 33780 transitions. [2019-09-10 08:44:20,817 INFO L78 Accepts]: Start accepts. Automaton has 22887 states and 33780 transitions. Word has length 161 [2019-09-10 08:44:20,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:44:20,817 INFO L475 AbstractCegarLoop]: Abstraction has 22887 states and 33780 transitions. [2019-09-10 08:44:20,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:44:20,818 INFO L276 IsEmpty]: Start isEmpty. Operand 22887 states and 33780 transitions. [2019-09-10 08:44:20,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-10 08:44:20,836 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:44:20,837 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:20,837 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:44:20,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:44:20,838 INFO L82 PathProgramCache]: Analyzing trace with hash 452986321, now seen corresponding path program 1 times [2019-09-10 08:44:20,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:44:20,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:20,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:44:20,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:20,840 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:44:20,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:44:21,012 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:44:21,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:44:21,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:44:21,013 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:44:21,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:44:21,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:44:21,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:44:21,014 INFO L87 Difference]: Start difference. First operand 22887 states and 33780 transitions. Second operand 4 states. [2019-09-10 08:44:21,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:44:21,115 INFO L93 Difference]: Finished difference Result 18375 states and 26996 transitions. [2019-09-10 08:44:21,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:44:21,116 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-09-10 08:44:21,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:44:21,172 INFO L225 Difference]: With dead ends: 18375 [2019-09-10 08:44:21,172 INFO L226 Difference]: Without dead ends: 18327 [2019-09-10 08:44:21,172 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:44:21,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18327 states. [2019-09-10 08:44:21,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18327 to 18327. [2019-09-10 08:44:21,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18327 states. [2019-09-10 08:44:21,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18327 states to 18327 states and 26933 transitions. [2019-09-10 08:44:21,549 INFO L78 Accepts]: Start accepts. Automaton has 18327 states and 26933 transitions. Word has length 161 [2019-09-10 08:44:21,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:44:21,550 INFO L475 AbstractCegarLoop]: Abstraction has 18327 states and 26933 transitions. [2019-09-10 08:44:21,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:44:21,550 INFO L276 IsEmpty]: Start isEmpty. Operand 18327 states and 26933 transitions. [2019-09-10 08:44:21,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-10 08:44:21,564 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:44:21,564 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, 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:44:21,565 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:44:21,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:44:21,565 INFO L82 PathProgramCache]: Analyzing trace with hash 821169327, now seen corresponding path program 1 times [2019-09-10 08:44:21,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:44:21,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:21,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:44:21,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:21,568 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:44:21,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:44:21,698 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:44:21,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:44:21,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:44:21,699 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:44:21,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:44:21,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:44:21,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:44:21,701 INFO L87 Difference]: Start difference. First operand 18327 states and 26933 transitions. Second operand 3 states. [2019-09-10 08:44:22,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:44:22,068 INFO L93 Difference]: Finished difference Result 31852 states and 47356 transitions. [2019-09-10 08:44:22,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:44:22,069 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-09-10 08:44:22,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:44:22,150 INFO L225 Difference]: With dead ends: 31852 [2019-09-10 08:44:22,150 INFO L226 Difference]: Without dead ends: 31852 [2019-09-10 08:44:22,151 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:44:22,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31852 states. [2019-09-10 08:44:22,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31852 to 28563. [2019-09-10 08:44:22,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28563 states. [2019-09-10 08:44:22,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28563 states to 28563 states and 43032 transitions. [2019-09-10 08:44:22,627 INFO L78 Accepts]: Start accepts. Automaton has 28563 states and 43032 transitions. Word has length 165 [2019-09-10 08:44:22,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:44:22,628 INFO L475 AbstractCegarLoop]: Abstraction has 28563 states and 43032 transitions. [2019-09-10 08:44:22,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:44:22,628 INFO L276 IsEmpty]: Start isEmpty. Operand 28563 states and 43032 transitions. [2019-09-10 08:44:22,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-10 08:44:22,643 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:44:22,643 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, 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:44:22,644 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:44:22,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:44:22,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1830039583, now seen corresponding path program 1 times [2019-09-10 08:44:22,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:44:22,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:22,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:44:22,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:22,648 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:44:22,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:44:23,546 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:44:23,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:44:23,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:44:23,547 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:44:23,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:44:23,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:44:23,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:44:23,549 INFO L87 Difference]: Start difference. First operand 28563 states and 43032 transitions. Second operand 8 states. [2019-09-10 08:44:24,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:44:24,690 INFO L93 Difference]: Finished difference Result 76884 states and 114514 transitions. [2019-09-10 08:44:24,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 08:44:24,691 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 166 [2019-09-10 08:44:24,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:44:24,921 INFO L225 Difference]: With dead ends: 76884 [2019-09-10 08:44:24,921 INFO L226 Difference]: Without dead ends: 76884 [2019-09-10 08:44:24,924 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:44:25,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76884 states. [2019-09-10 08:44:25,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76884 to 42803. [2019-09-10 08:44:25,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42803 states. [2019-09-10 08:44:26,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42803 states to 42803 states and 63524 transitions. [2019-09-10 08:44:26,048 INFO L78 Accepts]: Start accepts. Automaton has 42803 states and 63524 transitions. Word has length 166 [2019-09-10 08:44:26,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:44:26,049 INFO L475 AbstractCegarLoop]: Abstraction has 42803 states and 63524 transitions. [2019-09-10 08:44:26,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:44:26,049 INFO L276 IsEmpty]: Start isEmpty. Operand 42803 states and 63524 transitions. [2019-09-10 08:44:26,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-10 08:44:26,066 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:44:26,066 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, 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:44:26,066 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:44:26,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:44:26,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1646449545, now seen corresponding path program 1 times [2019-09-10 08:44:26,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:44:26,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:26,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:44:26,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:26,069 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:44:26,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:44:26,272 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:44:26,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:44:26,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:44:26,275 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:44:26,276 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:44:26,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:44:26,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:44:26,277 INFO L87 Difference]: Start difference. First operand 42803 states and 63524 transitions. Second operand 4 states. [2019-09-10 08:44:26,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:44:26,592 INFO L93 Difference]: Finished difference Result 76657 states and 112224 transitions. [2019-09-10 08:44:26,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:44:26,593 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-09-10 08:44:26,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:44:26,786 INFO L225 Difference]: With dead ends: 76657 [2019-09-10 08:44:26,787 INFO L226 Difference]: Without dead ends: 76657 [2019-09-10 08:44:26,787 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:44:26,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76657 states. [2019-09-10 08:44:28,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76657 to 76604. [2019-09-10 08:44:28,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76604 states. [2019-09-10 08:44:28,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76604 states to 76604 states and 112170 transitions. [2019-09-10 08:44:28,202 INFO L78 Accepts]: Start accepts. Automaton has 76604 states and 112170 transitions. Word has length 166 [2019-09-10 08:44:28,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:44:28,203 INFO L475 AbstractCegarLoop]: Abstraction has 76604 states and 112170 transitions. [2019-09-10 08:44:28,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:44:28,203 INFO L276 IsEmpty]: Start isEmpty. Operand 76604 states and 112170 transitions. [2019-09-10 08:44:28,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-10 08:44:28,233 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:44:28,234 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, 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:44:28,234 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:44:28,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:44:28,235 INFO L82 PathProgramCache]: Analyzing trace with hash -529993847, now seen corresponding path program 1 times [2019-09-10 08:44:28,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:44:28,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:28,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:44:28,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:28,237 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:44:28,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:44:29,626 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:44:29,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:44:29,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:44:29,627 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:44:29,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:44:29,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:44:29,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:44:29,628 INFO L87 Difference]: Start difference. First operand 76604 states and 112170 transitions. Second operand 3 states. [2019-09-10 08:44:30,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:44:30,104 INFO L93 Difference]: Finished difference Result 153116 states and 224222 transitions. [2019-09-10 08:44:30,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:44:30,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-09-10 08:44:30,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:44:30,357 INFO L225 Difference]: With dead ends: 153116 [2019-09-10 08:44:30,357 INFO L226 Difference]: Without dead ends: 153116 [2019-09-10 08:44:30,358 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:44:30,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153116 states. [2019-09-10 08:44:31,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153116 to 76610. [2019-09-10 08:44:31,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76610 states. [2019-09-10 08:44:31,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76610 states to 76610 states and 112176 transitions. [2019-09-10 08:44:31,957 INFO L78 Accepts]: Start accepts. Automaton has 76610 states and 112176 transitions. Word has length 167 [2019-09-10 08:44:31,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:44:31,957 INFO L475 AbstractCegarLoop]: Abstraction has 76610 states and 112176 transitions. [2019-09-10 08:44:31,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:44:31,958 INFO L276 IsEmpty]: Start isEmpty. Operand 76610 states and 112176 transitions. [2019-09-10 08:44:31,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-10 08:44:32,000 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:44:32,000 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, 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:44:32,000 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:44:32,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:44:32,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1584516349, now seen corresponding path program 1 times [2019-09-10 08:44:32,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:44:32,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:32,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:44:32,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:32,003 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:44:32,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:44:32,117 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:44:32,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:44:32,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:44:32,117 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:44:32,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:44:32,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:44:32,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:44:32,119 INFO L87 Difference]: Start difference. First operand 76610 states and 112176 transitions. Second operand 3 states. [2019-09-10 08:44:32,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:44:32,815 INFO L93 Difference]: Finished difference Result 124740 states and 180015 transitions. [2019-09-10 08:44:32,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:44:32,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-09-10 08:44:32,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:44:33,010 INFO L225 Difference]: With dead ends: 124740 [2019-09-10 08:44:33,011 INFO L226 Difference]: Without dead ends: 124740 [2019-09-10 08:44:33,011 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:44:33,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124740 states. [2019-09-10 08:44:36,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124740 to 124687. [2019-09-10 08:44:36,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124687 states. [2019-09-10 08:44:36,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124687 states to 124687 states and 179961 transitions. [2019-09-10 08:44:36,568 INFO L78 Accepts]: Start accepts. Automaton has 124687 states and 179961 transitions. Word has length 168 [2019-09-10 08:44:36,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:44:36,568 INFO L475 AbstractCegarLoop]: Abstraction has 124687 states and 179961 transitions. [2019-09-10 08:44:36,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:44:36,569 INFO L276 IsEmpty]: Start isEmpty. Operand 124687 states and 179961 transitions. [2019-09-10 08:44:36,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-10 08:44:36,596 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:44:36,596 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, 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:44:36,596 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:44:36,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:44:36,597 INFO L82 PathProgramCache]: Analyzing trace with hash 2034399520, now seen corresponding path program 1 times [2019-09-10 08:44:36,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:44:36,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:36,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:44:36,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:36,599 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:44:36,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:44:36,765 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:44:36,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:44:36,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:44:36,766 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:44:36,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:44:36,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:44:36,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:44:36,769 INFO L87 Difference]: Start difference. First operand 124687 states and 179961 transitions. Second operand 4 states. [2019-09-10 08:44:37,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:44:37,093 INFO L93 Difference]: Finished difference Result 111190 states and 160342 transitions. [2019-09-10 08:44:37,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:44:37,094 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2019-09-10 08:44:37,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:44:37,266 INFO L225 Difference]: With dead ends: 111190 [2019-09-10 08:44:37,266 INFO L226 Difference]: Without dead ends: 110999 [2019-09-10 08:44:37,266 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:44:37,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110999 states. [2019-09-10 08:44:40,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110999 to 110999. [2019-09-10 08:44:40,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110999 states. [2019-09-10 08:44:40,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110999 states to 110999 states and 160114 transitions. [2019-09-10 08:44:40,502 INFO L78 Accepts]: Start accepts. Automaton has 110999 states and 160114 transitions. Word has length 168 [2019-09-10 08:44:40,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:44:40,503 INFO L475 AbstractCegarLoop]: Abstraction has 110999 states and 160114 transitions. [2019-09-10 08:44:40,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:44:40,503 INFO L276 IsEmpty]: Start isEmpty. Operand 110999 states and 160114 transitions. [2019-09-10 08:44:40,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-10 08:44:40,519 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:44:40,519 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, 1, 1, 1, 1, 1, 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:44:40,520 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:44:40,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:44:40,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1408902959, now seen corresponding path program 1 times [2019-09-10 08:44:40,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:44:40,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:40,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:44:40,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:40,522 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:44:40,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:44:40,643 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:44:40,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:44:40,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:44:40,643 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:44:40,644 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:44:40,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:44:40,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:44:40,645 INFO L87 Difference]: Start difference. First operand 110999 states and 160114 transitions. Second operand 4 states. [2019-09-10 08:44:41,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:44:41,196 INFO L93 Difference]: Finished difference Result 202018 states and 296096 transitions. [2019-09-10 08:44:41,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:44:41,197 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2019-09-10 08:44:41,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:44:41,494 INFO L225 Difference]: With dead ends: 202018 [2019-09-10 08:44:41,494 INFO L226 Difference]: Without dead ends: 202018 [2019-09-10 08:44:41,494 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:44:42,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202018 states. [2019-09-10 08:44:43,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202018 to 107895. [2019-09-10 08:44:43,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107895 states. [2019-09-10 08:44:47,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107895 states to 107895 states and 156274 transitions. [2019-09-10 08:44:47,086 INFO L78 Accepts]: Start accepts. Automaton has 107895 states and 156274 transitions. Word has length 173 [2019-09-10 08:44:47,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:44:47,086 INFO L475 AbstractCegarLoop]: Abstraction has 107895 states and 156274 transitions. [2019-09-10 08:44:47,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:44:47,087 INFO L276 IsEmpty]: Start isEmpty. Operand 107895 states and 156274 transitions. [2019-09-10 08:44:47,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-10 08:44:47,103 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:44:47,103 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, 1, 1, 1, 1, 1, 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:44:47,104 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:44:47,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:44:47,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1937689959, now seen corresponding path program 1 times [2019-09-10 08:44:47,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:44:47,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:47,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:44:47,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:47,108 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:44:47,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:44:47,317 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:44:47,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:44:47,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:44:47,317 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:44:47,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:44:47,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:44:47,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:44:47,319 INFO L87 Difference]: Start difference. First operand 107895 states and 156274 transitions. Second operand 8 states. [2019-09-10 08:44:48,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:44:48,585 INFO L93 Difference]: Finished difference Result 281895 states and 402983 transitions. [2019-09-10 08:44:48,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 08:44:48,586 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 173 [2019-09-10 08:44:48,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:44:48,958 INFO L225 Difference]: With dead ends: 281895 [2019-09-10 08:44:48,959 INFO L226 Difference]: Without dead ends: 281895 [2019-09-10 08:44:48,959 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:44:49,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281895 states. [2019-09-10 08:44:51,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281895 to 128073. [2019-09-10 08:44:51,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128073 states. [2019-09-10 08:44:52,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128073 states to 128073 states and 184758 transitions. [2019-09-10 08:44:52,372 INFO L78 Accepts]: Start accepts. Automaton has 128073 states and 184758 transitions. Word has length 173 [2019-09-10 08:44:52,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:44:52,373 INFO L475 AbstractCegarLoop]: Abstraction has 128073 states and 184758 transitions. [2019-09-10 08:44:52,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:44:52,373 INFO L276 IsEmpty]: Start isEmpty. Operand 128073 states and 184758 transitions. [2019-09-10 08:44:52,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-10 08:44:52,386 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:44:52,387 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, 1, 1, 1, 1, 1, 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:44:52,387 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:44:52,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:44:52,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1243574581, now seen corresponding path program 1 times [2019-09-10 08:44:52,388 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:44:52,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:52,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:44:52,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:52,390 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:44:52,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:44:52,583 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:44:52,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:44:52,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:44:52,584 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:44:52,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:44:52,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:44:52,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:44:52,585 INFO L87 Difference]: Start difference. First operand 128073 states and 184758 transitions. Second operand 4 states. [2019-09-10 08:44:52,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:44:52,959 INFO L93 Difference]: Finished difference Result 119265 states and 171992 transitions. [2019-09-10 08:44:52,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:44:52,960 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2019-09-10 08:44:52,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:44:53,124 INFO L225 Difference]: With dead ends: 119265 [2019-09-10 08:44:53,124 INFO L226 Difference]: Without dead ends: 119265 [2019-09-10 08:44:53,124 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:44:53,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119265 states. [2019-09-10 08:44:54,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119265 to 119204. [2019-09-10 08:44:54,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119204 states. [2019-09-10 08:44:57,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119204 states to 119204 states and 171929 transitions. [2019-09-10 08:44:57,180 INFO L78 Accepts]: Start accepts. Automaton has 119204 states and 171929 transitions. Word has length 173 [2019-09-10 08:44:57,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:44:57,181 INFO L475 AbstractCegarLoop]: Abstraction has 119204 states and 171929 transitions. [2019-09-10 08:44:57,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:44:57,181 INFO L276 IsEmpty]: Start isEmpty. Operand 119204 states and 171929 transitions. [2019-09-10 08:44:57,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-10 08:44:57,192 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:44:57,192 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, 1, 1, 1, 1, 1, 1, 1, 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:44:57,193 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:44:57,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:44:57,193 INFO L82 PathProgramCache]: Analyzing trace with hash 344016333, now seen corresponding path program 1 times [2019-09-10 08:44:57,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:44:57,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:57,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:44:57,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:57,195 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:44:57,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:44:57,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:44:57,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:44:57,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:44:57,379 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:44:57,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:44:57,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:44:57,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:44:57,380 INFO L87 Difference]: Start difference. First operand 119204 states and 171929 transitions. Second operand 4 states. [2019-09-10 08:44:57,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:44:57,751 INFO L93 Difference]: Finished difference Result 119420 states and 172152 transitions. [2019-09-10 08:44:57,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:44:57,752 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 175 [2019-09-10 08:44:57,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:44:57,909 INFO L225 Difference]: With dead ends: 119420 [2019-09-10 08:44:57,909 INFO L226 Difference]: Without dead ends: 119420 [2019-09-10 08:44:57,910 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:44:58,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119420 states. [2019-09-10 08:44:58,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119420 to 119307. [2019-09-10 08:44:58,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119307 states. [2019-09-10 08:44:59,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119307 states to 119307 states and 172030 transitions. [2019-09-10 08:44:59,151 INFO L78 Accepts]: Start accepts. Automaton has 119307 states and 172030 transitions. Word has length 175 [2019-09-10 08:44:59,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:44:59,151 INFO L475 AbstractCegarLoop]: Abstraction has 119307 states and 172030 transitions. [2019-09-10 08:44:59,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:44:59,151 INFO L276 IsEmpty]: Start isEmpty. Operand 119307 states and 172030 transitions. [2019-09-10 08:44:59,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 08:44:59,165 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:44:59,165 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:59,165 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:44:59,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:44:59,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1708861749, now seen corresponding path program 1 times [2019-09-10 08:44:59,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:44:59,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:59,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:44:59,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:59,168 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:44:59,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:44:59,629 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:44:59,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:44:59,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:44:59,632 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:44:59,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:44:59,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:44:59,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:44:59,637 INFO L87 Difference]: Start difference. First operand 119307 states and 172030 transitions. Second operand 3 states. [2019-09-10 08:45:00,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:00,133 INFO L93 Difference]: Finished difference Result 238400 states and 343808 transitions. [2019-09-10 08:45:00,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:45:00,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-09-10 08:45:00,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:00,462 INFO L225 Difference]: With dead ends: 238400 [2019-09-10 08:45:00,462 INFO L226 Difference]: Without dead ends: 238400 [2019-09-10 08:45:00,462 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:45:00,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238400 states. [2019-09-10 08:45:02,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238400 to 119317. [2019-09-10 08:45:02,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119317 states. [2019-09-10 08:45:03,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119317 states to 119317 states and 172040 transitions. [2019-09-10 08:45:03,041 INFO L78 Accepts]: Start accepts. Automaton has 119317 states and 172040 transitions. Word has length 176 [2019-09-10 08:45:03,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:03,041 INFO L475 AbstractCegarLoop]: Abstraction has 119317 states and 172040 transitions. [2019-09-10 08:45:03,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:45:03,041 INFO L276 IsEmpty]: Start isEmpty. Operand 119317 states and 172040 transitions. [2019-09-10 08:45:03,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-10 08:45:03,054 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:03,054 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:03,054 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:03,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:03,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1041476003, now seen corresponding path program 1 times [2019-09-10 08:45:03,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:03,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:03,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:03,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:03,056 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:03,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:03,283 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:45:03,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:03,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:45:03,284 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:03,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:45:03,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:45:03,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:45:03,286 INFO L87 Difference]: Start difference. First operand 119317 states and 172040 transitions. Second operand 4 states. [2019-09-10 08:45:03,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:03,778 INFO L93 Difference]: Finished difference Result 119776 states and 172525 transitions. [2019-09-10 08:45:03,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:45:03,779 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2019-09-10 08:45:03,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:04,037 INFO L225 Difference]: With dead ends: 119776 [2019-09-10 08:45:04,037 INFO L226 Difference]: Without dead ends: 119776 [2019-09-10 08:45:04,038 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:45:04,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119776 states. [2019-09-10 08:45:05,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119776 to 119568. [2019-09-10 08:45:05,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119568 states. [2019-09-10 08:45:05,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119568 states to 119568 states and 172291 transitions. [2019-09-10 08:45:05,904 INFO L78 Accepts]: Start accepts. Automaton has 119568 states and 172291 transitions. Word has length 177 [2019-09-10 08:45:05,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:05,905 INFO L475 AbstractCegarLoop]: Abstraction has 119568 states and 172291 transitions. [2019-09-10 08:45:05,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:45:05,905 INFO L276 IsEmpty]: Start isEmpty. Operand 119568 states and 172291 transitions. [2019-09-10 08:45:05,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-10 08:45:05,918 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:05,918 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:05,919 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:05,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:05,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1557353132, now seen corresponding path program 1 times [2019-09-10 08:45:05,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:05,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:05,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:05,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:05,920 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:05,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:06,058 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:45:06,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:06,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:45:06,059 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:06,060 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:45:06,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:45:06,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:45:06,060 INFO L87 Difference]: Start difference. First operand 119568 states and 172291 transitions. Second operand 4 states. [2019-09-10 08:45:06,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:06,295 INFO L93 Difference]: Finished difference Result 108168 states and 155837 transitions. [2019-09-10 08:45:06,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:45:06,295 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2019-09-10 08:45:06,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:06,414 INFO L225 Difference]: With dead ends: 108168 [2019-09-10 08:45:06,414 INFO L226 Difference]: Without dead ends: 108066 [2019-09-10 08:45:06,415 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:45:06,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108066 states. [2019-09-10 08:45:07,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108066 to 108066. [2019-09-10 08:45:07,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108066 states. [2019-09-10 08:45:07,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108066 states to 108066 states and 155735 transitions. [2019-09-10 08:45:07,404 INFO L78 Accepts]: Start accepts. Automaton has 108066 states and 155735 transitions. Word has length 177 [2019-09-10 08:45:07,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:07,404 INFO L475 AbstractCegarLoop]: Abstraction has 108066 states and 155735 transitions. [2019-09-10 08:45:07,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:45:07,404 INFO L276 IsEmpty]: Start isEmpty. Operand 108066 states and 155735 transitions. [2019-09-10 08:45:07,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-10 08:45:07,415 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:07,415 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:07,416 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:07,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:07,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1730932559, now seen corresponding path program 1 times [2019-09-10 08:45:07,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:07,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:07,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:07,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:07,417 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:07,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:07,527 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:45:07,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:07,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:45:07,527 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:07,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:45:07,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:45:07,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:45:07,528 INFO L87 Difference]: Start difference. First operand 108066 states and 155735 transitions. Second operand 4 states. [2019-09-10 08:45:08,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:08,346 INFO L93 Difference]: Finished difference Result 213533 states and 308147 transitions. [2019-09-10 08:45:08,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:45:08,346 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2019-09-10 08:45:08,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:08,631 INFO L225 Difference]: With dead ends: 213533 [2019-09-10 08:45:08,631 INFO L226 Difference]: Without dead ends: 213533 [2019-09-10 08:45:08,631 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:45:08,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213533 states. [2019-09-10 08:45:10,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213533 to 113080. [2019-09-10 08:45:10,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113080 states. [2019-09-10 08:45:10,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113080 states to 113080 states and 161607 transitions. [2019-09-10 08:45:10,301 INFO L78 Accepts]: Start accepts. Automaton has 113080 states and 161607 transitions. Word has length 179 [2019-09-10 08:45:10,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:10,302 INFO L475 AbstractCegarLoop]: Abstraction has 113080 states and 161607 transitions. [2019-09-10 08:45:10,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:45:10,302 INFO L276 IsEmpty]: Start isEmpty. Operand 113080 states and 161607 transitions. [2019-09-10 08:45:10,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-10 08:45:10,318 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:10,318 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:10,318 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:10,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:10,318 INFO L82 PathProgramCache]: Analyzing trace with hash 491868976, now seen corresponding path program 1 times [2019-09-10 08:45:10,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:10,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:10,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:10,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:10,319 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:10,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:10,540 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:45:10,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:10,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:45:10,541 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:10,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:45:10,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:45:10,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:45:10,542 INFO L87 Difference]: Start difference. First operand 113080 states and 161607 transitions. Second operand 8 states. [2019-09-10 08:45:12,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:12,155 INFO L93 Difference]: Finished difference Result 258830 states and 368910 transitions. [2019-09-10 08:45:12,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 08:45:12,155 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 179 [2019-09-10 08:45:12,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:12,535 INFO L225 Difference]: With dead ends: 258830 [2019-09-10 08:45:12,535 INFO L226 Difference]: Without dead ends: 258830 [2019-09-10 08:45:12,536 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:45:12,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258830 states. [2019-09-10 08:45:15,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258830 to 127164. [2019-09-10 08:45:15,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127164 states. [2019-09-10 08:45:15,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127164 states to 127164 states and 182649 transitions. [2019-09-10 08:45:15,350 INFO L78 Accepts]: Start accepts. Automaton has 127164 states and 182649 transitions. Word has length 179 [2019-09-10 08:45:15,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:15,351 INFO L475 AbstractCegarLoop]: Abstraction has 127164 states and 182649 transitions. [2019-09-10 08:45:15,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:45:15,351 INFO L276 IsEmpty]: Start isEmpty. Operand 127164 states and 182649 transitions. [2019-09-10 08:45:15,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-10 08:45:15,368 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:15,369 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:15,369 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:15,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:15,369 INFO L82 PathProgramCache]: Analyzing trace with hash 856301933, now seen corresponding path program 1 times [2019-09-10 08:45:15,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:15,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:15,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:15,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:15,371 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:15,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:17,246 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:45:17,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:17,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 08:45:17,246 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:17,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 08:45:17,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 08:45:17,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:45:17,248 INFO L87 Difference]: Start difference. First operand 127164 states and 182649 transitions. Second operand 22 states. [2019-09-10 08:45:17,937 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-09-10 08:45:18,098 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-09-10 08:45:18,314 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-09-10 08:45:18,525 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2019-09-10 08:45:18,886 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-09-10 08:45:19,055 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-09-10 08:45:23,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:23,833 INFO L93 Difference]: Finished difference Result 214625 states and 309633 transitions. [2019-09-10 08:45:23,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 08:45:23,834 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 179 [2019-09-10 08:45:23,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:24,135 INFO L225 Difference]: With dead ends: 214625 [2019-09-10 08:45:24,135 INFO L226 Difference]: Without dead ends: 214625 [2019-09-10 08:45:24,136 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=262, Invalid=860, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 08:45:24,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214625 states. [2019-09-10 08:45:26,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214625 to 210231. [2019-09-10 08:45:26,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210231 states. [2019-09-10 08:45:27,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210231 states to 210231 states and 304555 transitions. [2019-09-10 08:45:27,087 INFO L78 Accepts]: Start accepts. Automaton has 210231 states and 304555 transitions. Word has length 179 [2019-09-10 08:45:27,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:27,087 INFO L475 AbstractCegarLoop]: Abstraction has 210231 states and 304555 transitions. [2019-09-10 08:45:27,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 08:45:27,088 INFO L276 IsEmpty]: Start isEmpty. Operand 210231 states and 304555 transitions. [2019-09-10 08:45:27,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-10 08:45:27,110 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:27,110 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:27,110 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:27,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:27,111 INFO L82 PathProgramCache]: Analyzing trace with hash -575494194, now seen corresponding path program 1 times [2019-09-10 08:45:27,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:27,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:27,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:27,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:27,112 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:27,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:27,227 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:45:27,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:27,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:45:27,228 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:27,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:45:27,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:45:27,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:45:27,229 INFO L87 Difference]: Start difference. First operand 210231 states and 304555 transitions. Second operand 4 states. [2019-09-10 08:45:28,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:28,406 INFO L93 Difference]: Finished difference Result 390593 states and 574544 transitions. [2019-09-10 08:45:28,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:45:28,407 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2019-09-10 08:45:28,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:28,986 INFO L225 Difference]: With dead ends: 390593 [2019-09-10 08:45:28,987 INFO L226 Difference]: Without dead ends: 390593 [2019-09-10 08:45:28,987 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:45:29,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390593 states. [2019-09-10 08:45:34,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390593 to 207139. [2019-09-10 08:45:34,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207139 states. [2019-09-10 08:45:34,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207139 states to 207139 states and 300946 transitions. [2019-09-10 08:45:34,624 INFO L78 Accepts]: Start accepts. Automaton has 207139 states and 300946 transitions. Word has length 179 [2019-09-10 08:45:34,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:34,625 INFO L475 AbstractCegarLoop]: Abstraction has 207139 states and 300946 transitions. [2019-09-10 08:45:34,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:45:34,625 INFO L276 IsEmpty]: Start isEmpty. Operand 207139 states and 300946 transitions. [2019-09-10 08:45:34,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-10 08:45:34,645 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:34,645 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:34,645 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:34,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:34,646 INFO L82 PathProgramCache]: Analyzing trace with hash -252059593, now seen corresponding path program 1 times [2019-09-10 08:45:34,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:34,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:34,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:34,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:34,647 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:34,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:34,814 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:45:34,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:34,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:45:34,815 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:34,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:45:34,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:45:34,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:45:34,816 INFO L87 Difference]: Start difference. First operand 207139 states and 300946 transitions. Second operand 8 states. [2019-09-10 08:45:41,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:41,001 INFO L93 Difference]: Finished difference Result 475187 states and 685669 transitions. [2019-09-10 08:45:41,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 08:45:41,001 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 179 [2019-09-10 08:45:41,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:41,694 INFO L225 Difference]: With dead ends: 475187 [2019-09-10 08:45:41,695 INFO L226 Difference]: Without dead ends: 475187 [2019-09-10 08:45:41,695 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:45:41,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475187 states. [2019-09-10 08:45:45,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475187 to 242041. [2019-09-10 08:45:45,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242041 states. [2019-09-10 08:45:45,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242041 states to 242041 states and 352293 transitions. [2019-09-10 08:45:45,431 INFO L78 Accepts]: Start accepts. Automaton has 242041 states and 352293 transitions. Word has length 179 [2019-09-10 08:45:45,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:45,431 INFO L475 AbstractCegarLoop]: Abstraction has 242041 states and 352293 transitions. [2019-09-10 08:45:45,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:45:45,432 INFO L276 IsEmpty]: Start isEmpty. Operand 242041 states and 352293 transitions. [2019-09-10 08:45:45,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-10 08:45:45,463 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:45,464 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:45,464 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:45,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:45,464 INFO L82 PathProgramCache]: Analyzing trace with hash 142326025, now seen corresponding path program 1 times [2019-09-10 08:45:45,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:45,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:45,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:45,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:45,466 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:45,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:46,665 WARN L188 SmtUtils]: Spent 809.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 23 [2019-09-10 08:45:47,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:45:47,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:47,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 08:45:47,949 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:47,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:45:47,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:45:47,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:45:47,950 INFO L87 Difference]: Start difference. First operand 242041 states and 352293 transitions. Second operand 21 states. [2019-09-10 08:45:48,540 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2019-09-10 08:45:48,693 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2019-09-10 08:45:48,986 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 08:45:49,170 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-09-10 08:45:49,577 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 39 [2019-09-10 08:45:56,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:56,862 INFO L93 Difference]: Finished difference Result 296697 states and 430545 transitions. [2019-09-10 08:45:56,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 08:45:56,863 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 179 [2019-09-10 08:45:56,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:57,264 INFO L225 Difference]: With dead ends: 296697 [2019-09-10 08:45:57,264 INFO L226 Difference]: Without dead ends: 296697 [2019-09-10 08:45:57,265 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=251, Invalid=939, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 08:45:57,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296697 states. [2019-09-10 08:46:00,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296697 to 244572. [2019-09-10 08:46:00,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244572 states. [2019-09-10 08:46:00,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244572 states to 244572 states and 355204 transitions. [2019-09-10 08:46:00,398 INFO L78 Accepts]: Start accepts. Automaton has 244572 states and 355204 transitions. Word has length 179 [2019-09-10 08:46:00,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:46:00,399 INFO L475 AbstractCegarLoop]: Abstraction has 244572 states and 355204 transitions. [2019-09-10 08:46:00,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:46:00,399 INFO L276 IsEmpty]: Start isEmpty. Operand 244572 states and 355204 transitions. [2019-09-10 08:46:00,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 08:46:00,422 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:46:00,423 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:00,423 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:46:00,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:46:00,423 INFO L82 PathProgramCache]: Analyzing trace with hash 35191408, now seen corresponding path program 1 times [2019-09-10 08:46:00,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:46:00,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:00,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:46:00,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:00,425 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:46:00,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:46:00,503 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:46:00,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:46:00,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:46:00,504 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:46:00,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:46:00,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:46:00,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:46:00,505 INFO L87 Difference]: Start difference. First operand 244572 states and 355204 transitions. Second operand 3 states. [2019-09-10 08:46:03,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:46:03,920 INFO L93 Difference]: Finished difference Result 243505 states and 353060 transitions. [2019-09-10 08:46:03,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:46:03,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-09-10 08:46:03,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:46:04,258 INFO L225 Difference]: With dead ends: 243505 [2019-09-10 08:46:04,259 INFO L226 Difference]: Without dead ends: 243505 [2019-09-10 08:46:04,259 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:46:04,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243505 states. [2019-09-10 08:46:06,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243505 to 243505. [2019-09-10 08:46:06,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243505 states. [2019-09-10 08:46:07,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243505 states to 243505 states and 353060 transitions. [2019-09-10 08:46:07,697 INFO L78 Accepts]: Start accepts. Automaton has 243505 states and 353060 transitions. Word has length 180 [2019-09-10 08:46:07,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:46:07,697 INFO L475 AbstractCegarLoop]: Abstraction has 243505 states and 353060 transitions. [2019-09-10 08:46:07,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:46:07,698 INFO L276 IsEmpty]: Start isEmpty. Operand 243505 states and 353060 transitions. [2019-09-10 08:46:07,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 08:46:07,720 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:46:07,720 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:07,720 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:46:07,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:46:07,721 INFO L82 PathProgramCache]: Analyzing trace with hash -539346511, now seen corresponding path program 1 times [2019-09-10 08:46:07,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:46:07,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:07,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:46:07,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:07,722 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:46:07,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:46:07,791 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:46:07,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:46:07,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:46:07,792 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:46:07,792 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:46:07,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:46:07,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:46:07,793 INFO L87 Difference]: Start difference. First operand 243505 states and 353060 transitions. Second operand 3 states. [2019-09-10 08:46:08,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:46:08,530 INFO L93 Difference]: Finished difference Result 256603 states and 368860 transitions. [2019-09-10 08:46:08,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:46:08,531 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-09-10 08:46:08,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:46:08,980 INFO L225 Difference]: With dead ends: 256603 [2019-09-10 08:46:08,980 INFO L226 Difference]: Without dead ends: 256603 [2019-09-10 08:46:08,981 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:46:09,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256603 states. [2019-09-10 08:46:15,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256603 to 241697. [2019-09-10 08:46:15,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241697 states. [2019-09-10 08:46:15,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241697 states to 241697 states and 349431 transitions. [2019-09-10 08:46:15,754 INFO L78 Accepts]: Start accepts. Automaton has 241697 states and 349431 transitions. Word has length 180 [2019-09-10 08:46:15,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:46:15,754 INFO L475 AbstractCegarLoop]: Abstraction has 241697 states and 349431 transitions. [2019-09-10 08:46:15,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:46:15,754 INFO L276 IsEmpty]: Start isEmpty. Operand 241697 states and 349431 transitions. [2019-09-10 08:46:15,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 08:46:15,777 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:46:15,777 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:15,777 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:46:15,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:46:15,778 INFO L82 PathProgramCache]: Analyzing trace with hash 296336892, now seen corresponding path program 1 times [2019-09-10 08:46:15,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:46:15,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:15,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:46:15,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:15,779 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:46:15,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:46:15,841 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:46:15,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:46:15,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:46:15,842 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:46:15,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:46:15,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:46:15,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:46:15,843 INFO L87 Difference]: Start difference. First operand 241697 states and 349431 transitions. Second operand 3 states. [2019-09-10 08:46:16,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:46:16,533 INFO L93 Difference]: Finished difference Result 238839 states and 344943 transitions. [2019-09-10 08:46:16,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:46:16,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-09-10 08:46:16,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:46:16,905 INFO L225 Difference]: With dead ends: 238839 [2019-09-10 08:46:16,906 INFO L226 Difference]: Without dead ends: 238839 [2019-09-10 08:46:16,906 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:46:17,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238839 states. [2019-09-10 08:46:24,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238839 to 238839. [2019-09-10 08:46:24,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238839 states. [2019-09-10 08:46:24,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238839 states to 238839 states and 344943 transitions. [2019-09-10 08:46:24,512 INFO L78 Accepts]: Start accepts. Automaton has 238839 states and 344943 transitions. Word has length 180 [2019-09-10 08:46:24,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:46:24,512 INFO L475 AbstractCegarLoop]: Abstraction has 238839 states and 344943 transitions. [2019-09-10 08:46:24,512 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:46:24,512 INFO L276 IsEmpty]: Start isEmpty. Operand 238839 states and 344943 transitions. [2019-09-10 08:46:24,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 08:46:24,531 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:46:24,531 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:24,531 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:46:24,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:46:24,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1745846367, now seen corresponding path program 1 times [2019-09-10 08:46:24,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:46:24,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:24,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:46:24,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:24,533 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:46:24,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:46:24,601 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:46:24,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:46:24,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:46:24,602 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:46:24,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:46:24,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:46:24,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:46:24,603 INFO L87 Difference]: Start difference. First operand 238839 states and 344943 transitions. Second operand 3 states. [2019-09-10 08:46:25,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:46:25,206 INFO L93 Difference]: Finished difference Result 237160 states and 341577 transitions. [2019-09-10 08:46:25,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:46:25,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-09-10 08:46:25,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:46:25,518 INFO L225 Difference]: With dead ends: 237160 [2019-09-10 08:46:25,519 INFO L226 Difference]: Without dead ends: 237160 [2019-09-10 08:46:25,519 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:46:25,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237160 states. [2019-09-10 08:46:32,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237160 to 237160. [2019-09-10 08:46:32,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237160 states. [2019-09-10 08:46:32,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237160 states to 237160 states and 341577 transitions. [2019-09-10 08:46:32,941 INFO L78 Accepts]: Start accepts. Automaton has 237160 states and 341577 transitions. Word has length 180 [2019-09-10 08:46:32,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:46:32,941 INFO L475 AbstractCegarLoop]: Abstraction has 237160 states and 341577 transitions. [2019-09-10 08:46:32,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:46:32,941 INFO L276 IsEmpty]: Start isEmpty. Operand 237160 states and 341577 transitions. [2019-09-10 08:46:32,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 08:46:32,967 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:46:32,967 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:32,967 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:46:32,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:46:32,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1254863670, now seen corresponding path program 1 times [2019-09-10 08:46:32,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:46:32,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:32,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:46:32,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:32,969 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:46:32,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:46:33,046 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:46:33,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:46:33,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:46:33,046 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:46:33,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:46:33,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:46:33,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:46:33,048 INFO L87 Difference]: Start difference. First operand 237160 states and 341577 transitions. Second operand 3 states. [2019-09-10 08:46:33,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:46:33,832 INFO L93 Difference]: Finished difference Result 235899 states and 339045 transitions. [2019-09-10 08:46:33,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:46:33,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-09-10 08:46:33,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:46:34,200 INFO L225 Difference]: With dead ends: 235899 [2019-09-10 08:46:34,200 INFO L226 Difference]: Without dead ends: 235899 [2019-09-10 08:46:34,200 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:46:34,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235899 states. [2019-09-10 08:46:40,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235899 to 235899. [2019-09-10 08:46:40,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235899 states. [2019-09-10 08:46:41,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235899 states to 235899 states and 339045 transitions. [2019-09-10 08:46:41,297 INFO L78 Accepts]: Start accepts. Automaton has 235899 states and 339045 transitions. Word has length 180 [2019-09-10 08:46:41,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:46:41,298 INFO L475 AbstractCegarLoop]: Abstraction has 235899 states and 339045 transitions. [2019-09-10 08:46:41,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:46:41,298 INFO L276 IsEmpty]: Start isEmpty. Operand 235899 states and 339045 transitions. [2019-09-10 08:46:41,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 08:46:41,322 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:46:41,322 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:41,323 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:46:41,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:46:41,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1538111831, now seen corresponding path program 1 times [2019-09-10 08:46:41,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:46:41,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:41,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:46:41,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:41,324 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:46:41,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:46:41,387 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:46:41,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:46:41,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:46:41,387 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:46:41,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:46:41,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:46:41,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:46:41,388 INFO L87 Difference]: Start difference. First operand 235899 states and 339045 transitions. Second operand 3 states. [2019-09-10 08:46:42,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:46:42,988 INFO L93 Difference]: Finished difference Result 231761 states and 332728 transitions. [2019-09-10 08:46:42,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:46:42,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-09-10 08:46:42,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:46:43,306 INFO L225 Difference]: With dead ends: 231761 [2019-09-10 08:46:43,306 INFO L226 Difference]: Without dead ends: 231761 [2019-09-10 08:46:43,307 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:46:43,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231761 states. [2019-09-10 08:46:45,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231761 to 231761. [2019-09-10 08:46:45,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231761 states. [2019-09-10 08:46:46,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231761 states to 231761 states and 332728 transitions. [2019-09-10 08:46:46,344 INFO L78 Accepts]: Start accepts. Automaton has 231761 states and 332728 transitions. Word has length 180 [2019-09-10 08:46:46,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:46:46,344 INFO L475 AbstractCegarLoop]: Abstraction has 231761 states and 332728 transitions. [2019-09-10 08:46:46,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:46:46,344 INFO L276 IsEmpty]: Start isEmpty. Operand 231761 states and 332728 transitions. [2019-09-10 08:46:46,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-10 08:46:46,366 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:46:46,367 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:46,367 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:46:46,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:46:46,367 INFO L82 PathProgramCache]: Analyzing trace with hash 2012194416, now seen corresponding path program 1 times [2019-09-10 08:46:46,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:46:46,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:46,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:46:46,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:46,368 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:46:46,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:46:47,560 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:46:47,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:46:47,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:46:47,561 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:46:47,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:46:47,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:46:47,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:46:47,562 INFO L87 Difference]: Start difference. First operand 231761 states and 332728 transitions. Second operand 4 states. [2019-09-10 08:46:48,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:46:48,502 INFO L93 Difference]: Finished difference Result 322866 states and 465963 transitions. [2019-09-10 08:46:48,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:46:48,502 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2019-09-10 08:46:48,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:46:49,045 INFO L225 Difference]: With dead ends: 322866 [2019-09-10 08:46:49,045 INFO L226 Difference]: Without dead ends: 322866 [2019-09-10 08:46:49,045 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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:46:49,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322866 states. [2019-09-10 08:46:55,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322866 to 262023. [2019-09-10 08:46:55,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262023 states. [2019-09-10 08:46:56,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262023 states to 262023 states and 377225 transitions. [2019-09-10 08:46:56,104 INFO L78 Accepts]: Start accepts. Automaton has 262023 states and 377225 transitions. Word has length 182 [2019-09-10 08:46:56,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:46:56,104 INFO L475 AbstractCegarLoop]: Abstraction has 262023 states and 377225 transitions. [2019-09-10 08:46:56,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:46:56,105 INFO L276 IsEmpty]: Start isEmpty. Operand 262023 states and 377225 transitions. [2019-09-10 08:46:56,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-10 08:46:56,125 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:46:56,126 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:56,126 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:46:56,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:46:56,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1501961916, now seen corresponding path program 1 times [2019-09-10 08:46:56,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:46:56,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:56,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:46:56,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:56,127 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:46:56,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:46:57,099 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:46:57,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:46:57,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:46:57,099 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:46:57,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:46:57,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:46:57,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:46:57,101 INFO L87 Difference]: Start difference. First operand 262023 states and 377225 transitions. Second operand 8 states. [2019-09-10 08:46:57,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:46:57,670 INFO L93 Difference]: Finished difference Result 203104 states and 289153 transitions. [2019-09-10 08:46:57,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:46:57,671 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 182 [2019-09-10 08:46:57,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:46:58,012 INFO L225 Difference]: With dead ends: 203104 [2019-09-10 08:46:58,012 INFO L226 Difference]: Without dead ends: 203104 [2019-09-10 08:46:58,013 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:46:58,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203104 states. [2019-09-10 08:47:03,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203104 to 203102. [2019-09-10 08:47:03,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203102 states. [2019-09-10 08:47:03,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203102 states to 203102 states and 289152 transitions. [2019-09-10 08:47:03,981 INFO L78 Accepts]: Start accepts. Automaton has 203102 states and 289152 transitions. Word has length 182 [2019-09-10 08:47:03,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:47:03,982 INFO L475 AbstractCegarLoop]: Abstraction has 203102 states and 289152 transitions. [2019-09-10 08:47:03,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:47:03,982 INFO L276 IsEmpty]: Start isEmpty. Operand 203102 states and 289152 transitions. [2019-09-10 08:47:04,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-10 08:47:04,003 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:04,003 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:04,004 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:04,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:04,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1918001299, now seen corresponding path program 1 times [2019-09-10 08:47:04,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:04,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:04,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:04,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:04,005 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:04,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:05,755 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:47:05,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:47:05,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 08:47:05,755 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:05,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 08:47:05,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 08:47:05,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:47:05,756 INFO L87 Difference]: Start difference. First operand 203102 states and 289152 transitions. Second operand 22 states. [2019-09-10 08:47:06,457 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2019-09-10 08:47:07,505 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2019-09-10 08:47:07,972 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 38 [2019-09-10 08:47:08,196 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2019-09-10 08:47:08,411 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-09-10 08:47:08,640 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-09-10 08:47:08,842 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-09-10 08:47:09,104 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 08:47:09,371 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:47:09,591 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 38 [2019-09-10 08:47:09,807 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-09-10 08:47:10,135 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:47:12,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:47:12,666 INFO L93 Difference]: Finished difference Result 208236 states and 294655 transitions. [2019-09-10 08:47:12,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-10 08:47:12,667 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 182 [2019-09-10 08:47:12,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:47:12,916 INFO L225 Difference]: With dead ends: 208236 [2019-09-10 08:47:12,916 INFO L226 Difference]: Without dead ends: 208236 [2019-09-10 08:47:12,917 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=454, Invalid=1438, Unknown=0, NotChecked=0, Total=1892 [2019-09-10 08:47:13,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208236 states. [2019-09-10 08:47:14,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208236 to 203990. [2019-09-10 08:47:14,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203990 states. [2019-09-10 08:47:15,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203990 states to 203990 states and 290101 transitions. [2019-09-10 08:47:15,263 INFO L78 Accepts]: Start accepts. Automaton has 203990 states and 290101 transitions. Word has length 182 [2019-09-10 08:47:15,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:47:15,263 INFO L475 AbstractCegarLoop]: Abstraction has 203990 states and 290101 transitions. [2019-09-10 08:47:15,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 08:47:15,263 INFO L276 IsEmpty]: Start isEmpty. Operand 203990 states and 290101 transitions. [2019-09-10 08:47:15,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-10 08:47:15,282 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:15,282 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:15,282 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:15,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:15,282 INFO L82 PathProgramCache]: Analyzing trace with hash 536049072, now seen corresponding path program 1 times [2019-09-10 08:47:15,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:15,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:15,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:15,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:15,283 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:15,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:16,772 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:47:16,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:47:16,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-09-10 08:47:16,772 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:16,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 08:47:16,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 08:47:16,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2019-09-10 08:47:16,773 INFO L87 Difference]: Start difference. First operand 203990 states and 290101 transitions. Second operand 23 states. [2019-09-10 08:47:18,277 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-09-10 08:47:18,614 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-09-10 08:47:18,830 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-09-10 08:47:19,050 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-09-10 08:47:19,233 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-09-10 08:47:19,408 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-09-10 08:47:19,863 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2019-09-10 08:47:20,008 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-09-10 08:47:20,544 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:47:21,003 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2019-09-10 08:47:21,472 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2019-09-10 08:47:21,780 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 63 [2019-09-10 08:47:22,226 WARN L188 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-09-10 08:47:22,676 WARN L188 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 77 [2019-09-10 08:47:23,098 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 70 [2019-09-10 08:47:23,393 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-09-10 08:47:23,741 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 63 [2019-09-10 08:47:24,040 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-09-10 08:47:24,419 WARN L188 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-09-10 08:47:24,799 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2019-09-10 08:47:25,181 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 70 [2019-09-10 08:47:25,543 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 66 [2019-09-10 08:47:25,985 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-09-10 08:47:27,083 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2019-09-10 08:47:27,427 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-10 08:47:27,857 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-09-10 08:47:28,062 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-10 08:47:28,408 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 62 [2019-09-10 08:47:28,955 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-09-10 08:47:29,327 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 08:47:30,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:47:30,230 INFO L93 Difference]: Finished difference Result 209082 states and 295669 transitions. [2019-09-10 08:47:30,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-10 08:47:30,235 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 182 [2019-09-10 08:47:30,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:47:30,494 INFO L225 Difference]: With dead ends: 209082 [2019-09-10 08:47:30,495 INFO L226 Difference]: Without dead ends: 209082 [2019-09-10 08:47:30,496 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=788, Invalid=2404, Unknown=0, NotChecked=0, Total=3192 [2019-09-10 08:47:30,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209082 states. [2019-09-10 08:47:36,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209082 to 205466. [2019-09-10 08:47:36,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205466 states. [2019-09-10 08:47:37,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205466 states to 205466 states and 291727 transitions. [2019-09-10 08:47:37,064 INFO L78 Accepts]: Start accepts. Automaton has 205466 states and 291727 transitions. Word has length 182 [2019-09-10 08:47:37,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:47:37,065 INFO L475 AbstractCegarLoop]: Abstraction has 205466 states and 291727 transitions. [2019-09-10 08:47:37,065 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 08:47:37,065 INFO L276 IsEmpty]: Start isEmpty. Operand 205466 states and 291727 transitions. [2019-09-10 08:47:37,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-10 08:47:37,089 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:37,090 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:37,090 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:37,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:37,090 INFO L82 PathProgramCache]: Analyzing trace with hash 248842719, now seen corresponding path program 1 times [2019-09-10 08:47:37,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:37,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:37,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:37,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:37,092 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:37,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:37,208 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:47:37,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:47:37,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:47:37,209 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:37,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:47:37,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:47:37,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:47:37,210 INFO L87 Difference]: Start difference. First operand 205466 states and 291727 transitions. Second operand 4 states. [2019-09-10 08:47:37,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:47:37,766 INFO L93 Difference]: Finished difference Result 146686 states and 204663 transitions. [2019-09-10 08:47:37,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:47:37,767 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2019-09-10 08:47:37,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:47:37,990 INFO L225 Difference]: With dead ends: 146686 [2019-09-10 08:47:37,990 INFO L226 Difference]: Without dead ends: 146686 [2019-09-10 08:47:37,990 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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:47:38,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146686 states. [2019-09-10 08:47:40,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146686 to 146684. [2019-09-10 08:47:40,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146684 states. [2019-09-10 08:47:41,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146684 states to 146684 states and 204662 transitions. [2019-09-10 08:47:41,019 INFO L78 Accepts]: Start accepts. Automaton has 146684 states and 204662 transitions. Word has length 182 [2019-09-10 08:47:41,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:47:41,020 INFO L475 AbstractCegarLoop]: Abstraction has 146684 states and 204662 transitions. [2019-09-10 08:47:41,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:47:41,020 INFO L276 IsEmpty]: Start isEmpty. Operand 146684 states and 204662 transitions. [2019-09-10 08:47:41,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-10 08:47:41,047 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:41,047 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:41,047 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:41,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:41,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1485721997, now seen corresponding path program 1 times [2019-09-10 08:47:41,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:41,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:41,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:41,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:41,049 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:41,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:42,252 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:47:42,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:47:42,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-10 08:47:42,253 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:42,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 08:47:42,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 08:47:42,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2019-09-10 08:47:42,254 INFO L87 Difference]: Start difference. First operand 146684 states and 204662 transitions. Second operand 25 states. [2019-09-10 08:47:42,983 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-09-10 08:47:43,151 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-09-10 08:47:43,479 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-09-10 08:47:43,716 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-09-10 08:47:44,019 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2019-09-10 08:47:44,342 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 72 [2019-09-10 08:47:44,655 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-10 08:47:44,868 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-10 08:47:45,084 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2019-09-10 08:47:45,820 WARN L188 SmtUtils]: Spent 696.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-09-10 08:47:47,222 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 40 [2019-09-10 08:47:47,473 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2019-09-10 08:47:47,692 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 41 [2019-09-10 08:47:48,420 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-09-10 08:47:48,986 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-10 08:47:49,221 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-09-10 08:47:53,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:47:53,062 INFO L93 Difference]: Finished difference Result 183676 states and 257635 transitions. [2019-09-10 08:47:53,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 08:47:53,062 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 182 [2019-09-10 08:47:53,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:47:53,303 INFO L225 Difference]: With dead ends: 183676 [2019-09-10 08:47:53,304 INFO L226 Difference]: Without dead ends: 183676 [2019-09-10 08:47:53,304 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=454, Invalid=2096, Unknown=0, NotChecked=0, Total=2550 [2019-09-10 08:47:53,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183676 states. [2019-09-10 08:47:54,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183676 to 147483. [2019-09-10 08:47:54,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147483 states. [2019-09-10 08:47:55,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147483 states to 147483 states and 205516 transitions. [2019-09-10 08:47:55,087 INFO L78 Accepts]: Start accepts. Automaton has 147483 states and 205516 transitions. Word has length 182 [2019-09-10 08:47:55,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:47:55,088 INFO L475 AbstractCegarLoop]: Abstraction has 147483 states and 205516 transitions. [2019-09-10 08:47:55,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 08:47:55,088 INFO L276 IsEmpty]: Start isEmpty. Operand 147483 states and 205516 transitions. [2019-09-10 08:47:55,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-10 08:47:55,111 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:55,111 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:55,112 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:55,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:55,112 INFO L82 PathProgramCache]: Analyzing trace with hash -891134644, now seen corresponding path program 1 times [2019-09-10 08:47:55,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:55,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:55,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:55,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:55,113 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:55,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:55,943 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:47:55,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:47:55,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 08:47:55,943 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:55,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 08:47:55,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 08:47:55,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:47:55,944 INFO L87 Difference]: Start difference. First operand 147483 states and 205516 transitions. Second operand 22 states. [2019-09-10 08:47:56,696 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-09-10 08:47:57,012 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 08:47:57,249 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-09-10 08:47:57,420 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-09-10 08:47:58,011 WARN L188 SmtUtils]: Spent 546.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-09-10 08:47:58,192 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-09-10 08:47:58,374 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-09-10 08:47:58,622 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-09-10 08:47:58,786 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2019-09-10 08:47:59,290 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-09-10 08:47:59,465 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-09-10 08:47:59,834 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-09-10 08:48:00,076 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 42 [2019-09-10 08:48:00,354 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-09-10 08:48:00,616 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 08:48:00,807 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2019-09-10 08:48:01,033 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 08:48:01,304 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2019-09-10 08:48:01,714 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-09-10 08:48:02,338 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 08:48:03,387 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-09-10 08:48:04,752 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 44 [2019-09-10 08:48:05,487 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 44 [2019-09-10 08:48:06,991 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 46 [2019-09-10 08:48:07,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:48:07,701 INFO L93 Difference]: Finished difference Result 207897 states and 290097 transitions. [2019-09-10 08:48:07,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-10 08:48:07,701 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 182 [2019-09-10 08:48:07,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:48:07,955 INFO L225 Difference]: With dead ends: 207897 [2019-09-10 08:48:07,956 INFO L226 Difference]: Without dead ends: 207897 [2019-09-10 08:48:07,956 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 566 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=705, Invalid=2601, Unknown=0, NotChecked=0, Total=3306 [2019-09-10 08:48:08,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207897 states. [2019-09-10 08:48:09,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207897 to 148430. [2019-09-10 08:48:09,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148430 states. [2019-09-10 08:48:10,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148430 states to 148430 states and 206537 transitions. [2019-09-10 08:48:10,101 INFO L78 Accepts]: Start accepts. Automaton has 148430 states and 206537 transitions. Word has length 182 [2019-09-10 08:48:10,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:48:10,101 INFO L475 AbstractCegarLoop]: Abstraction has 148430 states and 206537 transitions. [2019-09-10 08:48:10,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 08:48:10,101 INFO L276 IsEmpty]: Start isEmpty. Operand 148430 states and 206537 transitions. [2019-09-10 08:48:10,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-10 08:48:10,123 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:48:10,123 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:10,123 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:48:10,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:48:10,123 INFO L82 PathProgramCache]: Analyzing trace with hash -202662555, now seen corresponding path program 1 times [2019-09-10 08:48:10,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:48:10,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:10,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:48:10,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:10,124 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:48:10,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:48:12,007 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:48:12,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:48:12,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-09-10 08:48:12,008 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:48:12,008 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 08:48:12,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 08:48:12,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2019-09-10 08:48:12,009 INFO L87 Difference]: Start difference. First operand 148430 states and 206537 transitions. Second operand 23 states. [2019-09-10 08:48:12,853 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-10 08:48:13,010 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-09-10 08:48:13,619 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2019-09-10 08:48:14,590 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-10 08:48:14,917 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-10 08:48:15,139 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-10 08:48:17,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:48:17,000 INFO L93 Difference]: Finished difference Result 152033 states and 210375 transitions. [2019-09-10 08:48:17,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 08:48:17,001 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 182 [2019-09-10 08:48:17,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:48:17,166 INFO L225 Difference]: With dead ends: 152033 [2019-09-10 08:48:17,166 INFO L226 Difference]: Without dead ends: 152033 [2019-09-10 08:48:17,166 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=317, Invalid=1089, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 08:48:17,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152033 states. [2019-09-10 08:48:18,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152033 to 149255. [2019-09-10 08:48:18,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149255 states. [2019-09-10 08:48:18,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149255 states to 149255 states and 207360 transitions. [2019-09-10 08:48:18,879 INFO L78 Accepts]: Start accepts. Automaton has 149255 states and 207360 transitions. Word has length 182 [2019-09-10 08:48:18,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:48:18,879 INFO L475 AbstractCegarLoop]: Abstraction has 149255 states and 207360 transitions. [2019-09-10 08:48:18,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 08:48:18,879 INFO L276 IsEmpty]: Start isEmpty. Operand 149255 states and 207360 transitions. [2019-09-10 08:48:18,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-10 08:48:18,903 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:48:18,903 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:18,903 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:48:18,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:48:18,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1156308866, now seen corresponding path program 1 times [2019-09-10 08:48:18,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:48:18,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:18,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:48:18,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:18,905 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:48:18,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:48:20,398 WARN L188 SmtUtils]: Spent 744.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 37 [2019-09-10 08:48:21,897 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:48:21,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:48:21,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2019-09-10 08:48:21,898 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:48:21,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-10 08:48:21,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-10 08:48:21,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=624, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:48:21,899 INFO L87 Difference]: Start difference. First operand 149255 states and 207360 transitions. Second operand 27 states. [2019-09-10 08:48:22,445 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-09-10 08:48:22,628 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-09-10 08:48:22,945 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-09-10 08:48:23,235 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 71 [2019-09-10 08:48:23,665 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 08:48:23,883 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 08:48:24,114 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 08:48:24,491 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 08:48:24,721 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 08:48:24,947 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 08:48:25,229 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-09-10 08:48:25,455 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-09-10 08:48:26,028 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 47 [2019-09-10 08:48:26,647 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2019-09-10 08:48:26,951 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2019-09-10 08:48:27,280 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2019-09-10 08:48:27,596 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 55 [2019-09-10 08:48:28,216 WARN L188 SmtUtils]: Spent 556.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 57 [2019-09-10 08:48:28,535 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:48:29,279 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2019-09-10 08:48:29,764 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:48:31,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:48:31,715 INFO L93 Difference]: Finished difference Result 151951 states and 210240 transitions. [2019-09-10 08:48:31,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 08:48:31,716 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 182 [2019-09-10 08:48:31,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:48:31,923 INFO L225 Difference]: With dead ends: 151951 [2019-09-10 08:48:31,924 INFO L226 Difference]: Without dead ends: 151951 [2019-09-10 08:48:31,924 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=481, Invalid=1871, Unknown=0, NotChecked=0, Total=2352 [2019-09-10 08:48:32,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151951 states. [2019-09-10 08:48:33,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151951 to 150472. [2019-09-10 08:48:33,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150472 states. [2019-09-10 08:48:33,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150472 states to 150472 states and 208672 transitions. [2019-09-10 08:48:33,930 INFO L78 Accepts]: Start accepts. Automaton has 150472 states and 208672 transitions. Word has length 182 [2019-09-10 08:48:33,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:48:33,930 INFO L475 AbstractCegarLoop]: Abstraction has 150472 states and 208672 transitions. [2019-09-10 08:48:33,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-10 08:48:33,930 INFO L276 IsEmpty]: Start isEmpty. Operand 150472 states and 208672 transitions. [2019-09-10 08:48:33,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 08:48:33,960 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:48:33,960 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:33,961 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:48:33,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:48:33,961 INFO L82 PathProgramCache]: Analyzing trace with hash -549656258, now seen corresponding path program 1 times [2019-09-10 08:48:33,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:48:33,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:33,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:48:33,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:33,962 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:48:34,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:48:35,051 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2019-09-10 08:48:36,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:48:36,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:48:36,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-10 08:48:36,509 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:48:36,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 08:48:36,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 08:48:36,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=553, Unknown=0, NotChecked=0, Total=650 [2019-09-10 08:48:36,510 INFO L87 Difference]: Start difference. First operand 150472 states and 208672 transitions. Second operand 26 states. [2019-09-10 08:48:37,339 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-10 08:48:37,594 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-09-10 08:48:38,187 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-09-10 08:48:38,567 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2019-09-10 08:48:38,842 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 78 [2019-09-10 08:48:39,296 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2019-09-10 08:48:39,534 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-09-10 08:48:39,814 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-09-10 08:48:43,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:48:43,805 INFO L93 Difference]: Finished difference Result 150704 states and 208879 transitions. [2019-09-10 08:48:43,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 08:48:43,812 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 184 [2019-09-10 08:48:43,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:48:43,997 INFO L225 Difference]: With dead ends: 150704 [2019-09-10 08:48:43,997 INFO L226 Difference]: Without dead ends: 150704 [2019-09-10 08:48:43,998 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=334, Invalid=1306, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 08:48:44,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150704 states. [2019-09-10 08:48:45,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150704 to 149113. [2019-09-10 08:48:45,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149113 states. [2019-09-10 08:48:45,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149113 states to 149113 states and 207176 transitions. [2019-09-10 08:48:45,916 INFO L78 Accepts]: Start accepts. Automaton has 149113 states and 207176 transitions. Word has length 184 [2019-09-10 08:48:45,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:48:45,916 INFO L475 AbstractCegarLoop]: Abstraction has 149113 states and 207176 transitions. [2019-09-10 08:48:45,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 08:48:45,916 INFO L276 IsEmpty]: Start isEmpty. Operand 149113 states and 207176 transitions. [2019-09-10 08:48:45,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 08:48:45,941 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:48:45,941 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:45,941 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:48:45,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:48:45,941 INFO L82 PathProgramCache]: Analyzing trace with hash 580265123, now seen corresponding path program 1 times [2019-09-10 08:48:45,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:48:45,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:45,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:48:45,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:45,943 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:48:45,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:48:46,806 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:48:46,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:48:46,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 08:48:46,806 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:48:46,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 08:48:46,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 08:48:46,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:48:46,807 INFO L87 Difference]: Start difference. First operand 149113 states and 207176 transitions. Second operand 15 states. [2019-09-10 08:48:47,466 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-09-10 08:48:49,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:48:49,912 INFO L93 Difference]: Finished difference Result 176026 states and 247486 transitions. [2019-09-10 08:48:49,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:48:49,912 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 184 [2019-09-10 08:48:49,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:48:50,103 INFO L225 Difference]: With dead ends: 176026 [2019-09-10 08:48:50,103 INFO L226 Difference]: Without dead ends: 176026 [2019-09-10 08:48:50,104 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=155, Invalid=445, Unknown=0, NotChecked=0, Total=600 [2019-09-10 08:48:50,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176026 states. [2019-09-10 08:48:51,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176026 to 146052. [2019-09-10 08:48:51,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146052 states. [2019-09-10 08:48:52,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146052 states to 146052 states and 203806 transitions. [2019-09-10 08:48:52,530 INFO L78 Accepts]: Start accepts. Automaton has 146052 states and 203806 transitions. Word has length 184 [2019-09-10 08:48:52,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:48:52,531 INFO L475 AbstractCegarLoop]: Abstraction has 146052 states and 203806 transitions. [2019-09-10 08:48:52,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 08:48:52,531 INFO L276 IsEmpty]: Start isEmpty. Operand 146052 states and 203806 transitions. [2019-09-10 08:48:52,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-10 08:48:52,552 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:48:52,552 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:52,552 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:48:52,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:48:52,552 INFO L82 PathProgramCache]: Analyzing trace with hash -72447932, now seen corresponding path program 1 times [2019-09-10 08:48:52,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:48:52,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:52,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:48:52,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:52,553 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:48:52,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:48:52,637 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:48:52,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:48:52,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:48:52,637 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:48:52,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:48:52,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:48:52,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:48:52,639 INFO L87 Difference]: Start difference. First operand 146052 states and 203806 transitions. Second operand 3 states. [2019-09-10 08:48:52,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:48:52,979 INFO L93 Difference]: Finished difference Result 145134 states and 201899 transitions. [2019-09-10 08:48:52,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:48:52,979 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-09-10 08:48:52,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:48:53,153 INFO L225 Difference]: With dead ends: 145134 [2019-09-10 08:48:53,153 INFO L226 Difference]: Without dead ends: 145134 [2019-09-10 08:48:53,153 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:48:53,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145134 states. [2019-09-10 08:48:55,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145134 to 145008. [2019-09-10 08:48:55,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145008 states. [2019-09-10 08:48:55,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145008 states to 145008 states and 201771 transitions. [2019-09-10 08:48:55,422 INFO L78 Accepts]: Start accepts. Automaton has 145008 states and 201771 transitions. Word has length 185 [2019-09-10 08:48:55,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:48:55,422 INFO L475 AbstractCegarLoop]: Abstraction has 145008 states and 201771 transitions. [2019-09-10 08:48:55,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:48:55,422 INFO L276 IsEmpty]: Start isEmpty. Operand 145008 states and 201771 transitions. [2019-09-10 08:48:55,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-10 08:48:55,446 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:48:55,446 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:55,447 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:48:55,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:48:55,447 INFO L82 PathProgramCache]: Analyzing trace with hash -649343079, now seen corresponding path program 1 times [2019-09-10 08:48:55,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:48:55,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:55,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:48:55,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:55,448 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:48:55,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:48:56,427 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:48:56,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:48:56,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 08:48:56,427 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:48:56,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 08:48:56,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 08:48:56,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:48:56,428 INFO L87 Difference]: Start difference. First operand 145008 states and 201771 transitions. Second operand 19 states. [2019-09-10 08:48:56,984 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-09-10 08:48:57,145 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-09-10 08:48:57,459 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-10 08:48:57,693 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-09-10 08:49:00,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:49:00,350 INFO L93 Difference]: Finished difference Result 175645 states and 245930 transitions. [2019-09-10 08:49:00,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 08:49:00,350 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 187 [2019-09-10 08:49:00,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:49:00,610 INFO L225 Difference]: With dead ends: 175645 [2019-09-10 08:49:00,610 INFO L226 Difference]: Without dead ends: 175645 [2019-09-10 08:49:00,611 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=197, Invalid=733, Unknown=0, NotChecked=0, Total=930 [2019-09-10 08:49:00,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175645 states. [2019-09-10 08:49:02,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175645 to 144789. [2019-09-10 08:49:02,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144789 states. [2019-09-10 08:49:02,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144789 states to 144789 states and 201523 transitions. [2019-09-10 08:49:02,648 INFO L78 Accepts]: Start accepts. Automaton has 144789 states and 201523 transitions. Word has length 187 [2019-09-10 08:49:02,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:49:02,648 INFO L475 AbstractCegarLoop]: Abstraction has 144789 states and 201523 transitions. [2019-09-10 08:49:02,648 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 08:49:02,648 INFO L276 IsEmpty]: Start isEmpty. Operand 144789 states and 201523 transitions. [2019-09-10 08:49:02,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-10 08:49:02,668 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:49:02,669 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:02,669 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:49:02,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:49:02,670 INFO L82 PathProgramCache]: Analyzing trace with hash -251822031, now seen corresponding path program 1 times [2019-09-10 08:49:02,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:49:02,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:02,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:49:02,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:02,671 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:49:02,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:49:04,158 WARN L188 SmtUtils]: Spent 840.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2019-09-10 08:49:04,866 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:49:04,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:49:04,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 08:49:04,867 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:49:04,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:49:04,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:49:04,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:49:04,868 INFO L87 Difference]: Start difference. First operand 144789 states and 201523 transitions. Second operand 21 states. [2019-09-10 08:49:05,318 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2019-09-10 08:49:05,626 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 85 [2019-09-10 08:49:05,880 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 76 [2019-09-10 08:49:06,142 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 82 [2019-09-10 08:49:06,454 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 97 [2019-09-10 08:49:06,824 WARN L188 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 103 [2019-09-10 08:49:09,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:49:09,850 INFO L93 Difference]: Finished difference Result 145638 states and 202419 transitions. [2019-09-10 08:49:09,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 08:49:09,850 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 187 [2019-09-10 08:49:09,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:49:10,026 INFO L225 Difference]: With dead ends: 145638 [2019-09-10 08:49:10,027 INFO L226 Difference]: Without dead ends: 145604 [2019-09-10 08:49:10,027 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=280, Invalid=910, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 08:49:10,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145604 states. [2019-09-10 08:49:11,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145604 to 144337. [2019-09-10 08:49:11,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144337 states. [2019-09-10 08:49:11,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144337 states to 144337 states and 201027 transitions. [2019-09-10 08:49:11,799 INFO L78 Accepts]: Start accepts. Automaton has 144337 states and 201027 transitions. Word has length 187 [2019-09-10 08:49:11,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:49:11,799 INFO L475 AbstractCegarLoop]: Abstraction has 144337 states and 201027 transitions. [2019-09-10 08:49:11,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:49:11,799 INFO L276 IsEmpty]: Start isEmpty. Operand 144337 states and 201027 transitions. [2019-09-10 08:49:11,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-10 08:49:11,819 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:49:11,819 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:11,819 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:49:11,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:49:11,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1629080643, now seen corresponding path program 1 times [2019-09-10 08:49:11,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:49:11,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:11,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:49:11,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:11,821 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:49:11,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:49:13,146 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:49:13,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:49:13,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 08:49:13,147 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:49:13,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:49:13,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:49:13,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:49:13,148 INFO L87 Difference]: Start difference. First operand 144337 states and 201027 transitions. Second operand 21 states. [2019-09-10 08:49:13,675 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 42 [2019-09-10 08:49:14,280 WARN L188 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 65 [2019-09-10 08:49:14,533 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 77 [2019-09-10 08:49:14,973 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 86 [2019-09-10 08:49:15,309 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 91 [2019-09-10 08:49:15,534 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-10 08:49:15,790 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-10 08:49:15,926 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-09-10 08:49:18,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:49:18,299 INFO L93 Difference]: Finished difference Result 145142 states and 201855 transitions. [2019-09-10 08:49:18,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 08:49:18,300 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 187 [2019-09-10 08:49:18,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:49:18,461 INFO L225 Difference]: With dead ends: 145142 [2019-09-10 08:49:18,461 INFO L226 Difference]: Without dead ends: 145142 [2019-09-10 08:49:18,461 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=276, Invalid=914, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 08:49:18,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145142 states. [2019-09-10 08:49:19,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145142 to 143754. [2019-09-10 08:49:19,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143754 states. [2019-09-10 08:49:20,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143754 states to 143754 states and 200390 transitions. [2019-09-10 08:49:20,161 INFO L78 Accepts]: Start accepts. Automaton has 143754 states and 200390 transitions. Word has length 187 [2019-09-10 08:49:20,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:49:20,161 INFO L475 AbstractCegarLoop]: Abstraction has 143754 states and 200390 transitions. [2019-09-10 08:49:20,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:49:20,161 INFO L276 IsEmpty]: Start isEmpty. Operand 143754 states and 200390 transitions. [2019-09-10 08:49:20,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-10 08:49:20,179 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:49:20,180 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:20,180 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:49:20,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:49:20,180 INFO L82 PathProgramCache]: Analyzing trace with hash 597660197, now seen corresponding path program 1 times [2019-09-10 08:49:20,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:49:20,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:20,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:49:20,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:20,181 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:49:20,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:49:21,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:49:21,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:49:21,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 08:49:21,372 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:49:21,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:49:21,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:49:21,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:49:21,373 INFO L87 Difference]: Start difference. First operand 143754 states and 200390 transitions. Second operand 21 states. [2019-09-10 08:49:22,085 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-09-10 08:49:22,254 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-10 08:49:22,547 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2019-09-10 08:49:22,766 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2019-09-10 08:49:23,042 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2019-09-10 08:49:23,374 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2019-09-10 08:49:23,568 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2019-09-10 08:49:23,836 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2019-09-10 08:49:24,009 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-09-10 08:49:26,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:49:26,555 INFO L93 Difference]: Finished difference Result 143550 states and 200154 transitions. [2019-09-10 08:49:26,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 08:49:26,555 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 187 [2019-09-10 08:49:26,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:49:26,737 INFO L225 Difference]: With dead ends: 143550 [2019-09-10 08:49:26,738 INFO L226 Difference]: Without dead ends: 143550 [2019-09-10 08:49:26,738 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=248, Invalid=874, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 08:49:26,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143550 states. [2019-09-10 08:49:27,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143550 to 143341. [2019-09-10 08:49:27,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143341 states. [2019-09-10 08:49:28,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143341 states to 143341 states and 199932 transitions. [2019-09-10 08:49:28,828 INFO L78 Accepts]: Start accepts. Automaton has 143341 states and 199932 transitions. Word has length 187 [2019-09-10 08:49:28,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:49:28,829 INFO L475 AbstractCegarLoop]: Abstraction has 143341 states and 199932 transitions. [2019-09-10 08:49:28,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:49:28,829 INFO L276 IsEmpty]: Start isEmpty. Operand 143341 states and 199932 transitions. [2019-09-10 08:49:28,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-10 08:49:28,847 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:49:28,847 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:28,848 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:49:28,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:49:28,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1386178567, now seen corresponding path program 1 times [2019-09-10 08:49:28,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:49:28,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:28,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:49:28,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:28,850 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:49:28,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:49:30,664 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:49:30,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:49:30,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-09-10 08:49:30,665 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:49:30,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-10 08:49:30,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-10 08:49:30,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2019-09-10 08:49:30,666 INFO L87 Difference]: Start difference. First operand 143341 states and 199932 transitions. Second operand 24 states. [2019-09-10 08:49:31,488 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 08:49:31,753 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 72 [2019-09-10 08:49:32,205 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 77 [2019-09-10 08:49:32,406 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-10 08:49:32,597 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-10 08:49:32,798 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-10 08:49:33,037 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-10 08:49:33,241 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2019-09-10 08:49:33,407 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2019-09-10 08:49:36,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:49:36,448 INFO L93 Difference]: Finished difference Result 143072 states and 199631 transitions. [2019-09-10 08:49:36,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 08:49:36,449 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 187 [2019-09-10 08:49:36,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:49:36,638 INFO L225 Difference]: With dead ends: 143072 [2019-09-10 08:49:36,639 INFO L226 Difference]: Without dead ends: 143053 [2019-09-10 08:49:36,639 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=325, Invalid=1157, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 08:49:37,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143053 states. [2019-09-10 08:49:38,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143053 to 143036. [2019-09-10 08:49:38,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143036 states. [2019-09-10 08:49:38,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143036 states to 143036 states and 199594 transitions. [2019-09-10 08:49:38,495 INFO L78 Accepts]: Start accepts. Automaton has 143036 states and 199594 transitions. Word has length 187 [2019-09-10 08:49:38,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:49:38,495 INFO L475 AbstractCegarLoop]: Abstraction has 143036 states and 199594 transitions. [2019-09-10 08:49:38,495 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-10 08:49:38,495 INFO L276 IsEmpty]: Start isEmpty. Operand 143036 states and 199594 transitions. [2019-09-10 08:49:38,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-10 08:49:38,516 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:49:38,516 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:38,516 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:49:38,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:49:38,517 INFO L82 PathProgramCache]: Analyzing trace with hash 137255826, now seen corresponding path program 1 times [2019-09-10 08:49:38,517 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:49:38,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:38,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:49:38,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:38,518 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:49:38,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:49:40,087 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:49:40,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:49:40,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 08:49:40,088 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:49:40,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:49:40,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:49:40,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:49:40,089 INFO L87 Difference]: Start difference. First operand 143036 states and 199594 transitions. Second operand 21 states. [2019-09-10 08:49:40,223 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2019-09-10 08:49:40,807 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-09-10 08:49:40,990 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-09-10 08:49:41,283 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 70 [2019-09-10 08:49:41,558 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2019-09-10 08:49:41,960 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 80 [2019-09-10 08:49:42,320 WARN L188 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 83 [2019-09-10 08:49:42,576 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-10 08:49:42,886 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-10 08:49:43,145 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-09-10 08:49:43,323 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-10 08:49:43,492 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-09-10 08:49:43,970 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-09-10 08:49:46,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:49:46,392 INFO L93 Difference]: Finished difference Result 153529 states and 212784 transitions. [2019-09-10 08:49:46,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 08:49:46,393 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 187 [2019-09-10 08:49:46,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:49:46,581 INFO L225 Difference]: With dead ends: 153529 [2019-09-10 08:49:46,581 INFO L226 Difference]: Without dead ends: 153529 [2019-09-10 08:49:46,581 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=309, Invalid=1097, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 08:49:46,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153529 states. [2019-09-10 08:49:48,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153529 to 142388. [2019-09-10 08:49:48,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142388 states. [2019-09-10 08:49:48,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142388 states to 142388 states and 198893 transitions. [2019-09-10 08:49:48,337 INFO L78 Accepts]: Start accepts. Automaton has 142388 states and 198893 transitions. Word has length 187 [2019-09-10 08:49:48,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:49:48,338 INFO L475 AbstractCegarLoop]: Abstraction has 142388 states and 198893 transitions. [2019-09-10 08:49:48,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:49:48,338 INFO L276 IsEmpty]: Start isEmpty. Operand 142388 states and 198893 transitions. [2019-09-10 08:49:48,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-10 08:49:48,356 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:49:48,356 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:48,356 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:49:48,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:49:48,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1739091878, now seen corresponding path program 1 times [2019-09-10 08:49:48,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:49:48,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:48,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:49:48,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:48,358 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:49:48,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:49:49,426 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:49:49,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:49:49,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 08:49:49,427 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:49:49,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 08:49:49,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 08:49:49,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:49:49,428 INFO L87 Difference]: Start difference. First operand 142388 states and 198893 transitions. Second operand 22 states. [2019-09-10 08:49:49,663 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 87 [2019-09-10 08:49:50,648 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-09-10 08:49:50,872 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2019-09-10 08:49:51,110 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 86 [2019-09-10 08:49:51,914 WARN L188 SmtUtils]: Spent 532.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 96 [2019-09-10 08:49:52,205 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 107 [2019-09-10 08:49:56,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:49:56,126 INFO L93 Difference]: Finished difference Result 142169 states and 198648 transitions. [2019-09-10 08:49:56,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 08:49:56,127 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 187 [2019-09-10 08:49:56,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:49:56,289 INFO L225 Difference]: With dead ends: 142169 [2019-09-10 08:49:56,289 INFO L226 Difference]: Without dead ends: 142169 [2019-09-10 08:49:56,290 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=361, Invalid=1619, Unknown=0, NotChecked=0, Total=1980 [2019-09-10 08:49:56,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142169 states. [2019-09-10 08:49:57,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142169 to 142146. [2019-09-10 08:49:57,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142146 states. [2019-09-10 08:49:58,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142146 states to 142146 states and 198625 transitions. [2019-09-10 08:49:58,151 INFO L78 Accepts]: Start accepts. Automaton has 142146 states and 198625 transitions. Word has length 187 [2019-09-10 08:49:58,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:49:58,151 INFO L475 AbstractCegarLoop]: Abstraction has 142146 states and 198625 transitions. [2019-09-10 08:49:58,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 08:49:58,152 INFO L276 IsEmpty]: Start isEmpty. Operand 142146 states and 198625 transitions. [2019-09-10 08:49:58,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-10 08:49:58,171 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:49:58,172 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:58,172 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:49:58,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:49:58,172 INFO L82 PathProgramCache]: Analyzing trace with hash 2021463736, now seen corresponding path program 1 times [2019-09-10 08:49:58,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:49:58,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:58,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:49:58,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:58,173 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:49:58,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:49:58,905 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:49:58,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:49:58,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-09-10 08:49:58,906 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:49:58,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-10 08:49:58,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-10 08:49:58,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552 [2019-09-10 08:49:58,907 INFO L87 Difference]: Start difference. First operand 142146 states and 198625 transitions. Second operand 24 states. [2019-09-10 08:49:59,082 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-09-10 08:50:00,159 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-10 08:50:00,351 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-09-10 08:50:00,670 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2019-09-10 08:50:00,926 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 80 [2019-09-10 08:50:05,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:05,284 INFO L93 Difference]: Finished difference Result 172043 states and 242024 transitions. [2019-09-10 08:50:05,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 08:50:05,284 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 187 [2019-09-10 08:50:05,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:05,518 INFO L225 Difference]: With dead ends: 172043 [2019-09-10 08:50:05,518 INFO L226 Difference]: Without dead ends: 172043 [2019-09-10 08:50:05,519 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=408, Invalid=1754, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 08:50:05,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172043 states. [2019-09-10 08:50:06,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172043 to 141934. [2019-09-10 08:50:06,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141934 states. [2019-09-10 08:50:08,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141934 states to 141934 states and 198394 transitions. [2019-09-10 08:50:08,105 INFO L78 Accepts]: Start accepts. Automaton has 141934 states and 198394 transitions. Word has length 187 [2019-09-10 08:50:08,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:08,105 INFO L475 AbstractCegarLoop]: Abstraction has 141934 states and 198394 transitions. [2019-09-10 08:50:08,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-10 08:50:08,105 INFO L276 IsEmpty]: Start isEmpty. Operand 141934 states and 198394 transitions. [2019-09-10 08:50:08,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-10 08:50:08,121 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:08,121 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:08,122 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:08,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:08,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1151767793, now seen corresponding path program 1 times [2019-09-10 08:50:08,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:08,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:08,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:08,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:08,123 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:08,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:08,854 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:50:08,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:08,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:50:08,855 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:08,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:50:08,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:50:08,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:50:08,857 INFO L87 Difference]: Start difference. First operand 141934 states and 198394 transitions. Second operand 17 states. [2019-09-10 08:50:09,037 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 08:50:09,778 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-09-10 08:50:09,935 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 69 [2019-09-10 08:50:12,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:12,646 INFO L93 Difference]: Finished difference Result 152898 states and 213584 transitions. [2019-09-10 08:50:12,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 08:50:12,646 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 187 [2019-09-10 08:50:12,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:12,852 INFO L225 Difference]: With dead ends: 152898 [2019-09-10 08:50:12,852 INFO L226 Difference]: Without dead ends: 152898 [2019-09-10 08:50:12,852 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=292, Invalid=1190, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 08:50:12,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152898 states. [2019-09-10 08:50:14,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152898 to 141560. [2019-09-10 08:50:14,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141560 states. [2019-09-10 08:50:14,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141560 states to 141560 states and 197984 transitions. [2019-09-10 08:50:14,707 INFO L78 Accepts]: Start accepts. Automaton has 141560 states and 197984 transitions. Word has length 187 [2019-09-10 08:50:14,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:14,708 INFO L475 AbstractCegarLoop]: Abstraction has 141560 states and 197984 transitions. [2019-09-10 08:50:14,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:50:14,708 INFO L276 IsEmpty]: Start isEmpty. Operand 141560 states and 197984 transitions. [2019-09-10 08:50:14,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-10 08:50:14,724 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:14,725 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:14,725 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:14,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:14,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1817065666, now seen corresponding path program 1 times [2019-09-10 08:50:14,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:14,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:14,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:14,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:14,727 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:14,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:16,117 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:50:16,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:16,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-10 08:50:16,117 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:16,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 08:50:16,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 08:50:16,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:50:16,118 INFO L87 Difference]: Start difference. First operand 141560 states and 197984 transitions. Second operand 20 states. [2019-09-10 08:50:16,456 WARN L188 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 101 [2019-09-10 08:50:16,715 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2019-09-10 08:50:17,359 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-09-10 08:50:17,540 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 08:50:17,910 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-09-10 08:50:18,186 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 82 [2019-09-10 08:50:18,598 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 96 [2019-09-10 08:50:18,988 WARN L188 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 105 [2019-09-10 08:50:19,592 WARN L188 SmtUtils]: Spent 528.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-09-10 08:50:19,927 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-09-10 08:50:20,125 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-09-10 08:50:20,294 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-09-10 08:50:20,499 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-09-10 08:50:20,779 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-09-10 08:50:20,957 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-09-10 08:50:21,278 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-09-10 08:50:23,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:23,859 INFO L93 Difference]: Finished difference Result 153220 states and 212846 transitions. [2019-09-10 08:50:23,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 08:50:23,860 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 187 [2019-09-10 08:50:23,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:24,064 INFO L225 Difference]: With dead ends: 153220 [2019-09-10 08:50:24,064 INFO L226 Difference]: Without dead ends: 153206 [2019-09-10 08:50:24,065 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=379, Invalid=1181, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 08:50:24,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153206 states. [2019-09-10 08:50:25,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153206 to 140915. [2019-09-10 08:50:25,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140915 states. [2019-09-10 08:50:26,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140915 states to 140915 states and 197269 transitions. [2019-09-10 08:50:26,040 INFO L78 Accepts]: Start accepts. Automaton has 140915 states and 197269 transitions. Word has length 187 [2019-09-10 08:50:26,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:26,040 INFO L475 AbstractCegarLoop]: Abstraction has 140915 states and 197269 transitions. [2019-09-10 08:50:26,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 08:50:26,040 INFO L276 IsEmpty]: Start isEmpty. Operand 140915 states and 197269 transitions. [2019-09-10 08:50:26,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-10 08:50:26,059 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:26,059 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:26,059 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:26,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:26,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1469506286, now seen corresponding path program 1 times [2019-09-10 08:50:26,059 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:26,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:26,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:26,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:26,060 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:26,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:26,145 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:50:26,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:26,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:50:26,146 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:26,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:50:26,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:50:26,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:50:26,147 INFO L87 Difference]: Start difference. First operand 140915 states and 197269 transitions. Second operand 3 states. [2019-09-10 08:50:26,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:26,558 INFO L93 Difference]: Finished difference Result 140925 states and 197078 transitions. [2019-09-10 08:50:26,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:50:26,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 189 [2019-09-10 08:50:26,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:26,743 INFO L225 Difference]: With dead ends: 140925 [2019-09-10 08:50:26,743 INFO L226 Difference]: Without dead ends: 140925 [2019-09-10 08:50:26,744 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:50:26,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140925 states. [2019-09-10 08:50:28,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140925 to 140915. [2019-09-10 08:50:28,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140915 states. [2019-09-10 08:50:28,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140915 states to 140915 states and 197069 transitions. [2019-09-10 08:50:28,774 INFO L78 Accepts]: Start accepts. Automaton has 140915 states and 197069 transitions. Word has length 189 [2019-09-10 08:50:28,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:28,774 INFO L475 AbstractCegarLoop]: Abstraction has 140915 states and 197069 transitions. [2019-09-10 08:50:28,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:50:28,775 INFO L276 IsEmpty]: Start isEmpty. Operand 140915 states and 197069 transitions. [2019-09-10 08:50:28,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-10 08:50:28,793 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:28,793 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:28,794 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:28,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:28,795 INFO L82 PathProgramCache]: Analyzing trace with hash 736259530, now seen corresponding path program 1 times [2019-09-10 08:50:28,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:28,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:28,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:28,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:28,796 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:28,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:28,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:50:28,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:28,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:50:28,948 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:28,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:50:28,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:50:28,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:50:28,949 INFO L87 Difference]: Start difference. First operand 140915 states and 197069 transitions. Second operand 8 states. [2019-09-10 08:50:30,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:30,313 INFO L93 Difference]: Finished difference Result 336434 states and 469456 transitions. [2019-09-10 08:50:30,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 08:50:30,314 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 189 [2019-09-10 08:50:30,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:30,792 INFO L225 Difference]: With dead ends: 336434 [2019-09-10 08:50:30,792 INFO L226 Difference]: Without dead ends: 336434 [2019-09-10 08:50:30,792 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:50:31,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336434 states. [2019-09-10 08:50:34,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336434 to 189854. [2019-09-10 08:50:34,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189854 states. [2019-09-10 08:50:35,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189854 states to 189854 states and 264048 transitions. [2019-09-10 08:50:35,166 INFO L78 Accepts]: Start accepts. Automaton has 189854 states and 264048 transitions. Word has length 189 [2019-09-10 08:50:35,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:35,166 INFO L475 AbstractCegarLoop]: Abstraction has 189854 states and 264048 transitions. [2019-09-10 08:50:35,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:50:35,167 INFO L276 IsEmpty]: Start isEmpty. Operand 189854 states and 264048 transitions. [2019-09-10 08:50:35,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-10 08:50:35,188 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:35,188 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:35,188 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:35,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:35,189 INFO L82 PathProgramCache]: Analyzing trace with hash -278067996, now seen corresponding path program 1 times [2019-09-10 08:50:35,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:35,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:35,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:35,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:35,190 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:35,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:36,658 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:50:36,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:36,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 08:50:36,659 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:36,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 08:50:36,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 08:50:36,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:50:36,660 INFO L87 Difference]: Start difference. First operand 189854 states and 264048 transitions. Second operand 22 states. [2019-09-10 08:50:37,117 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2019-09-10 08:50:37,399 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-09-10 08:50:37,630 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2019-09-10 08:50:38,015 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 78 [2019-09-10 08:50:38,335 WARN L188 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 82 [2019-09-10 08:50:38,646 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2019-09-10 08:50:38,939 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2019-09-10 08:50:39,253 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 82 [2019-09-10 08:50:39,506 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2019-09-10 08:50:39,767 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 79 [2019-09-10 08:50:40,187 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-09-10 08:50:40,808 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2019-09-10 08:50:41,390 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-09-10 08:50:41,621 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2019-09-10 08:50:41,814 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-09-10 08:50:42,053 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 73 [2019-09-10 08:50:43,413 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 73 [2019-09-10 08:50:43,598 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-09-10 08:50:44,237 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 88 [2019-09-10 08:50:44,681 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2019-09-10 08:50:44,895 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2019-09-10 08:50:46,083 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 88 [2019-09-10 08:50:46,417 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2019-09-10 08:50:46,772 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2019-09-10 08:50:48,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:48,609 INFO L93 Difference]: Finished difference Result 207724 states and 288094 transitions. [2019-09-10 08:50:48,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-10 08:50:48,610 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 190 [2019-09-10 08:50:48,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:48,890 INFO L225 Difference]: With dead ends: 207724 [2019-09-10 08:50:48,890 INFO L226 Difference]: Without dead ends: 207724 [2019-09-10 08:50:48,891 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=590, Invalid=2062, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 08:50:49,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207724 states. [2019-09-10 08:50:51,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207724 to 190372. [2019-09-10 08:50:51,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190372 states. [2019-09-10 08:50:51,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190372 states to 190372 states and 264616 transitions. [2019-09-10 08:50:51,335 INFO L78 Accepts]: Start accepts. Automaton has 190372 states and 264616 transitions. Word has length 190 [2019-09-10 08:50:51,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:51,336 INFO L475 AbstractCegarLoop]: Abstraction has 190372 states and 264616 transitions. [2019-09-10 08:50:51,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 08:50:51,336 INFO L276 IsEmpty]: Start isEmpty. Operand 190372 states and 264616 transitions. [2019-09-10 08:50:51,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-10 08:50:51,357 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:51,357 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:51,357 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:51,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:51,358 INFO L82 PathProgramCache]: Analyzing trace with hash 344302917, now seen corresponding path program 1 times [2019-09-10 08:50:51,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:51,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:51,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:51,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:51,359 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:51,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:51,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:50:51,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:51,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 08:50:51,975 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:51,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 08:50:51,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 08:50:51,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-09-10 08:50:51,976 INFO L87 Difference]: Start difference. First operand 190372 states and 264616 transitions. Second operand 18 states. [2019-09-10 08:50:52,103 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2019-09-10 08:50:52,727 WARN L188 SmtUtils]: Spent 556.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2019-09-10 08:50:53,352 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 38 [2019-09-10 08:50:57,635 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-09-10 08:50:57,812 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-09-10 08:50:58,353 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-09-10 08:50:59,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:59,911 INFO L93 Difference]: Finished difference Result 217821 states and 301403 transitions. [2019-09-10 08:50:59,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-10 08:50:59,912 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 190 [2019-09-10 08:50:59,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:51:00,193 INFO L225 Difference]: With dead ends: 217821 [2019-09-10 08:51:00,193 INFO L226 Difference]: Without dead ends: 217821 [2019-09-10 08:51:00,194 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 941 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=624, Invalid=3408, Unknown=0, NotChecked=0, Total=4032 [2019-09-10 08:51:00,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217821 states. [2019-09-10 08:51:02,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217821 to 191584. [2019-09-10 08:51:02,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191584 states. [2019-09-10 08:51:03,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191584 states to 191584 states and 265911 transitions. [2019-09-10 08:51:03,924 INFO L78 Accepts]: Start accepts. Automaton has 191584 states and 265911 transitions. Word has length 190 [2019-09-10 08:51:03,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:51:03,925 INFO L475 AbstractCegarLoop]: Abstraction has 191584 states and 265911 transitions. [2019-09-10 08:51:03,925 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 08:51:03,925 INFO L276 IsEmpty]: Start isEmpty. Operand 191584 states and 265911 transitions. [2019-09-10 08:51:03,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-10 08:51:03,951 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:51:03,951 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:03,951 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:51:03,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:51:03,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1458010479, now seen corresponding path program 1 times [2019-09-10 08:51:03,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:51:03,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:03,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:51:03,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:03,952 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:51:03,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:51:04,354 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:51:04,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:51:04,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 08:51:04,355 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:51:04,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 08:51:04,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 08:51:04,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:51:04,356 INFO L87 Difference]: Start difference. First operand 191584 states and 265911 transitions. Second operand 19 states. [2019-09-10 08:51:08,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:51:08,154 INFO L93 Difference]: Finished difference Result 221472 states and 306248 transitions. [2019-09-10 08:51:08,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 08:51:08,154 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 190 [2019-09-10 08:51:08,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:51:08,462 INFO L225 Difference]: With dead ends: 221472 [2019-09-10 08:51:08,462 INFO L226 Difference]: Without dead ends: 221472 [2019-09-10 08:51:08,463 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=304, Invalid=1102, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 08:51:08,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221472 states. [2019-09-10 08:51:12,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221472 to 191200. [2019-09-10 08:51:12,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191200 states. [2019-09-10 08:51:13,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191200 states to 191200 states and 265494 transitions. [2019-09-10 08:51:13,180 INFO L78 Accepts]: Start accepts. Automaton has 191200 states and 265494 transitions. Word has length 190 [2019-09-10 08:51:13,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:51:13,180 INFO L475 AbstractCegarLoop]: Abstraction has 191200 states and 265494 transitions. [2019-09-10 08:51:13,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 08:51:13,181 INFO L276 IsEmpty]: Start isEmpty. Operand 191200 states and 265494 transitions. [2019-09-10 08:51:13,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-10 08:51:13,201 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:51:13,201 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:13,201 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:51:13,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:51:13,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1098611397, now seen corresponding path program 1 times [2019-09-10 08:51:13,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:51:13,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:13,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:51:13,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:13,203 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:51:13,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:51:15,626 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:51:15,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:51:15,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-10 08:51:15,627 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:51:15,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 08:51:15,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 08:51:15,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2019-09-10 08:51:15,628 INFO L87 Difference]: Start difference. First operand 191200 states and 265494 transitions. Second operand 26 states. [2019-09-10 08:51:17,540 WARN L188 SmtUtils]: Spent 1.59 s on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-09-10 08:51:17,683 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-09-10 08:51:17,997 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-09-10 08:51:18,189 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-09-10 08:51:18,560 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2019-09-10 08:51:18,871 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-09-10 08:51:19,062 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-09-10 08:51:19,525 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-09-10 08:51:19,828 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-09-10 08:51:20,061 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-10 08:51:20,260 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2019-09-10 08:51:27,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:51:27,399 INFO L93 Difference]: Finished difference Result 192516 states and 266870 transitions. [2019-09-10 08:51:27,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 08:51:27,400 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 190 [2019-09-10 08:51:27,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:51:27,646 INFO L225 Difference]: With dead ends: 192516 [2019-09-10 08:51:27,646 INFO L226 Difference]: Without dead ends: 192516 [2019-09-10 08:51:27,646 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=298, Invalid=1508, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 08:51:27,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192516 states. [2019-09-10 08:51:29,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192516 to 191524. [2019-09-10 08:51:29,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191524 states. [2019-09-10 08:51:29,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191524 states to 191524 states and 265836 transitions. [2019-09-10 08:51:29,438 INFO L78 Accepts]: Start accepts. Automaton has 191524 states and 265836 transitions. Word has length 190 [2019-09-10 08:51:29,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:51:29,439 INFO L475 AbstractCegarLoop]: Abstraction has 191524 states and 265836 transitions. [2019-09-10 08:51:29,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 08:51:29,439 INFO L276 IsEmpty]: Start isEmpty. Operand 191524 states and 265836 transitions. [2019-09-10 08:51:29,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-10 08:51:29,462 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:51:29,462 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:29,462 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:51:29,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:51:29,463 INFO L82 PathProgramCache]: Analyzing trace with hash 795806768, now seen corresponding path program 1 times [2019-09-10 08:51:29,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:51:29,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:29,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:51:29,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:29,464 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:51:29,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:51:29,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:51:29,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:51:29,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:51:29,975 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:51:29,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:51:29,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:51:29,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:51:29,976 INFO L87 Difference]: Start difference. First operand 191524 states and 265836 transitions. Second operand 17 states. [2019-09-10 08:51:35,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:51:35,641 INFO L93 Difference]: Finished difference Result 241518 states and 333049 transitions. [2019-09-10 08:51:35,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-10 08:51:35,641 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 190 [2019-09-10 08:51:35,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:51:35,955 INFO L225 Difference]: With dead ends: 241518 [2019-09-10 08:51:35,956 INFO L226 Difference]: Without dead ends: 241518 [2019-09-10 08:51:35,956 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=484, Invalid=1408, Unknown=0, NotChecked=0, Total=1892 [2019-09-10 08:51:36,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241518 states. [2019-09-10 08:51:38,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241518 to 192470. [2019-09-10 08:51:38,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192470 states. [2019-09-10 08:51:39,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192470 states to 192470 states and 266828 transitions. [2019-09-10 08:51:39,171 INFO L78 Accepts]: Start accepts. Automaton has 192470 states and 266828 transitions. Word has length 190 [2019-09-10 08:51:39,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:51:39,171 INFO L475 AbstractCegarLoop]: Abstraction has 192470 states and 266828 transitions. [2019-09-10 08:51:39,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:51:39,171 INFO L276 IsEmpty]: Start isEmpty. Operand 192470 states and 266828 transitions. [2019-09-10 08:51:39,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-10 08:51:39,192 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:51:39,192 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:39,193 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:51:39,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:51:39,193 INFO L82 PathProgramCache]: Analyzing trace with hash -591204176, now seen corresponding path program 1 times [2019-09-10 08:51:39,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:51:39,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:39,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:51:39,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:39,194 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:51:39,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:51:41,043 WARN L188 SmtUtils]: Spent 950.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 42 [2019-09-10 08:51:42,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:51:42,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:51:42,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2019-09-10 08:51:42,182 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:51:42,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-10 08:51:42,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-10 08:51:42,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=635, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:51:42,183 INFO L87 Difference]: Start difference. First operand 192470 states and 266828 transitions. Second operand 27 states. [2019-09-10 08:51:43,110 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-09-10 08:51:43,481 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 67 [2019-09-10 08:51:43,787 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 72 [2019-09-10 08:51:44,390 WARN L188 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 84 [2019-09-10 08:51:44,851 WARN L188 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 90 [2019-09-10 08:51:45,050 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2019-09-10 08:51:45,303 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2019-09-10 08:51:45,558 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-09-10 08:51:45,868 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-09-10 08:51:46,119 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2019-09-10 08:51:47,714 WARN L188 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 66 [2019-09-10 08:51:48,376 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 60 [2019-09-10 08:51:48,552 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 31 [2019-09-10 08:51:48,735 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 34 [2019-09-10 08:51:49,178 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 64 [2019-09-10 08:51:49,540 WARN L188 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 67 [2019-09-10 08:51:49,755 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 34 [2019-09-10 08:51:51,502 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 33 [2019-09-10 08:51:52,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:51:52,738 INFO L93 Difference]: Finished difference Result 193500 states and 267962 transitions. [2019-09-10 08:51:52,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-10 08:51:52,739 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 190 [2019-09-10 08:51:52,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:51:53,599 INFO L225 Difference]: With dead ends: 193500 [2019-09-10 08:51:53,599 INFO L226 Difference]: Without dead ends: 193500 [2019-09-10 08:51:53,599 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=556, Invalid=2524, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 08:51:53,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193500 states. [2019-09-10 08:51:55,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193500 to 191985. [2019-09-10 08:51:55,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191985 states. [2019-09-10 08:51:55,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191985 states to 191985 states and 266312 transitions. [2019-09-10 08:51:55,890 INFO L78 Accepts]: Start accepts. Automaton has 191985 states and 266312 transitions. Word has length 190 [2019-09-10 08:51:55,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:51:55,890 INFO L475 AbstractCegarLoop]: Abstraction has 191985 states and 266312 transitions. [2019-09-10 08:51:55,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-10 08:51:55,890 INFO L276 IsEmpty]: Start isEmpty. Operand 191985 states and 266312 transitions. [2019-09-10 08:51:55,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-10 08:51:55,910 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:51:55,910 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:55,911 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:51:55,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:51:55,911 INFO L82 PathProgramCache]: Analyzing trace with hash 541571951, now seen corresponding path program 1 times [2019-09-10 08:51:55,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:51:55,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:55,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:51:55,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:55,912 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:51:55,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:51:56,547 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 37 [2019-09-10 08:51:56,817 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 35 [2019-09-10 08:51:57,069 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 38 [2019-09-10 08:51:57,954 WARN L188 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 28 [2019-09-10 08:51:59,008 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:51:59,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:51:59,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-10 08:51:59,009 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:51:59,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 08:51:59,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 08:51:59,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2019-09-10 08:51:59,010 INFO L87 Difference]: Start difference. First operand 191985 states and 266312 transitions. Second operand 26 states. [2019-09-10 08:51:59,797 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-09-10 08:52:00,125 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-09-10 08:52:00,348 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-10 08:52:00,834 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2019-09-10 08:52:01,131 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2019-09-10 08:52:01,337 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-10 08:52:02,014 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-10 08:52:02,209 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-09-10 08:52:02,533 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-09-10 08:52:02,764 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 08:52:02,951 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-09-10 08:52:05,597 WARN L188 SmtUtils]: Spent 1.90 s on a formula simplification. DAG size of input: 48 DAG size of output: 32 [2019-09-10 08:52:08,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:08,104 INFO L93 Difference]: Finished difference Result 193607 states and 268004 transitions. [2019-09-10 08:52:08,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 08:52:08,105 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 190 [2019-09-10 08:52:08,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:08,369 INFO L225 Difference]: With dead ends: 193607 [2019-09-10 08:52:08,369 INFO L226 Difference]: Without dead ends: 193607 [2019-09-10 08:52:08,370 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=350, Invalid=1630, Unknown=0, NotChecked=0, Total=1980 [2019-09-10 08:52:08,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193607 states. [2019-09-10 08:52:10,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193607 to 192381. [2019-09-10 08:52:10,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192381 states. [2019-09-10 08:52:11,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192381 states to 192381 states and 266726 transitions. [2019-09-10 08:52:11,165 INFO L78 Accepts]: Start accepts. Automaton has 192381 states and 266726 transitions. Word has length 190 [2019-09-10 08:52:11,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:52:11,166 INFO L475 AbstractCegarLoop]: Abstraction has 192381 states and 266726 transitions. [2019-09-10 08:52:11,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 08:52:11,166 INFO L276 IsEmpty]: Start isEmpty. Operand 192381 states and 266726 transitions. [2019-09-10 08:52:11,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-10 08:52:11,188 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:52:11,188 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11,188 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:52:11,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:11,189 INFO L82 PathProgramCache]: Analyzing trace with hash 2004829187, now seen corresponding path program 1 times [2019-09-10 08:52:11,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:52:11,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:11,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:11,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:11,190 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:52:11,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:11,654 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:11,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:52:11,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:52:11,655 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:52:11,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:52:11,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:52:11,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:52:11,655 INFO L87 Difference]: Start difference. First operand 192381 states and 266726 transitions. Second operand 17 states. [2019-09-10 08:52:15,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:15,985 INFO L93 Difference]: Finished difference Result 214318 states and 295129 transitions. [2019-09-10 08:52:15,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 08:52:15,986 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 190 [2019-09-10 08:52:15,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:16,288 INFO L225 Difference]: With dead ends: 214318 [2019-09-10 08:52:16,288 INFO L226 Difference]: Without dead ends: 214318 [2019-09-10 08:52:16,288 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=326, Invalid=1006, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 08:52:16,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214318 states. [2019-09-10 08:52:18,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214318 to 193240. [2019-09-10 08:52:18,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193240 states. [2019-09-10 08:52:23,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193240 states to 193240 states and 267632 transitions. [2019-09-10 08:52:23,293 INFO L78 Accepts]: Start accepts. Automaton has 193240 states and 267632 transitions. Word has length 190 [2019-09-10 08:52:23,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:52:23,293 INFO L475 AbstractCegarLoop]: Abstraction has 193240 states and 267632 transitions. [2019-09-10 08:52:23,293 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:52:23,293 INFO L276 IsEmpty]: Start isEmpty. Operand 193240 states and 267632 transitions. [2019-09-10 08:52:23,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-10 08:52:23,317 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:52:23,317 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,318 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:52:23,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:23,318 INFO L82 PathProgramCache]: Analyzing trace with hash -4770076, now seen corresponding path program 1 times [2019-09-10 08:52:23,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:52:23,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:23,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:23,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:23,319 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:52:23,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:24,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:24,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:52:24,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 08:52:24,866 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:52:24,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 08:52:24,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 08:52:24,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=414, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:52:24,867 INFO L87 Difference]: Start difference. First operand 193240 states and 267632 transitions. Second operand 22 states. [2019-09-10 08:52:25,632 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-09-10 08:52:25,975 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-09-10 08:52:26,230 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2019-09-10 08:52:26,588 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-09-10 08:52:27,284 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-09-10 08:52:27,546 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2019-09-10 08:52:27,728 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-09-10 08:52:28,114 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 46 [2019-09-10 08:52:28,644 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 48 [2019-09-10 08:52:29,220 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 53 [2019-09-10 08:52:29,466 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 56 [2019-09-10 08:52:29,720 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 56 [2019-09-10 08:52:29,986 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 55 [2019-09-10 08:52:30,283 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 58 [2019-09-10 08:52:30,551 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 58 [2019-09-10 08:52:31,351 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 55 [2019-09-10 08:52:31,829 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 57 [2019-09-10 08:52:33,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:33,446 INFO L93 Difference]: Finished difference Result 194509 states and 268964 transitions. [2019-09-10 08:52:33,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 08:52:33,447 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 190 [2019-09-10 08:52:33,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:34,104 INFO L225 Difference]: With dead ends: 194509 [2019-09-10 08:52:34,104 INFO L226 Difference]: Without dead ends: 194509 [2019-09-10 08:52:34,106 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=476, Invalid=1416, Unknown=0, NotChecked=0, Total=1892 [2019-09-10 08:52:34,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194509 states. [2019-09-10 08:52:35,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194509 to 192607. [2019-09-10 08:52:35,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192607 states. [2019-09-10 08:52:36,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192607 states to 192607 states and 266952 transitions. [2019-09-10 08:52:36,208 INFO L78 Accepts]: Start accepts. Automaton has 192607 states and 266952 transitions. Word has length 190 [2019-09-10 08:52:36,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:52:36,208 INFO L475 AbstractCegarLoop]: Abstraction has 192607 states and 266952 transitions. [2019-09-10 08:52:36,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 08:52:36,209 INFO L276 IsEmpty]: Start isEmpty. Operand 192607 states and 266952 transitions. [2019-09-10 08:52:36,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-10 08:52:36,231 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:52:36,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36,232 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:52:36,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:36,232 INFO L82 PathProgramCache]: Analyzing trace with hash 283163368, now seen corresponding path program 1 times [2019-09-10 08:52:36,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:52:36,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:36,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:36,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:36,233 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:52:36,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:36,285 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:36,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:52:36,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:52:36,286 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:52:36,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:52:36,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:52:36,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:52:36,286 INFO L87 Difference]: Start difference. First operand 192607 states and 266952 transitions. Second operand 3 states. [2019-09-10 08:52:36,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:36,920 INFO L93 Difference]: Finished difference Result 238407 states and 321473 transitions. [2019-09-10 08:52:36,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:52:36,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2019-09-10 08:52:36,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:38,178 INFO L225 Difference]: With dead ends: 238407 [2019-09-10 08:52:38,179 INFO L226 Difference]: Without dead ends: 238407 [2019-09-10 08:52:38,179 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:38,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238407 states. [2019-09-10 08:52:43,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238407 to 200385. [2019-09-10 08:52:43,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200385 states. [2019-09-10 08:52:43,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200385 states to 200385 states and 269640 transitions. [2019-09-10 08:52:43,518 INFO L78 Accepts]: Start accepts. Automaton has 200385 states and 269640 transitions. Word has length 192 [2019-09-10 08:52:43,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:52:43,518 INFO L475 AbstractCegarLoop]: Abstraction has 200385 states and 269640 transitions. [2019-09-10 08:52:43,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:52:43,518 INFO L276 IsEmpty]: Start isEmpty. Operand 200385 states and 269640 transitions. [2019-09-10 08:52:43,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-10 08:52:43,538 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:52:43,538 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43,538 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:52:43,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:43,539 INFO L82 PathProgramCache]: Analyzing trace with hash 859851014, now seen corresponding path program 1 times [2019-09-10 08:52:43,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:52:43,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:43,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:43,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:43,540 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:52:43,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:43,598 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:43,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:52:43,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:52:43,599 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:52:43,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:52:43,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:52:43,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:52:43,599 INFO L87 Difference]: Start difference. First operand 200385 states and 269640 transitions. Second operand 4 states. [2019-09-10 08:52:44,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:44,165 INFO L93 Difference]: Finished difference Result 286180 states and 390870 transitions. [2019-09-10 08:52:44,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:52:44,166 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2019-09-10 08:52:44,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:45,418 INFO L225 Difference]: With dead ends: 286180 [2019-09-10 08:52:45,418 INFO L226 Difference]: Without dead ends: 286180 [2019-09-10 08:52:45,419 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:52:45,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286180 states. [2019-09-10 08:52:47,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286180 to 192517. [2019-09-10 08:52:47,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192517 states. [2019-09-10 08:52:48,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192517 states to 192517 states and 261101 transitions. [2019-09-10 08:52:48,207 INFO L78 Accepts]: Start accepts. Automaton has 192517 states and 261101 transitions. Word has length 192 [2019-09-10 08:52:48,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:52:48,207 INFO L475 AbstractCegarLoop]: Abstraction has 192517 states and 261101 transitions. [2019-09-10 08:52:48,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:52:48,207 INFO L276 IsEmpty]: Start isEmpty. Operand 192517 states and 261101 transitions. [2019-09-10 08:52:48,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-10 08:52:48,222 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:52:48,222 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48,222 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:52:48,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:48,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1991677319, now seen corresponding path program 1 times [2019-09-10 08:52:48,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:52:48,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:48,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:48,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:48,224 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:52:48,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:48,877 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:48,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:52:48,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-09-10 08:52:48,877 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:52:48,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 08:52:48,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 08:52:48,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=457, Unknown=0, NotChecked=0, Total=506 [2019-09-10 08:52:48,878 INFO L87 Difference]: Start difference. First operand 192517 states and 261101 transitions. Second operand 23 states. [2019-09-10 08:52:49,528 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2019-09-10 08:52:50,329 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 08:52:59,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:59,080 INFO L93 Difference]: Finished difference Result 381263 states and 518509 transitions. [2019-09-10 08:52:59,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-10 08:52:59,081 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 192 [2019-09-10 08:52:59,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:59,587 INFO L225 Difference]: With dead ends: 381263 [2019-09-10 08:52:59,587 INFO L226 Difference]: Without dead ends: 381191 [2019-09-10 08:52:59,587 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=452, Invalid=1804, Unknown=0, NotChecked=0, Total=2256 [2019-09-10 08:52:59,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381191 states. [2019-09-10 08:53:02,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381191 to 193542. [2019-09-10 08:53:02,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193542 states. [2019-09-10 08:53:02,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193542 states to 193542 states and 262170 transitions. [2019-09-10 08:53:02,461 INFO L78 Accepts]: Start accepts. Automaton has 193542 states and 262170 transitions. Word has length 192 [2019-09-10 08:53:02,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:53:02,461 INFO L475 AbstractCegarLoop]: Abstraction has 193542 states and 262170 transitions. [2019-09-10 08:53:02,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 08:53:02,461 INFO L276 IsEmpty]: Start isEmpty. Operand 193542 states and 262170 transitions. [2019-09-10 08:53:02,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-10 08:53:02,478 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:53:02,478 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02,479 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:53:02,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:53:02,479 INFO L82 PathProgramCache]: Analyzing trace with hash -730421484, now seen corresponding path program 1 times [2019-09-10 08:53:02,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:53:02,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:02,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:53:02,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:02,480 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:53:02,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:53:03,115 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:03,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:53:03,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:53:03,116 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:53:03,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:53:03,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:53:03,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:53:03,117 INFO L87 Difference]: Start difference. First operand 193542 states and 262170 transitions. Second operand 4 states. [2019-09-10 08:53:03,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:53:03,746 INFO L93 Difference]: Finished difference Result 269471 states and 368336 transitions. [2019-09-10 08:53:03,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:53:03,746 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2019-09-10 08:53:03,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:53:04,139 INFO L225 Difference]: With dead ends: 269471 [2019-09-10 08:53:04,140 INFO L226 Difference]: Without dead ends: 269471 [2019-09-10 08:53:04,140 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:53:04,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269471 states. [2019-09-10 08:53:06,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269471 to 190641. [2019-09-10 08:53:06,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190641 states. [2019-09-10 08:53:06,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190641 states to 190641 states and 258921 transitions. [2019-09-10 08:53:06,933 INFO L78 Accepts]: Start accepts. Automaton has 190641 states and 258921 transitions. Word has length 192 [2019-09-10 08:53:06,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:53:06,933 INFO L475 AbstractCegarLoop]: Abstraction has 190641 states and 258921 transitions. [2019-09-10 08:53:06,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:53:06,933 INFO L276 IsEmpty]: Start isEmpty. Operand 190641 states and 258921 transitions. [2019-09-10 08:53:06,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-10 08:53:06,946 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:53:06,946 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06,947 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:53:06,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:53:06,947 INFO L82 PathProgramCache]: Analyzing trace with hash 705805637, now seen corresponding path program 1 times [2019-09-10 08:53:06,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:53:06,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:06,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:53:06,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:06,948 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:53:06,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:53:07,390 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,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:53:07,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 08:53:07,391 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:53:07,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:53:07,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:53:07,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:53:07,392 INFO L87 Difference]: Start difference. First operand 190641 states and 258921 transitions. Second operand 21 states. [2019-09-10 08:53:13,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:53:13,244 INFO L93 Difference]: Finished difference Result 377860 states and 517281 transitions. [2019-09-10 08:53:13,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 08:53:13,245 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 192 [2019-09-10 08:53:13,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:53:13,764 INFO L225 Difference]: With dead ends: 377860 [2019-09-10 08:53:13,764 INFO L226 Difference]: Without dead ends: 377239 [2019-09-10 08:53:13,764 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=407, Invalid=1485, Unknown=0, NotChecked=0, Total=1892 [2019-09-10 08:53:14,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377239 states. [2019-09-10 08:53:21,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377239 to 191687. [2019-09-10 08:53:21,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191687 states. [2019-09-10 08:53:22,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191687 states to 191687 states and 260019 transitions. [2019-09-10 08:53:22,140 INFO L78 Accepts]: Start accepts. Automaton has 191687 states and 260019 transitions. Word has length 192 [2019-09-10 08:53:22,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:53:22,140 INFO L475 AbstractCegarLoop]: Abstraction has 191687 states and 260019 transitions. [2019-09-10 08:53:22,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:53:22,141 INFO L276 IsEmpty]: Start isEmpty. Operand 191687 states and 260019 transitions. [2019-09-10 08:53:22,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-10 08:53:22,158 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:53:22,159 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22,159 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:53:22,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:53:22,159 INFO L82 PathProgramCache]: Analyzing trace with hash 127477074, now seen corresponding path program 1 times [2019-09-10 08:53:22,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:53:22,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:22,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:53:22,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:22,161 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:53:22,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:53:22,225 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:22,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:53:22,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:53:22,226 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:53:22,226 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:53:22,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:53:22,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:53:22,227 INFO L87 Difference]: Start difference. First operand 191687 states and 260019 transitions. Second operand 4 states. [2019-09-10 08:53:22,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:53:22,941 INFO L93 Difference]: Finished difference Result 281814 states and 385812 transitions. [2019-09-10 08:53:22,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:53:22,942 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2019-09-10 08:53:22,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:53:23,422 INFO L225 Difference]: With dead ends: 281814 [2019-09-10 08:53:23,422 INFO L226 Difference]: Without dead ends: 281814 [2019-09-10 08:53:23,422 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:53:23,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281814 states. [2019-09-10 08:53:25,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281814 to 188339. [2019-09-10 08:53:25,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188339 states. [2019-09-10 08:53:26,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188339 states to 188339 states and 256370 transitions. [2019-09-10 08:53:26,060 INFO L78 Accepts]: Start accepts. Automaton has 188339 states and 256370 transitions. Word has length 192 [2019-09-10 08:53:26,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:53:26,060 INFO L475 AbstractCegarLoop]: Abstraction has 188339 states and 256370 transitions. [2019-09-10 08:53:26,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:53:26,060 INFO L276 IsEmpty]: Start isEmpty. Operand 188339 states and 256370 transitions. [2019-09-10 08:53:26,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-10 08:53:26,071 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:53:26,071 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,072 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:53:26,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:53:26,072 INFO L82 PathProgramCache]: Analyzing trace with hash -569411140, now seen corresponding path program 1 times [2019-09-10 08:53:26,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:53:26,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:26,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:53:26,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:26,073 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:53:26,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:53:26,531 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:26,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:53:26,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 08:53:26,531 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:53:26,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:53:26,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:53:26,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:53:26,532 INFO L87 Difference]: Start difference. First operand 188339 states and 256370 transitions. Second operand 21 states. [2019-09-10 08:53:32,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:53:32,587 INFO L93 Difference]: Finished difference Result 420254 states and 575550 transitions. [2019-09-10 08:53:32,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 08:53:32,588 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 192 [2019-09-10 08:53:32,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:53:33,140 INFO L225 Difference]: With dead ends: 420254 [2019-09-10 08:53:33,140 INFO L226 Difference]: Without dead ends: 420254 [2019-09-10 08:53:33,141 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=428, Invalid=1552, Unknown=0, NotChecked=0, Total=1980 [2019-09-10 08:53:33,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420254 states. [2019-09-10 08:53:36,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420254 to 189117. [2019-09-10 08:53:36,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189117 states. [2019-09-10 08:53:36,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189117 states to 189117 states and 257176 transitions. [2019-09-10 08:53:36,977 INFO L78 Accepts]: Start accepts. Automaton has 189117 states and 257176 transitions. Word has length 192 [2019-09-10 08:53:36,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:53:36,977 INFO L475 AbstractCegarLoop]: Abstraction has 189117 states and 257176 transitions. [2019-09-10 08:53:36,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:53:36,977 INFO L276 IsEmpty]: Start isEmpty. Operand 189117 states and 257176 transitions. [2019-09-10 08:53:36,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-10 08:53:36,989 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:53:36,989 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36,990 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:53:36,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:53:36,990 INFO L82 PathProgramCache]: Analyzing trace with hash 488547671, now seen corresponding path program 1 times [2019-09-10 08:53:36,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:53:36,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:36,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:53:36,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:36,991 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:53:37,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:53:38,298 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:38,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:53:38,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 08:53:38,299 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:53:38,299 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 08:53:38,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 08:53:38,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=412, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:53:38,299 INFO L87 Difference]: Start difference. First operand 189117 states and 257176 transitions. Second operand 22 states. [2019-09-10 08:53:46,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:53:46,242 INFO L93 Difference]: Finished difference Result 340348 states and 464611 transitions. [2019-09-10 08:53:46,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-10 08:53:46,242 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 192 [2019-09-10 08:53:46,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:53:46,725 INFO L225 Difference]: With dead ends: 340348 [2019-09-10 08:53:46,726 INFO L226 Difference]: Without dead ends: 340170 [2019-09-10 08:53:46,726 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 689 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=732, Invalid=2808, Unknown=0, NotChecked=0, Total=3540 [2019-09-10 08:53:46,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340170 states. [2019-09-10 08:53:52,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340170 to 190056. [2019-09-10 08:53:52,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190056 states. [2019-09-10 08:53:53,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190056 states to 190056 states and 258154 transitions. [2019-09-10 08:53:53,400 INFO L78 Accepts]: Start accepts. Automaton has 190056 states and 258154 transitions. Word has length 192 [2019-09-10 08:53:53,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:53:53,400 INFO L475 AbstractCegarLoop]: Abstraction has 190056 states and 258154 transitions. [2019-09-10 08:53:53,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 08:53:53,401 INFO L276 IsEmpty]: Start isEmpty. Operand 190056 states and 258154 transitions. [2019-09-10 08:53:53,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-10 08:53:53,412 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:53:53,412 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53,412 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:53:53,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:53:53,413 INFO L82 PathProgramCache]: Analyzing trace with hash -308738294, now seen corresponding path program 1 times [2019-09-10 08:53:53,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:53:53,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:53,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:53:53,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:53,414 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:53:53,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:53:53,915 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:53,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:53:53,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 08:53:53,916 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:53:53,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:53:53,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:53:53,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:53:53,916 INFO L87 Difference]: Start difference. First operand 190056 states and 258154 transitions. Second operand 21 states. [2019-09-10 08:54:00,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:00,232 INFO L93 Difference]: Finished difference Result 434623 states and 592748 transitions. [2019-09-10 08:54:00,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 08:54:00,232 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 192 [2019-09-10 08:54:00,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:00,937 INFO L225 Difference]: With dead ends: 434623 [2019-09-10 08:54:00,937 INFO L226 Difference]: Without dead ends: 434623 [2019-09-10 08:54:00,937 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=405, Invalid=1487, Unknown=0, NotChecked=0, Total=1892 [2019-09-10 08:54:02,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434623 states. [2019-09-10 08:54:05,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434623 to 191610. [2019-09-10 08:54:05,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191610 states. [2019-09-10 08:54:05,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191610 states to 191610 states and 259795 transitions. [2019-09-10 08:54:05,804 INFO L78 Accepts]: Start accepts. Automaton has 191610 states and 259795 transitions. Word has length 192 [2019-09-10 08:54:05,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:05,805 INFO L475 AbstractCegarLoop]: Abstraction has 191610 states and 259795 transitions. [2019-09-10 08:54:05,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:54:05,805 INFO L276 IsEmpty]: Start isEmpty. Operand 191610 states and 259795 transitions. [2019-09-10 08:54:05,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-10 08:54:05,818 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:05,818 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05,818 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:05,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:05,818 INFO L82 PathProgramCache]: Analyzing trace with hash 2027796610, now seen corresponding path program 1 times [2019-09-10 08:54:05,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:05,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:05,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:05,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:05,820 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:05,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:06,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:54:06,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:06,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 08:54:06,321 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:06,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:54:06,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:54:06,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=376, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:54:06,322 INFO L87 Difference]: Start difference. First operand 191610 states and 259795 transitions. Second operand 21 states. [2019-09-10 08:54:06,470 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 08:54:13,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:13,372 INFO L93 Difference]: Finished difference Result 378066 states and 513304 transitions. [2019-09-10 08:54:13,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 08:54:13,372 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 192 [2019-09-10 08:54:13,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:13,999 INFO L225 Difference]: With dead ends: 378066 [2019-09-10 08:54:13,999 INFO L226 Difference]: Without dead ends: 377749 [2019-09-10 08:54:14,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=393, Invalid=1413, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 08:54:14,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377749 states. [2019-09-10 08:54:20,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377749 to 192593. [2019-09-10 08:54:20,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192593 states. [2019-09-10 08:54:20,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192593 states to 192593 states and 260764 transitions. [2019-09-10 08:54:20,947 INFO L78 Accepts]: Start accepts. Automaton has 192593 states and 260764 transitions. Word has length 192 [2019-09-10 08:54:20,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:20,947 INFO L475 AbstractCegarLoop]: Abstraction has 192593 states and 260764 transitions. [2019-09-10 08:54:20,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:54:20,947 INFO L276 IsEmpty]: Start isEmpty. Operand 192593 states and 260764 transitions. [2019-09-10 08:54:20,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-10 08:54:20,961 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:20,962 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20,962 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:20,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:20,962 INFO L82 PathProgramCache]: Analyzing trace with hash -561685586, now seen corresponding path program 1 times [2019-09-10 08:54:20,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:20,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:20,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:20,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:20,963 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:20,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:21,095 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:54:21,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:21,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:54:21,095 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:21,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:54:21,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:54:21,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:54:21,096 INFO L87 Difference]: Start difference. First operand 192593 states and 260764 transitions. Second operand 5 states. [2019-09-10 08:54:21,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:21,633 INFO L93 Difference]: Finished difference Result 234345 states and 315978 transitions. [2019-09-10 08:54:21,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:54:21,634 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 193 [2019-09-10 08:54:21,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:21,929 INFO L225 Difference]: With dead ends: 234345 [2019-09-10 08:54:21,929 INFO L226 Difference]: Without dead ends: 234345 [2019-09-10 08:54:21,929 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:54:22,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234345 states. [2019-09-10 08:54:24,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234345 to 233989. [2019-09-10 08:54:24,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233989 states. [2019-09-10 08:54:24,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233989 states to 233989 states and 315623 transitions. [2019-09-10 08:54:24,865 INFO L78 Accepts]: Start accepts. Automaton has 233989 states and 315623 transitions. Word has length 193 [2019-09-10 08:54:24,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:24,865 INFO L475 AbstractCegarLoop]: Abstraction has 233989 states and 315623 transitions. [2019-09-10 08:54:24,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:54:24,866 INFO L276 IsEmpty]: Start isEmpty. Operand 233989 states and 315623 transitions. [2019-09-10 08:54:24,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-10 08:54:24,879 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:24,879 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24,880 INFO L418 AbstractCegarLoop]: === Iteration 83 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:24,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:24,880 INFO L82 PathProgramCache]: Analyzing trace with hash -563532628, now seen corresponding path program 1 times [2019-09-10 08:54:24,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:24,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:24,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:24,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:24,881 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:24,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:24,971 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:54:24,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:24,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:54:24,971 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:24,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:54:24,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:54:24,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:54:24,972 INFO L87 Difference]: Start difference. First operand 233989 states and 315623 transitions. Second operand 6 states. [2019-09-10 08:54:26,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:26,894 INFO L93 Difference]: Finished difference Result 282610 states and 383051 transitions. [2019-09-10 08:54:26,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:54:26,895 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 193 [2019-09-10 08:54:26,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:27,260 INFO L225 Difference]: With dead ends: 282610 [2019-09-10 08:54:27,261 INFO L226 Difference]: Without dead ends: 282610 [2019-09-10 08:54:27,261 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:54:27,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282610 states. [2019-09-10 08:54:30,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282610 to 234025. [2019-09-10 08:54:30,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234025 states. [2019-09-10 08:54:30,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234025 states to 234025 states and 315659 transitions. [2019-09-10 08:54:30,580 INFO L78 Accepts]: Start accepts. Automaton has 234025 states and 315659 transitions. Word has length 193 [2019-09-10 08:54:30,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:30,580 INFO L475 AbstractCegarLoop]: Abstraction has 234025 states and 315659 transitions. [2019-09-10 08:54:30,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:54:30,580 INFO L276 IsEmpty]: Start isEmpty. Operand 234025 states and 315659 transitions. [2019-09-10 08:54:30,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-10 08:54:30,599 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:30,599 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30,599 INFO L418 AbstractCegarLoop]: === Iteration 84 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:30,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:30,600 INFO L82 PathProgramCache]: Analyzing trace with hash -112295544, now seen corresponding path program 1 times [2019-09-10 08:54:30,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:30,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:30,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:30,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:30,601 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:30,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:30,688 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:54:30,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:30,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:54:30,689 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:30,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:54:30,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:54:30,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:54:30,690 INFO L87 Difference]: Start difference. First operand 234025 states and 315659 transitions. Second operand 6 states. [2019-09-10 08:54:31,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:31,495 INFO L93 Difference]: Finished difference Result 325591 states and 443044 transitions. [2019-09-10 08:54:31,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:54:31,496 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 193 [2019-09-10 08:54:31,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:32,002 INFO L225 Difference]: With dead ends: 325591 [2019-09-10 08:54:32,002 INFO L226 Difference]: Without dead ends: 325591 [2019-09-10 08:54:32,002 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:54:32,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325591 states. [2019-09-10 08:54:40,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325591 to 234079. [2019-09-10 08:54:40,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234079 states. [2019-09-10 08:54:40,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234079 states to 234079 states and 315713 transitions. [2019-09-10 08:54:40,666 INFO L78 Accepts]: Start accepts. Automaton has 234079 states and 315713 transitions. Word has length 193 [2019-09-10 08:54:40,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:40,666 INFO L475 AbstractCegarLoop]: Abstraction has 234079 states and 315713 transitions. [2019-09-10 08:54:40,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:54:40,666 INFO L276 IsEmpty]: Start isEmpty. Operand 234079 states and 315713 transitions. [2019-09-10 08:54:40,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-10 08:54:40,679 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:40,680 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40,680 INFO L418 AbstractCegarLoop]: === Iteration 85 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:40,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:40,680 INFO L82 PathProgramCache]: Analyzing trace with hash -110448502, now seen corresponding path program 1 times [2019-09-10 08:54:40,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:40,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:40,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:40,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:40,681 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:40,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:40,803 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:54:40,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:40,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:54:40,803 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:40,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:54:40,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:54:40,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:54:40,804 INFO L87 Difference]: Start difference. First operand 234079 states and 315713 transitions. Second operand 5 states. [2019-09-10 08:54:41,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:41,478 INFO L93 Difference]: Finished difference Result 275477 states and 370573 transitions. [2019-09-10 08:54:41,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:54:41,479 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 193 [2019-09-10 08:54:41,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:41,933 INFO L225 Difference]: With dead ends: 275477 [2019-09-10 08:54:41,933 INFO L226 Difference]: Without dead ends: 275477 [2019-09-10 08:54:41,933 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:54:42,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275477 states. [2019-09-10 08:54:45,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275477 to 275139. [2019-09-10 08:54:45,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275139 states. [2019-09-10 08:54:46,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275139 states to 275139 states and 370236 transitions. [2019-09-10 08:54:46,406 INFO L78 Accepts]: Start accepts. Automaton has 275139 states and 370236 transitions. Word has length 193 [2019-09-10 08:54:46,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:46,406 INFO L475 AbstractCegarLoop]: Abstraction has 275139 states and 370236 transitions. [2019-09-10 08:54:46,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:54:46,406 INFO L276 IsEmpty]: Start isEmpty. Operand 275139 states and 370236 transitions. [2019-09-10 08:54:46,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-10 08:54:46,422 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:46,422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46,423 INFO L418 AbstractCegarLoop]: === Iteration 86 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:46,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:46,423 INFO L82 PathProgramCache]: Analyzing trace with hash 299129740, now seen corresponding path program 1 times [2019-09-10 08:54:46,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:46,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:46,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:46,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:46,424 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:46,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:46,525 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:54:46,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:46,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:54:46,526 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:46,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:54:46,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:54:46,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:54:46,528 INFO L87 Difference]: Start difference. First operand 275139 states and 370236 transitions. Second operand 6 states. [2019-09-10 08:54:47,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:47,451 INFO L93 Difference]: Finished difference Result 366705 states and 497621 transitions. [2019-09-10 08:54:47,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:54:47,452 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 193 [2019-09-10 08:54:47,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:49,314 INFO L225 Difference]: With dead ends: 366705 [2019-09-10 08:54:49,314 INFO L226 Difference]: Without dead ends: 366705 [2019-09-10 08:54:49,314 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:54:49,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366705 states. [2019-09-10 08:54:56,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366705 to 275193. [2019-09-10 08:54:56,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275193 states.