java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.4.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:55:41,059 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:55:41,061 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:55:41,073 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:55:41,074 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:55:41,075 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:55:41,076 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:55:41,078 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:55:41,092 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:55:41,093 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:55:41,094 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:55:41,095 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:55:41,095 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:55:41,096 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:55:41,097 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:55:41,098 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:55:41,099 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:55:41,099 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:55:41,101 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:55:41,103 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:55:41,104 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:55:41,105 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:55:41,106 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:55:41,107 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:55:41,109 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:55:41,109 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:55:41,109 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:55:41,110 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:55:41,110 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:55:41,111 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:55:41,112 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:55:41,112 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:55:41,113 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:55:41,114 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:55:41,115 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:55:41,115 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:55:41,116 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:55:41,116 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:55:41,116 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:55:41,117 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:55:41,117 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:55:41,118 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:55:41,143 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:55:41,143 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:55:41,144 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:55:41,145 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:55:41,146 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:55:41,146 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:55:41,146 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:55:41,147 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:55:41,147 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:55:41,147 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:55:41,148 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:55:41,148 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:55:41,148 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:55:41,148 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:55:41,148 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:55:41,149 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:55:41,149 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:55:41,149 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:55:41,150 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:55:41,150 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:55:41,151 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:55:41,151 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:55:41,151 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:55:41,151 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:55:41,151 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:55:41,152 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:55:41,152 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:55:41,152 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:55:41,152 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:55:41,152 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:55:41,192 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:55:41,209 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:55:41,216 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:55:41,218 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:55:41,219 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:55:41,220 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.4.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-10 08:55:41,297 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35c39f5a6/3b726bf705334e5fa8c2bd82e00521b2/FLAGe784d7c9b [2019-09-10 08:55:41,910 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:55:41,911 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.4.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-10 08:55:41,924 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35c39f5a6/3b726bf705334e5fa8c2bd82e00521b2/FLAGe784d7c9b [2019-09-10 08:55:42,118 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35c39f5a6/3b726bf705334e5fa8c2bd82e00521b2 [2019-09-10 08:55:42,127 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:55:42,128 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:55:42,129 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:55:42,130 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:55:42,133 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:55:42,134 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:55:42" (1/1) ... [2019-09-10 08:55:42,137 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7594377c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:55:42, skipping insertion in model container [2019-09-10 08:55:42,138 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:55:42" (1/1) ... [2019-09-10 08:55:42,145 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:55:42,219 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:55:42,740 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:55:42,759 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:55:42,909 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:55:42,930 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:55:42,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:55:42 WrapperNode [2019-09-10 08:55:42,931 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:55:42,931 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:55:42,932 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:55:42,932 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:55:42,942 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:55:42" (1/1) ... [2019-09-10 08:55:42,943 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:55:42" (1/1) ... [2019-09-10 08:55:42,961 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:55:42" (1/1) ... [2019-09-10 08:55:42,961 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:55:42" (1/1) ... [2019-09-10 08:55:42,990 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:55:42" (1/1) ... [2019-09-10 08:55:43,018 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:55:42" (1/1) ... [2019-09-10 08:55:43,022 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:55:42" (1/1) ... [2019-09-10 08:55:43,032 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:55:43,033 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:55:43,034 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:55:43,034 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:55:43,035 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:55:42" (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:55:43,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:55:43,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:55:43,130 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:55:43,130 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:55:43,131 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:55:43,131 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:55:43,131 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:55:43,131 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:55:43,131 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:55:43,132 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:55:43,132 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:55:43,133 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:55:43,133 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:55:43,135 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 08:55:43,135 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:55:43,136 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:55:43,136 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:55:43,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:55:43,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:55:44,811 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:55:44,811 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:55:44,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:55:44 BoogieIcfgContainer [2019-09-10 08:55:44,813 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:55:44,814 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:55:44,814 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:55:44,817 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:55:44,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:55:42" (1/3) ... [2019-09-10 08:55:44,819 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5786b165 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:55:44, skipping insertion in model container [2019-09-10 08:55:44,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:55:42" (2/3) ... [2019-09-10 08:55:44,819 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5786b165 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:55:44, skipping insertion in model container [2019-09-10 08:55:44,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:55:44" (3/3) ... [2019-09-10 08:55:44,821 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.4.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-10 08:55:44,832 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:55:44,841 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 08:55:44,859 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 08:55:44,888 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:55:44,888 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:55:44,888 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:55:44,888 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:55:44,889 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:55:44,889 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:55:44,889 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:55:44,889 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:55:44,914 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states. [2019-09-10 08:55:44,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:55:44,937 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:44,938 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:55:44,941 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:44,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:44,947 INFO L82 PathProgramCache]: Analyzing trace with hash -35123060, now seen corresponding path program 1 times [2019-09-10 08:55:44,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:45,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:45,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:45,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:45,006 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:45,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:45,607 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:55:45,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:55:45,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:55:45,611 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:55:45,619 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:55:45,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:55:45,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:55:45,641 INFO L87 Difference]: Start difference. First operand 347 states. Second operand 3 states. [2019-09-10 08:55:45,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:55:45,814 INFO L93 Difference]: Finished difference Result 485 states and 839 transitions. [2019-09-10 08:55:45,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:55:45,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-09-10 08:55:45,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:55:45,849 INFO L225 Difference]: With dead ends: 485 [2019-09-10 08:55:45,849 INFO L226 Difference]: Without dead ends: 477 [2019-09-10 08:55:45,852 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:55:45,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-09-10 08:55:45,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 475. [2019-09-10 08:55:45,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 475 states. [2019-09-10 08:55:45,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 783 transitions. [2019-09-10 08:55:45,948 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 783 transitions. Word has length 122 [2019-09-10 08:55:45,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:55:45,949 INFO L475 AbstractCegarLoop]: Abstraction has 475 states and 783 transitions. [2019-09-10 08:55:45,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:55:45,949 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 783 transitions. [2019-09-10 08:55:45,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-10 08:55:45,955 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:45,956 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:55:45,956 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:45,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:45,957 INFO L82 PathProgramCache]: Analyzing trace with hash 993718675, now seen corresponding path program 1 times [2019-09-10 08:55:45,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:45,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:45,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:45,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:45,960 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:46,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:46,202 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:55:46,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:55:46,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:55:46,202 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:55:46,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:55:46,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:55:46,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:55:46,205 INFO L87 Difference]: Start difference. First operand 475 states and 783 transitions. Second operand 3 states. [2019-09-10 08:55:46,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:55:46,243 INFO L93 Difference]: Finished difference Result 733 states and 1211 transitions. [2019-09-10 08:55:46,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:55:46,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-09-10 08:55:46,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:55:46,251 INFO L225 Difference]: With dead ends: 733 [2019-09-10 08:55:46,252 INFO L226 Difference]: Without dead ends: 733 [2019-09-10 08:55:46,253 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:55:46,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2019-09-10 08:55:46,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 731. [2019-09-10 08:55:46,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2019-09-10 08:55:46,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1210 transitions. [2019-09-10 08:55:46,305 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1210 transitions. Word has length 125 [2019-09-10 08:55:46,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:55:46,307 INFO L475 AbstractCegarLoop]: Abstraction has 731 states and 1210 transitions. [2019-09-10 08:55:46,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:55:46,307 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1210 transitions. [2019-09-10 08:55:46,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 08:55:46,318 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:46,319 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:55:46,319 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:46,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:46,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1625513079, now seen corresponding path program 1 times [2019-09-10 08:55:46,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:46,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:46,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:46,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:46,322 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:46,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:46,445 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:55:46,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:55:46,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:55:46,446 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:55:46,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:55:46,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:55:46,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:55:46,447 INFO L87 Difference]: Start difference. First operand 731 states and 1210 transitions. Second operand 3 states. [2019-09-10 08:55:46,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:55:46,482 INFO L93 Difference]: Finished difference Result 1225 states and 2027 transitions. [2019-09-10 08:55:46,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:55:46,482 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2019-09-10 08:55:46,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:55:46,490 INFO L225 Difference]: With dead ends: 1225 [2019-09-10 08:55:46,490 INFO L226 Difference]: Without dead ends: 1225 [2019-09-10 08:55:46,490 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:55:46,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2019-09-10 08:55:46,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1223. [2019-09-10 08:55:46,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1223 states. [2019-09-10 08:55:46,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 2026 transitions. [2019-09-10 08:55:46,529 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 2026 transitions. Word has length 128 [2019-09-10 08:55:46,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:55:46,530 INFO L475 AbstractCegarLoop]: Abstraction has 1223 states and 2026 transitions. [2019-09-10 08:55:46,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:55:46,531 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 2026 transitions. [2019-09-10 08:55:46,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-10 08:55:46,535 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:46,535 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:55:46,536 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:46,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:46,536 INFO L82 PathProgramCache]: Analyzing trace with hash 649173988, now seen corresponding path program 1 times [2019-09-10 08:55:46,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:46,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:46,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:46,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:46,539 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:46,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:46,730 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:55:46,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:55:46,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:55:46,731 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:55:46,731 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:55:46,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:55:46,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:55:46,732 INFO L87 Difference]: Start difference. First operand 1223 states and 2026 transitions. Second operand 3 states. [2019-09-10 08:55:46,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:55:46,785 INFO L93 Difference]: Finished difference Result 2169 states and 3583 transitions. [2019-09-10 08:55:46,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:55:46,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2019-09-10 08:55:46,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:55:46,798 INFO L225 Difference]: With dead ends: 2169 [2019-09-10 08:55:46,799 INFO L226 Difference]: Without dead ends: 2169 [2019-09-10 08:55:46,799 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:55:46,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2169 states. [2019-09-10 08:55:46,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2169 to 2167. [2019-09-10 08:55:46,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2167 states. [2019-09-10 08:55:46,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2167 states to 2167 states and 3582 transitions. [2019-09-10 08:55:46,858 INFO L78 Accepts]: Start accepts. Automaton has 2167 states and 3582 transitions. Word has length 131 [2019-09-10 08:55:46,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:55:46,859 INFO L475 AbstractCegarLoop]: Abstraction has 2167 states and 3582 transitions. [2019-09-10 08:55:46,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:55:46,859 INFO L276 IsEmpty]: Start isEmpty. Operand 2167 states and 3582 transitions. [2019-09-10 08:55:46,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 08:55:46,862 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:46,863 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:55:46,863 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:46,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:46,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1855611538, now seen corresponding path program 1 times [2019-09-10 08:55:46,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:46,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:46,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:46,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:46,865 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:46,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:47,150 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:55:47,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:55:47,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:55:47,151 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:55:47,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:55:47,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:55:47,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:55:47,153 INFO L87 Difference]: Start difference. First operand 2167 states and 3582 transitions. Second operand 6 states. [2019-09-10 08:55:47,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:55:47,502 INFO L93 Difference]: Finished difference Result 6263 states and 10406 transitions. [2019-09-10 08:55:47,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:55:47,503 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 134 [2019-09-10 08:55:47,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:55:47,534 INFO L225 Difference]: With dead ends: 6263 [2019-09-10 08:55:47,534 INFO L226 Difference]: Without dead ends: 6263 [2019-09-10 08:55:47,535 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:55:47,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6263 states. [2019-09-10 08:55:47,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6263 to 4929. [2019-09-10 08:55:47,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4929 states. [2019-09-10 08:55:47,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4929 states to 4929 states and 8167 transitions. [2019-09-10 08:55:47,666 INFO L78 Accepts]: Start accepts. Automaton has 4929 states and 8167 transitions. Word has length 134 [2019-09-10 08:55:47,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:55:47,667 INFO L475 AbstractCegarLoop]: Abstraction has 4929 states and 8167 transitions. [2019-09-10 08:55:47,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:55:47,667 INFO L276 IsEmpty]: Start isEmpty. Operand 4929 states and 8167 transitions. [2019-09-10 08:55:47,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 08:55:47,671 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:47,671 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:55:47,672 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:47,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:47,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1755551114, now seen corresponding path program 1 times [2019-09-10 08:55:47,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:47,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:47,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:47,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:47,674 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:47,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:47,832 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:55:47,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:55:47,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:55:47,833 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:55:47,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:55:47,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:55:47,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:55:47,834 INFO L87 Difference]: Start difference. First operand 4929 states and 8167 transitions. Second operand 4 states. [2019-09-10 08:55:47,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:55:47,980 INFO L93 Difference]: Finished difference Result 8327 states and 13848 transitions. [2019-09-10 08:55:47,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:55:47,980 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-09-10 08:55:47,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:55:48,020 INFO L225 Difference]: With dead ends: 8327 [2019-09-10 08:55:48,021 INFO L226 Difference]: Without dead ends: 8327 [2019-09-10 08:55:48,021 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:55:48,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8327 states. [2019-09-10 08:55:48,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8327 to 7273. [2019-09-10 08:55:48,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7273 states. [2019-09-10 08:55:48,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7273 states to 7273 states and 12070 transitions. [2019-09-10 08:55:48,295 INFO L78 Accepts]: Start accepts. Automaton has 7273 states and 12070 transitions. Word has length 135 [2019-09-10 08:55:48,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:55:48,297 INFO L475 AbstractCegarLoop]: Abstraction has 7273 states and 12070 transitions. [2019-09-10 08:55:48,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:55:48,298 INFO L276 IsEmpty]: Start isEmpty. Operand 7273 states and 12070 transitions. [2019-09-10 08:55:48,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 08:55:48,306 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:48,306 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:55:48,307 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:48,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:48,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1365624242, now seen corresponding path program 1 times [2019-09-10 08:55:48,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:48,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:48,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:48,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:48,312 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:48,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:48,414 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:55:48,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:55:48,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:55:48,415 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:55:48,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:55:48,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:55:48,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:55:48,416 INFO L87 Difference]: Start difference. First operand 7273 states and 12070 transitions. Second operand 3 states. [2019-09-10 08:55:48,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:55:48,486 INFO L93 Difference]: Finished difference Result 11099 states and 18426 transitions. [2019-09-10 08:55:48,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:55:48,486 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-09-10 08:55:48,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:55:48,526 INFO L225 Difference]: With dead ends: 11099 [2019-09-10 08:55:48,527 INFO L226 Difference]: Without dead ends: 11099 [2019-09-10 08:55:48,527 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:55:48,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11099 states. [2019-09-10 08:55:48,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11099 to 11097. [2019-09-10 08:55:48,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11097 states. [2019-09-10 08:55:48,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11097 states to 11097 states and 18425 transitions. [2019-09-10 08:55:48,775 INFO L78 Accepts]: Start accepts. Automaton has 11097 states and 18425 transitions. Word has length 136 [2019-09-10 08:55:48,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:55:48,775 INFO L475 AbstractCegarLoop]: Abstraction has 11097 states and 18425 transitions. [2019-09-10 08:55:48,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:55:48,776 INFO L276 IsEmpty]: Start isEmpty. Operand 11097 states and 18425 transitions. [2019-09-10 08:55:48,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 08:55:48,778 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:48,779 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:55:48,779 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:48,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:48,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1188137794, now seen corresponding path program 1 times [2019-09-10 08:55:48,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:48,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:48,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:48,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:48,781 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:48,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:49,033 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:55:49,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:55:49,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:55:49,034 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:55:49,035 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:55:49,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:55:49,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:55:49,035 INFO L87 Difference]: Start difference. First operand 11097 states and 18425 transitions. Second operand 3 states. [2019-09-10 08:55:49,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:55:49,129 INFO L93 Difference]: Finished difference Result 15670 states and 25957 transitions. [2019-09-10 08:55:49,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:55:49,129 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-09-10 08:55:49,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:55:49,166 INFO L225 Difference]: With dead ends: 15670 [2019-09-10 08:55:49,166 INFO L226 Difference]: Without dead ends: 15670 [2019-09-10 08:55:49,166 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:55:49,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15670 states. [2019-09-10 08:55:49,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15670 to 15668. [2019-09-10 08:55:49,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15668 states. [2019-09-10 08:55:49,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15668 states to 15668 states and 25956 transitions. [2019-09-10 08:55:49,431 INFO L78 Accepts]: Start accepts. Automaton has 15668 states and 25956 transitions. Word has length 136 [2019-09-10 08:55:49,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:55:49,431 INFO L475 AbstractCegarLoop]: Abstraction has 15668 states and 25956 transitions. [2019-09-10 08:55:49,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:55:49,431 INFO L276 IsEmpty]: Start isEmpty. Operand 15668 states and 25956 transitions. [2019-09-10 08:55:49,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 08:55:49,434 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:49,434 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:55:49,434 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:49,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:49,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1350880053, now seen corresponding path program 1 times [2019-09-10 08:55:49,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:49,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:49,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:49,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:49,437 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:49,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:49,594 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:55:49,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:55:49,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:55:49,595 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:55:49,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:55:49,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:55:49,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:55:49,596 INFO L87 Difference]: Start difference. First operand 15668 states and 25956 transitions. Second operand 4 states. [2019-09-10 08:55:49,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:55:49,823 INFO L93 Difference]: Finished difference Result 26712 states and 44251 transitions. [2019-09-10 08:55:49,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:55:49,824 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-09-10 08:55:49,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:55:50,425 INFO L225 Difference]: With dead ends: 26712 [2019-09-10 08:55:50,425 INFO L226 Difference]: Without dead ends: 26712 [2019-09-10 08:55:50,426 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:55:50,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26712 states. [2019-09-10 08:55:50,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26712 to 23307. [2019-09-10 08:55:50,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23307 states. [2019-09-10 08:55:50,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23307 states to 23307 states and 38542 transitions. [2019-09-10 08:55:50,803 INFO L78 Accepts]: Start accepts. Automaton has 23307 states and 38542 transitions. Word has length 136 [2019-09-10 08:55:50,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:55:50,804 INFO L475 AbstractCegarLoop]: Abstraction has 23307 states and 38542 transitions. [2019-09-10 08:55:50,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:55:50,804 INFO L276 IsEmpty]: Start isEmpty. Operand 23307 states and 38542 transitions. [2019-09-10 08:55:50,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 08:55:50,806 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:50,807 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:55:50,807 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:50,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:50,808 INFO L82 PathProgramCache]: Analyzing trace with hash -788578752, now seen corresponding path program 1 times [2019-09-10 08:55:50,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:50,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:50,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:50,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:50,811 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:50,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:50,924 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:55:50,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:55:50,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:55:50,925 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:55:50,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:55:50,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:55:50,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:55:50,930 INFO L87 Difference]: Start difference. First operand 23307 states and 38542 transitions. Second operand 3 states. [2019-09-10 08:55:51,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:55:51,214 INFO L93 Difference]: Finished difference Result 33980 states and 56028 transitions. [2019-09-10 08:55:51,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:55:51,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-09-10 08:55:51,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:55:51,296 INFO L225 Difference]: With dead ends: 33980 [2019-09-10 08:55:51,296 INFO L226 Difference]: Without dead ends: 33980 [2019-09-10 08:55:51,297 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:55:51,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33980 states. [2019-09-10 08:55:51,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33980 to 33978. [2019-09-10 08:55:51,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33978 states. [2019-09-10 08:55:51,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33978 states to 33978 states and 56027 transitions. [2019-09-10 08:55:51,751 INFO L78 Accepts]: Start accepts. Automaton has 33978 states and 56027 transitions. Word has length 136 [2019-09-10 08:55:51,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:55:51,752 INFO L475 AbstractCegarLoop]: Abstraction has 33978 states and 56027 transitions. [2019-09-10 08:55:51,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:55:51,752 INFO L276 IsEmpty]: Start isEmpty. Operand 33978 states and 56027 transitions. [2019-09-10 08:55:51,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 08:55:51,754 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:51,755 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:55:51,755 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:51,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:51,755 INFO L82 PathProgramCache]: Analyzing trace with hash -783429068, now seen corresponding path program 1 times [2019-09-10 08:55:51,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:51,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:51,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:51,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:51,757 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:51,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:51,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:55:51,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:55:51,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:55:51,867 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:55:51,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:55:51,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:55:51,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:55:51,868 INFO L87 Difference]: Start difference. First operand 33978 states and 56027 transitions. Second operand 3 states. [2019-09-10 08:55:52,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:55:52,277 INFO L93 Difference]: Finished difference Result 50517 states and 82988 transitions. [2019-09-10 08:55:52,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:55:52,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-09-10 08:55:52,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:55:52,412 INFO L225 Difference]: With dead ends: 50517 [2019-09-10 08:55:52,412 INFO L226 Difference]: Without dead ends: 50517 [2019-09-10 08:55:52,413 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:55:52,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50517 states. [2019-09-10 08:55:54,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50517 to 50515. [2019-09-10 08:55:54,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50515 states. [2019-09-10 08:55:54,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50515 states to 50515 states and 82987 transitions. [2019-09-10 08:55:54,328 INFO L78 Accepts]: Start accepts. Automaton has 50515 states and 82987 transitions. Word has length 136 [2019-09-10 08:55:54,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:55:54,329 INFO L475 AbstractCegarLoop]: Abstraction has 50515 states and 82987 transitions. [2019-09-10 08:55:54,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:55:54,329 INFO L276 IsEmpty]: Start isEmpty. Operand 50515 states and 82987 transitions. [2019-09-10 08:55:54,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 08:55:54,331 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:54,331 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:55:54,331 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:54,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:54,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1129443555, now seen corresponding path program 1 times [2019-09-10 08:55:54,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:54,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:54,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:54,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:54,334 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:54,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:54,498 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:55:54,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:55:54,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:55:54,499 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:55:54,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:55:54,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:55:54,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:55:54,501 INFO L87 Difference]: Start difference. First operand 50515 states and 82987 transitions. Second operand 7 states. [2019-09-10 08:55:55,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:55:55,797 INFO L93 Difference]: Finished difference Result 185545 states and 303013 transitions. [2019-09-10 08:55:55,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:55:55,798 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 137 [2019-09-10 08:55:55,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:55:56,150 INFO L225 Difference]: With dead ends: 185545 [2019-09-10 08:55:56,150 INFO L226 Difference]: Without dead ends: 185545 [2019-09-10 08:55:56,151 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-09-10 08:55:56,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185545 states. [2019-09-10 08:55:59,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185545 to 140538. [2019-09-10 08:55:59,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140538 states. [2019-09-10 08:56:00,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140538 states to 140538 states and 228866 transitions. [2019-09-10 08:56:00,637 INFO L78 Accepts]: Start accepts. Automaton has 140538 states and 228866 transitions. Word has length 137 [2019-09-10 08:56:00,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:56:00,637 INFO L475 AbstractCegarLoop]: Abstraction has 140538 states and 228866 transitions. [2019-09-10 08:56:00,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:56:00,637 INFO L276 IsEmpty]: Start isEmpty. Operand 140538 states and 228866 transitions. [2019-09-10 08:56:00,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 08:56:00,639 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:56:00,639 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:56:00,640 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:56:00,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:56:00,640 INFO L82 PathProgramCache]: Analyzing trace with hash -705506052, now seen corresponding path program 1 times [2019-09-10 08:56:00,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:56:00,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:00,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:56:00,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:00,642 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:56:00,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:56:00,758 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:56:00,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:56:00,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:56:00,759 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:56:00,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:56:00,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:56:00,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:56:00,760 INFO L87 Difference]: Start difference. First operand 140538 states and 228866 transitions. Second operand 4 states. [2019-09-10 08:56:01,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:56:01,639 INFO L93 Difference]: Finished difference Result 274270 states and 446077 transitions. [2019-09-10 08:56:01,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:56:01,640 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-09-10 08:56:01,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:56:02,141 INFO L225 Difference]: With dead ends: 274270 [2019-09-10 08:56:02,141 INFO L226 Difference]: Without dead ends: 274270 [2019-09-10 08:56:02,142 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:56:02,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274270 states. [2019-09-10 08:56:08,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274270 to 206995. [2019-09-10 08:56:08,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206995 states. [2019-09-10 08:56:08,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206995 states to 206995 states and 336271 transitions. [2019-09-10 08:56:08,364 INFO L78 Accepts]: Start accepts. Automaton has 206995 states and 336271 transitions. Word has length 138 [2019-09-10 08:56:08,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:56:08,364 INFO L475 AbstractCegarLoop]: Abstraction has 206995 states and 336271 transitions. [2019-09-10 08:56:08,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:56:08,365 INFO L276 IsEmpty]: Start isEmpty. Operand 206995 states and 336271 transitions. [2019-09-10 08:56:08,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-10 08:56:08,366 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:56:08,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] [2019-09-10 08:56:08,367 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:56:08,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:56:08,367 INFO L82 PathProgramCache]: Analyzing trace with hash -876112340, now seen corresponding path program 1 times [2019-09-10 08:56:08,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:56:08,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:08,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:56:08,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:08,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:56:08,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:56:08,686 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:56:08,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:56:08,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:56:08,687 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:56:08,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:56:08,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:56:08,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:56:08,688 INFO L87 Difference]: Start difference. First operand 206995 states and 336271 transitions. Second operand 6 states. [2019-09-10 08:56:13,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:56:13,566 INFO L93 Difference]: Finished difference Result 298865 states and 485662 transitions. [2019-09-10 08:56:13,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:56:13,567 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 140 [2019-09-10 08:56:13,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:56:14,124 INFO L225 Difference]: With dead ends: 298865 [2019-09-10 08:56:14,124 INFO L226 Difference]: Without dead ends: 298865 [2019-09-10 08:56:14,124 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:56:14,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298865 states. [2019-09-10 08:56:16,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298865 to 236155. [2019-09-10 08:56:16,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236155 states. [2019-09-10 08:56:17,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236155 states to 236155 states and 382876 transitions. [2019-09-10 08:56:17,178 INFO L78 Accepts]: Start accepts. Automaton has 236155 states and 382876 transitions. Word has length 140 [2019-09-10 08:56:17,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:56:17,178 INFO L475 AbstractCegarLoop]: Abstraction has 236155 states and 382876 transitions. [2019-09-10 08:56:17,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:56:17,178 INFO L276 IsEmpty]: Start isEmpty. Operand 236155 states and 382876 transitions. [2019-09-10 08:56:17,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-10 08:56:17,180 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:56:17,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] [2019-09-10 08:56:17,180 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:56:17,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:56:17,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1795769074, now seen corresponding path program 1 times [2019-09-10 08:56:17,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:56:17,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:17,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:56:17,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:17,183 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:56:17,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:56:17,448 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:56:17,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:56:17,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:56:17,449 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:56:17,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:56:17,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:56:17,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:56:17,450 INFO L87 Difference]: Start difference. First operand 236155 states and 382876 transitions. Second operand 6 states. [2019-09-10 08:56:23,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:56:23,149 INFO L93 Difference]: Finished difference Result 436607 states and 708162 transitions. [2019-09-10 08:56:23,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:56:23,149 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-09-10 08:56:23,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:56:23,835 INFO L225 Difference]: With dead ends: 436607 [2019-09-10 08:56:23,835 INFO L226 Difference]: Without dead ends: 436607 [2019-09-10 08:56:23,836 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:56:24,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436607 states. [2019-09-10 08:56:34,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436607 to 420187. [2019-09-10 08:56:34,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420187 states. [2019-09-10 08:56:35,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420187 states to 420187 states and 680963 transitions. [2019-09-10 08:56:35,076 INFO L78 Accepts]: Start accepts. Automaton has 420187 states and 680963 transitions. Word has length 143 [2019-09-10 08:56:35,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:56:35,076 INFO L475 AbstractCegarLoop]: Abstraction has 420187 states and 680963 transitions. [2019-09-10 08:56:35,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:56:35,077 INFO L276 IsEmpty]: Start isEmpty. Operand 420187 states and 680963 transitions. [2019-09-10 08:56:35,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 08:56:35,078 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:56:35,078 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:56:35,078 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:56:35,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:56:35,079 INFO L82 PathProgramCache]: Analyzing trace with hash 163824457, now seen corresponding path program 1 times [2019-09-10 08:56:35,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:56:35,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:35,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:56:35,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:35,081 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:56:35,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:56:35,253 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:56:35,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:56:35,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:56:35,255 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:56:35,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:56:35,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:56:35,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:56:35,256 INFO L87 Difference]: Start difference. First operand 420187 states and 680963 transitions. Second operand 5 states. [2019-09-10 08:56:39,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:56:39,112 INFO L93 Difference]: Finished difference Result 704201 states and 1133907 transitions. [2019-09-10 08:56:39,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:56:39,113 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2019-09-10 08:56:39,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:56:40,342 INFO L225 Difference]: With dead ends: 704201 [2019-09-10 08:56:40,343 INFO L226 Difference]: Without dead ends: 704201 [2019-09-10 08:56:40,343 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:56:40,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704201 states. [2019-09-10 08:56:54,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704201 to 426099. [2019-09-10 08:56:54,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426099 states. [2019-09-10 08:56:56,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426099 states to 426099 states and 686830 transitions. [2019-09-10 08:56:56,198 INFO L78 Accepts]: Start accepts. Automaton has 426099 states and 686830 transitions. Word has length 144 [2019-09-10 08:56:56,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:56:56,198 INFO L475 AbstractCegarLoop]: Abstraction has 426099 states and 686830 transitions. [2019-09-10 08:56:56,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:56:56,198 INFO L276 IsEmpty]: Start isEmpty. Operand 426099 states and 686830 transitions. [2019-09-10 08:56:56,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-10 08:56:56,206 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:56:56,207 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:56:56,207 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:56:56,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:56:56,208 INFO L82 PathProgramCache]: Analyzing trace with hash 537249617, now seen corresponding path program 1 times [2019-09-10 08:56:56,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:56:56,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:56,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:56:56,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:56,209 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:56:56,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:56:56,363 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:56:56,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:56:56,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:56:56,364 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:56:56,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:56:56,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:56:56,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:56:56,365 INFO L87 Difference]: Start difference. First operand 426099 states and 686830 transitions. Second operand 3 states. [2019-09-10 08:56:57,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:56:57,513 INFO L93 Difference]: Finished difference Result 358126 states and 575876 transitions. [2019-09-10 08:56:57,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:56:57,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2019-09-10 08:56:57,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:56:58,029 INFO L225 Difference]: With dead ends: 358126 [2019-09-10 08:56:58,030 INFO L226 Difference]: Without dead ends: 358126 [2019-09-10 08:56:58,030 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:56:58,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358126 states. [2019-09-10 08:57:08,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358126 to 357295. [2019-09-10 08:57:08,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357295 states. [2019-09-10 08:57:09,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357295 states to 357295 states and 574614 transitions. [2019-09-10 08:57:09,735 INFO L78 Accepts]: Start accepts. Automaton has 357295 states and 574614 transitions. Word has length 178 [2019-09-10 08:57:09,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:57:09,735 INFO L475 AbstractCegarLoop]: Abstraction has 357295 states and 574614 transitions. [2019-09-10 08:57:09,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:57:09,736 INFO L276 IsEmpty]: Start isEmpty. Operand 357295 states and 574614 transitions. [2019-09-10 08:57:09,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-10 08:57:09,741 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:57:09,741 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:57:09,741 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:57:09,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:57:09,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1114295107, now seen corresponding path program 1 times [2019-09-10 08:57:09,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:57:09,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:09,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:57:09,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:09,744 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:57:09,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:57:10,047 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-10 08:57:10,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:57:10,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:57:10,048 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:57:10,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:57:10,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:57:10,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:57:10,049 INFO L87 Difference]: Start difference. First operand 357295 states and 574614 transitions. Second operand 4 states. [2019-09-10 08:57:18,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:57:18,342 INFO L93 Difference]: Finished difference Result 672275 states and 1077871 transitions. [2019-09-10 08:57:18,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:57:18,343 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2019-09-10 08:57:18,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:57:19,301 INFO L225 Difference]: With dead ends: 672275 [2019-09-10 08:57:19,301 INFO L226 Difference]: Without dead ends: 672275 [2019-09-10 08:57:19,302 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:57:19,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672275 states. [2019-09-10 08:57:28,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672275 to 578438. [2019-09-10 08:57:28,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578438 states. [2019-09-10 08:57:29,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578438 states to 578438 states and 929380 transitions. [2019-09-10 08:57:29,486 INFO L78 Accepts]: Start accepts. Automaton has 578438 states and 929380 transitions. Word has length 178 [2019-09-10 08:57:29,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:57:29,486 INFO L475 AbstractCegarLoop]: Abstraction has 578438 states and 929380 transitions. [2019-09-10 08:57:29,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:57:29,486 INFO L276 IsEmpty]: Start isEmpty. Operand 578438 states and 929380 transitions. [2019-09-10 08:57:29,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-10 08:57:29,489 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:57:29,489 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:57:29,489 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:57:29,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:57:29,490 INFO L82 PathProgramCache]: Analyzing trace with hash 549360595, now seen corresponding path program 1 times [2019-09-10 08:57:29,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:57:29,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:29,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:57:29,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:29,491 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:57:29,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:57:29,634 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:57:29,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:57:29,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:57:29,635 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:57:29,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:57:29,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:57:29,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:57:29,637 INFO L87 Difference]: Start difference. First operand 578438 states and 929380 transitions. Second operand 3 states. [2019-09-10 08:57:32,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:57:32,102 INFO L93 Difference]: Finished difference Result 231924 states and 371647 transitions. [2019-09-10 08:57:32,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:57:32,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 179 [2019-09-10 08:57:32,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:57:32,424 INFO L225 Difference]: With dead ends: 231924 [2019-09-10 08:57:32,424 INFO L226 Difference]: Without dead ends: 231924 [2019-09-10 08:57:32,425 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:57:32,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231924 states. [2019-09-10 08:57:35,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231924 to 231922. [2019-09-10 08:57:35,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231922 states. [2019-09-10 08:57:44,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231922 states to 231922 states and 371646 transitions. [2019-09-10 08:57:44,793 INFO L78 Accepts]: Start accepts. Automaton has 231922 states and 371646 transitions. Word has length 179 [2019-09-10 08:57:44,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:57:44,793 INFO L475 AbstractCegarLoop]: Abstraction has 231922 states and 371646 transitions. [2019-09-10 08:57:44,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:57:44,793 INFO L276 IsEmpty]: Start isEmpty. Operand 231922 states and 371646 transitions. [2019-09-10 08:57:44,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-10 08:57:44,795 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:57:44,796 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:57:44,796 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:57:44,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:57:44,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1888394913, now seen corresponding path program 1 times [2019-09-10 08:57:44,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:57:44,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:44,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:57:44,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:44,798 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:57:44,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:57:44,988 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-10 08:57:44,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:57:44,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:57:44,989 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:57:44,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:57:44,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:57:44,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:57:44,990 INFO L87 Difference]: Start difference. First operand 231922 states and 371646 transitions. Second operand 6 states. [2019-09-10 08:57:45,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:57:45,892 INFO L93 Difference]: Finished difference Result 299159 states and 479808 transitions. [2019-09-10 08:57:45,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:57:45,893 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 179 [2019-09-10 08:57:45,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:57:46,320 INFO L225 Difference]: With dead ends: 299159 [2019-09-10 08:57:46,321 INFO L226 Difference]: Without dead ends: 299159 [2019-09-10 08:57:46,321 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:57:46,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299159 states. [2019-09-10 08:57:50,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299159 to 270089. [2019-09-10 08:57:50,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270089 states. [2019-09-10 08:57:51,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270089 states to 270089 states and 432662 transitions. [2019-09-10 08:57:51,091 INFO L78 Accepts]: Start accepts. Automaton has 270089 states and 432662 transitions. Word has length 179 [2019-09-10 08:57:51,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:57:51,092 INFO L475 AbstractCegarLoop]: Abstraction has 270089 states and 432662 transitions. [2019-09-10 08:57:51,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:57:51,092 INFO L276 IsEmpty]: Start isEmpty. Operand 270089 states and 432662 transitions. [2019-09-10 08:57:51,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 08:57:51,095 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:57:51,095 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:51,096 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:57:51,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:57:51,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1810248098, now seen corresponding path program 1 times [2019-09-10 08:57:51,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:57:51,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:51,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:57:51,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:51,098 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:57:51,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:57:51,224 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:57:51,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:57:51,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:57:51,225 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:57:51,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:57:51,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:57:51,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:57:51,228 INFO L87 Difference]: Start difference. First operand 270089 states and 432662 transitions. Second operand 3 states. [2019-09-10 08:57:51,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:57:51,621 INFO L93 Difference]: Finished difference Result 106956 states and 171065 transitions. [2019-09-10 08:57:51,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:57:51,622 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-09-10 08:57:51,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:57:51,818 INFO L225 Difference]: With dead ends: 106956 [2019-09-10 08:57:51,818 INFO L226 Difference]: Without dead ends: 106956 [2019-09-10 08:57:51,819 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:57:51,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106956 states. [2019-09-10 08:57:56,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106956 to 106954. [2019-09-10 08:57:56,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106954 states. [2019-09-10 08:57:56,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106954 states to 106954 states and 171064 transitions. [2019-09-10 08:57:56,601 INFO L78 Accepts]: Start accepts. Automaton has 106954 states and 171064 transitions. Word has length 180 [2019-09-10 08:57:56,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:57:56,601 INFO L475 AbstractCegarLoop]: Abstraction has 106954 states and 171064 transitions. [2019-09-10 08:57:56,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:57:56,601 INFO L276 IsEmpty]: Start isEmpty. Operand 106954 states and 171064 transitions. [2019-09-10 08:57:56,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 08:57:56,603 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:57:56,603 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:56,603 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:57:56,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:57:56,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1340905464, now seen corresponding path program 1 times [2019-09-10 08:57:56,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:57:56,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:56,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:57:56,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:56,606 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:57:56,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:57:56,726 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:57:56,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:57:56,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:57:56,727 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:57:56,727 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:57:56,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:57:56,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:57:56,728 INFO L87 Difference]: Start difference. First operand 106954 states and 171064 transitions. Second operand 3 states. [2019-09-10 08:57:56,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:57:56,857 INFO L93 Difference]: Finished difference Result 42850 states and 68621 transitions. [2019-09-10 08:57:56,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:57:56,857 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-09-10 08:57:56,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:57:56,912 INFO L225 Difference]: With dead ends: 42850 [2019-09-10 08:57:56,912 INFO L226 Difference]: Without dead ends: 42850 [2019-09-10 08:57:56,913 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:57:56,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42850 states. [2019-09-10 08:57:57,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42850 to 42848. [2019-09-10 08:57:57,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42848 states. [2019-09-10 08:57:57,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42848 states to 42848 states and 68620 transitions. [2019-09-10 08:57:57,804 INFO L78 Accepts]: Start accepts. Automaton has 42848 states and 68620 transitions. Word has length 180 [2019-09-10 08:57:57,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:57:57,805 INFO L475 AbstractCegarLoop]: Abstraction has 42848 states and 68620 transitions. [2019-09-10 08:57:57,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:57:57,805 INFO L276 IsEmpty]: Start isEmpty. Operand 42848 states and 68620 transitions. [2019-09-10 08:57:57,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-10 08:57:57,807 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:57:57,807 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:57:57,807 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:57:57,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:57:57,808 INFO L82 PathProgramCache]: Analyzing trace with hash -15485732, now seen corresponding path program 1 times [2019-09-10 08:57:57,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:57:57,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:57,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:57:57,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:57,809 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:57:57,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:57:57,995 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:57:57,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:57:57,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:57:57,996 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:57:57,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:57:57,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:57:57,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:57:57,997 INFO L87 Difference]: Start difference. First operand 42848 states and 68620 transitions. Second operand 6 states. [2019-09-10 08:57:58,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:57:58,343 INFO L93 Difference]: Finished difference Result 60720 states and 97428 transitions. [2019-09-10 08:57:58,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:57:58,344 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 181 [2019-09-10 08:57:58,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:57:58,419 INFO L225 Difference]: With dead ends: 60720 [2019-09-10 08:57:58,419 INFO L226 Difference]: Without dead ends: 60720 [2019-09-10 08:57:58,419 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:57:58,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60720 states. [2019-09-10 08:57:58,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60720 to 48294. [2019-09-10 08:57:58,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48294 states. [2019-09-10 08:57:58,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48294 states to 48294 states and 77353 transitions. [2019-09-10 08:57:58,929 INFO L78 Accepts]: Start accepts. Automaton has 48294 states and 77353 transitions. Word has length 181 [2019-09-10 08:57:58,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:57:58,930 INFO L475 AbstractCegarLoop]: Abstraction has 48294 states and 77353 transitions. [2019-09-10 08:57:58,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:57:58,930 INFO L276 IsEmpty]: Start isEmpty. Operand 48294 states and 77353 transitions. [2019-09-10 08:57:58,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-10 08:57:58,931 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:57:58,931 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:57:58,932 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:57:58,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:57:58,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1589177119, now seen corresponding path program 1 times [2019-09-10 08:57:58,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:57:58,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:58,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:57:58,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:58,933 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:57:58,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:57:59,111 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:57:59,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:57:59,112 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:57:59,113 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 182 with the following transitions: [2019-09-10 08:57:59,116 INFO L207 CegarAbsIntRunner]: [0], [3], [5], [8], [10], [13], [15], [18], [20], [23], [25], [28], [30], [33], [35], [38], [40], [43], [45], [48], [50], [53], [55], [58], [60], [63], [65], [68], [70], [73], [75], [78], [80], [83], [85], [88], [90], [93], [95], [98], [100], [103], [105], [108], [110], [113], [115], [118], [120], [123], [126], [129], [132], [135], [138], [141], [144], [147], [150], [153], [156], [159], [162], [165], [168], [171], [174], [177], [180], [183], [186], [189], [192], [195], [198], [201], [204], [207], [210], [213], [216], [219], [222], [225], [228], [231], [234], [237], [240], [243], [246], [249], [252], [255], [258], [261], [265], [268], [290], [298], [300], [303], [325], [328], [331], [333], [335], [338], [360], [368], [370], [373], [395], [403], [405], [408], [411], [414], [417], [420], [427], [435], [437], [440], [441], [443], [452], [455], [466], [469], [481], [485], [489], [493], [497], [499], [502], [548], [558], [568], [578], [584], [588], [592], [596], [598], [601], [647], [657], [667], [677], [687], [691], [695], [697], [700], [746], [756], [766], [776], [782], [786], [790], [794], [796], [799], [845], [855], [865], [875], [1504], [1505], [1509], [1510], [1511] [2019-09-10 08:57:59,201 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:57:59,202 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:57:59,501 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:58:00,997 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 08:58:01,000 INFO L272 AbstractInterpreter]: Visited 172 different actions 840 times. Merged at 68 different actions 609 times. Widened at 36 different actions 95 times. Performed 2851 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2851 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 30 fixpoints after 11 different actions. Largest state had 297 variables. [2019-09-10 08:58:01,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:58:01,005 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 08:58:01,753 INFO L227 lantSequenceWeakener]: Weakened 123 states. On average, predicates are now at 88.52% of their original sizes. [2019-09-10 08:58:01,753 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 08:58:39,108 INFO L420 sIntCurrentIteration]: We unified 180 AI predicates to 180 [2019-09-10 08:58:39,109 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 08:58:39,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 08:58:39,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [130] imperfect sequences [5] total 133 [2019-09-10 08:58:39,109 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:58:39,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 130 states [2019-09-10 08:58:39,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2019-09-10 08:58:39,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1827, Invalid=14943, Unknown=0, NotChecked=0, Total=16770 [2019-09-10 08:58:39,117 INFO L87 Difference]: Start difference. First operand 48294 states and 77353 transitions. Second operand 130 states. [2019-09-10 09:02:12,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:02:12,695 INFO L93 Difference]: Finished difference Result 230185 states and 362875 transitions. [2019-09-10 09:02:12,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2019-09-10 09:02:12,695 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 181 [2019-09-10 09:02:12,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:02:13,361 INFO L225 Difference]: With dead ends: 230185 [2019-09-10 09:02:13,362 INFO L226 Difference]: Without dead ends: 230185 [2019-09-10 09:02:13,379 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22091 ImplicationChecksByTransitivity, 50.4s TimeCoverageRelationStatistics Valid=6691, Invalid=54071, Unknown=0, NotChecked=0, Total=60762 [2019-09-10 09:02:13,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230185 states. [2019-09-10 09:02:16,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230185 to 64279. [2019-09-10 09:02:16,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64279 states. [2019-09-10 09:02:16,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64279 states to 64279 states and 102771 transitions. [2019-09-10 09:02:16,212 INFO L78 Accepts]: Start accepts. Automaton has 64279 states and 102771 transitions. Word has length 181 [2019-09-10 09:02:16,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:02:16,212 INFO L475 AbstractCegarLoop]: Abstraction has 64279 states and 102771 transitions. [2019-09-10 09:02:16,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 130 states. [2019-09-10 09:02:16,212 INFO L276 IsEmpty]: Start isEmpty. Operand 64279 states and 102771 transitions. [2019-09-10 09:02:16,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-10 09:02:16,217 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:02:16,218 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:02:16,218 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:02:16,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:02:16,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1984582003, now seen corresponding path program 1 times [2019-09-10 09:02:16,219 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:02:16,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:16,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:02:16,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:16,220 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:02:16,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:02:16,346 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 09:02:16,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:02:16,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:02:16,346 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:02:16,347 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:02:16,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:02:16,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:02:16,347 INFO L87 Difference]: Start difference. First operand 64279 states and 102771 transitions. Second operand 3 states. [2019-09-10 09:02:16,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:02:16,809 INFO L93 Difference]: Finished difference Result 125982 states and 200406 transitions. [2019-09-10 09:02:16,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:02:16,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2019-09-10 09:02:16,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:02:17,017 INFO L225 Difference]: With dead ends: 125982 [2019-09-10 09:02:17,017 INFO L226 Difference]: Without dead ends: 125982 [2019-09-10 09:02:17,018 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 09:02:17,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125982 states. [2019-09-10 09:02:18,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125982 to 125980. [2019-09-10 09:02:18,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125980 states. [2019-09-10 09:02:18,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125980 states to 125980 states and 200405 transitions. [2019-09-10 09:02:18,920 INFO L78 Accepts]: Start accepts. Automaton has 125980 states and 200405 transitions. Word has length 182 [2019-09-10 09:02:18,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:02:18,920 INFO L475 AbstractCegarLoop]: Abstraction has 125980 states and 200405 transitions. [2019-09-10 09:02:18,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:02:18,920 INFO L276 IsEmpty]: Start isEmpty. Operand 125980 states and 200405 transitions. [2019-09-10 09:02:18,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-10 09:02:18,925 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:02:18,925 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:02:18,925 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:02:18,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:02:18,926 INFO L82 PathProgramCache]: Analyzing trace with hash -484699789, now seen corresponding path program 1 times [2019-09-10 09:02:18,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:02:18,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:18,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:02:18,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:18,927 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:02:18,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:02:19,026 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:02:19,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:02:19,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:02:19,026 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:02:19,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:02:19,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:02:19,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:02:19,028 INFO L87 Difference]: Start difference. First operand 125980 states and 200405 transitions. Second operand 3 states. [2019-09-10 09:02:20,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:02:20,032 INFO L93 Difference]: Finished difference Result 246442 states and 390179 transitions. [2019-09-10 09:02:20,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:02:20,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2019-09-10 09:02:20,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:02:20,557 INFO L225 Difference]: With dead ends: 246442 [2019-09-10 09:02:20,557 INFO L226 Difference]: Without dead ends: 246442 [2019-09-10 09:02:20,557 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 09:02:20,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246442 states. [2019-09-10 09:02:26,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246442 to 246440. [2019-09-10 09:02:26,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246440 states. [2019-09-10 09:02:27,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246440 states to 246440 states and 390178 transitions. [2019-09-10 09:02:27,182 INFO L78 Accepts]: Start accepts. Automaton has 246440 states and 390178 transitions. Word has length 182 [2019-09-10 09:02:27,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:02:27,182 INFO L475 AbstractCegarLoop]: Abstraction has 246440 states and 390178 transitions. [2019-09-10 09:02:27,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:02:27,182 INFO L276 IsEmpty]: Start isEmpty. Operand 246440 states and 390178 transitions. [2019-09-10 09:02:27,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-10 09:02:27,916 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:02:27,917 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:02:27,917 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:02:27,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:02:27,917 INFO L82 PathProgramCache]: Analyzing trace with hash 171252797, now seen corresponding path program 1 times [2019-09-10 09:02:27,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:02:27,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:27,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:02:27,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:27,919 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:02:27,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:02:28,012 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:02:28,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:02:28,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:02:28,013 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:02:28,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:02:28,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:02:28,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:02:28,014 INFO L87 Difference]: Start difference. First operand 246440 states and 390178 transitions. Second operand 3 states. [2019-09-10 09:02:29,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:02:29,605 INFO L93 Difference]: Finished difference Result 483551 states and 761507 transitions. [2019-09-10 09:02:29,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:02:29,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2019-09-10 09:02:29,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:02:30,406 INFO L225 Difference]: With dead ends: 483551 [2019-09-10 09:02:30,406 INFO L226 Difference]: Without dead ends: 483551 [2019-09-10 09:02:30,407 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 09:02:30,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483551 states. [2019-09-10 09:02:45,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483551 to 483549. [2019-09-10 09:02:45,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483549 states. [2019-09-10 09:02:46,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483549 states to 483549 states and 761506 transitions. [2019-09-10 09:02:46,259 INFO L78 Accepts]: Start accepts. Automaton has 483549 states and 761506 transitions. Word has length 182 [2019-09-10 09:02:46,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:02:46,259 INFO L475 AbstractCegarLoop]: Abstraction has 483549 states and 761506 transitions. [2019-09-10 09:02:46,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:02:46,260 INFO L276 IsEmpty]: Start isEmpty. Operand 483549 states and 761506 transitions. [2019-09-10 09:02:46,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-10 09:02:46,274 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:02:46,274 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:02:46,275 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:02:46,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:02:46,275 INFO L82 PathProgramCache]: Analyzing trace with hash 29967305, now seen corresponding path program 1 times [2019-09-10 09:02:46,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:02:46,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:46,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:02:46,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:46,276 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:02:46,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:02:46,341 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 09:02:46,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:02:46,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:02:46,342 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:02:46,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:02:46,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:02:46,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:02:46,343 INFO L87 Difference]: Start difference. First operand 483549 states and 761506 transitions. Second operand 3 states. [2019-09-10 09:02:51,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:02:51,637 INFO L93 Difference]: Finished difference Result 967056 states and 1522930 transitions. [2019-09-10 09:02:51,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:02:51,637 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2019-09-10 09:02:51,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:02:53,298 INFO L225 Difference]: With dead ends: 967056 [2019-09-10 09:02:53,299 INFO L226 Difference]: Without dead ends: 967056 [2019-09-10 09:02:53,299 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 09:02:53,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967056 states. [2019-09-10 09:03:11,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967056 to 483588. [2019-09-10 09:03:11,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483588 states. [2019-09-10 09:03:12,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483588 states to 483588 states and 761566 transitions. [2019-09-10 09:03:12,862 INFO L78 Accepts]: Start accepts. Automaton has 483588 states and 761566 transitions. Word has length 183 [2019-09-10 09:03:12,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:03:12,862 INFO L475 AbstractCegarLoop]: Abstraction has 483588 states and 761566 transitions. [2019-09-10 09:03:12,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:03:12,863 INFO L276 IsEmpty]: Start isEmpty. Operand 483588 states and 761566 transitions. [2019-09-10 09:03:12,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-10 09:03:12,879 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:03:12,879 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:03:12,879 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:03:12,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:03:12,879 INFO L82 PathProgramCache]: Analyzing trace with hash -859975525, now seen corresponding path program 1 times [2019-09-10 09:03:12,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:03:12,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:03:12,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:03:12,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:03:12,880 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:03:12,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:03:12,947 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 09:03:12,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:03:12,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:03:12,947 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:03:12,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:03:12,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:03:12,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:03:12,949 INFO L87 Difference]: Start difference. First operand 483588 states and 761566 transitions. Second operand 3 states. [2019-09-10 09:03:21,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:03:21,648 INFO L93 Difference]: Finished difference Result 965869 states and 1520810 transitions. [2019-09-10 09:03:21,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:03:21,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2019-09-10 09:03:21,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:03:23,069 INFO L225 Difference]: With dead ends: 965869 [2019-09-10 09:03:23,070 INFO L226 Difference]: Without dead ends: 965869 [2019-09-10 09:03:23,070 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 09:03:23,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965869 states. [2019-09-10 09:03:38,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965869 to 483690. [2019-09-10 09:03:38,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483690 states. [2019-09-10 09:03:39,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483690 states to 483690 states and 761668 transitions. [2019-09-10 09:03:39,452 INFO L78 Accepts]: Start accepts. Automaton has 483690 states and 761668 transitions. Word has length 183 [2019-09-10 09:03:39,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:03:39,452 INFO L475 AbstractCegarLoop]: Abstraction has 483690 states and 761668 transitions. [2019-09-10 09:03:39,452 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:03:39,452 INFO L276 IsEmpty]: Start isEmpty. Operand 483690 states and 761668 transitions. [2019-09-10 09:03:39,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-10 09:03:39,465 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:03:39,466 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:03:39,466 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:03:39,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:03:39,466 INFO L82 PathProgramCache]: Analyzing trace with hash -322008661, now seen corresponding path program 1 times [2019-09-10 09:03:39,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:03:39,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:03:39,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:03:39,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:03:39,467 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:03:39,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:03:39,570 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 09:03:39,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:03:39,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:03:39,570 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:03:39,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:03:39,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:03:39,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:03:39,571 INFO L87 Difference]: Start difference. First operand 483690 states and 761668 transitions. Second operand 3 states. [2019-09-10 09:03:47,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:03:47,100 INFO L93 Difference]: Finished difference Result 716871 states and 1127429 transitions. [2019-09-10 09:03:47,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:03:47,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2019-09-10 09:03:47,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:03:49,141 INFO L225 Difference]: With dead ends: 716871 [2019-09-10 09:03:49,141 INFO L226 Difference]: Without dead ends: 716871 [2019-09-10 09:03:49,142 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 09:03:49,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716871 states. [2019-09-10 09:03:55,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716871 to 490629. [2019-09-10 09:03:55,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490629 states. [2019-09-10 09:03:57,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490629 states to 490629 states and 771548 transitions. [2019-09-10 09:03:57,919 INFO L78 Accepts]: Start accepts. Automaton has 490629 states and 771548 transitions. Word has length 183 [2019-09-10 09:03:57,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:03:57,919 INFO L475 AbstractCegarLoop]: Abstraction has 490629 states and 771548 transitions. [2019-09-10 09:03:57,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:03:57,919 INFO L276 IsEmpty]: Start isEmpty. Operand 490629 states and 771548 transitions. [2019-09-10 09:03:57,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-10 09:03:57,928 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:03:57,928 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:03:57,928 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:03:57,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:03:57,928 INFO L82 PathProgramCache]: Analyzing trace with hash 149893448, now seen corresponding path program 1 times [2019-09-10 09:03:57,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:03:57,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:03:57,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:03:57,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:03:57,930 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:03:57,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:03:58,015 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 09:03:58,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:03:58,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:03:58,016 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:03:58,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:03:58,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:03:58,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:03:58,017 INFO L87 Difference]: Start difference. First operand 490629 states and 771548 transitions. Second operand 3 states. [2019-09-10 09:04:07,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:04:07,390 INFO L93 Difference]: Finished difference Result 683671 states and 1072984 transitions. [2019-09-10 09:04:07,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:04:07,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2019-09-10 09:04:07,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:04:08,372 INFO L225 Difference]: With dead ends: 683671 [2019-09-10 09:04:08,372 INFO L226 Difference]: Without dead ends: 683671 [2019-09-10 09:04:08,372 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 09:04:08,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683671 states. [2019-09-10 09:04:15,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683671 to 499985. [2019-09-10 09:04:15,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499985 states. [2019-09-10 09:04:16,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499985 states to 499985 states and 784875 transitions. [2019-09-10 09:04:16,251 INFO L78 Accepts]: Start accepts. Automaton has 499985 states and 784875 transitions. Word has length 183 [2019-09-10 09:04:16,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:04:16,252 INFO L475 AbstractCegarLoop]: Abstraction has 499985 states and 784875 transitions. [2019-09-10 09:04:16,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:04:16,252 INFO L276 IsEmpty]: Start isEmpty. Operand 499985 states and 784875 transitions. [2019-09-10 09:04:16,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-10 09:04:16,261 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:04:16,262 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:04:16,262 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:04:16,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:04:16,262 INFO L82 PathProgramCache]: Analyzing trace with hash -162872103, now seen corresponding path program 1 times [2019-09-10 09:04:16,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:04:16,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:16,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:04:16,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:16,264 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:04:16,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:04:16,368 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 09:04:16,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:04:16,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:04:16,369 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:04:16,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:04:16,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:04:16,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:04:16,370 INFO L87 Difference]: Start difference. First operand 499985 states and 784875 transitions. Second operand 3 states. [2019-09-10 09:04:23,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:04:23,529 INFO L93 Difference]: Finished difference Result 677019 states and 1064550 transitions. [2019-09-10 09:04:23,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:04:23,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2019-09-10 09:04:23,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:04:25,459 INFO L225 Difference]: With dead ends: 677019 [2019-09-10 09:04:25,459 INFO L226 Difference]: Without dead ends: 677019 [2019-09-10 09:04:25,460 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 09:04:25,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677019 states. [2019-09-10 09:04:31,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677019 to 509361. [2019-09-10 09:04:31,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509361 states. [2019-09-10 09:04:33,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509361 states to 509361 states and 798229 transitions. [2019-09-10 09:04:33,449 INFO L78 Accepts]: Start accepts. Automaton has 509361 states and 798229 transitions. Word has length 183 [2019-09-10 09:04:33,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:04:33,449 INFO L475 AbstractCegarLoop]: Abstraction has 509361 states and 798229 transitions. [2019-09-10 09:04:33,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:04:33,449 INFO L276 IsEmpty]: Start isEmpty. Operand 509361 states and 798229 transitions. [2019-09-10 09:04:33,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-10 09:04:33,458 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:04:33,459 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:04:33,459 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:04:33,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:04:33,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1329744708, now seen corresponding path program 1 times [2019-09-10 09:04:33,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:04:33,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:33,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:04:33,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:33,461 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:04:33,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:04:33,527 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 09:04:33,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:04:33,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:04:33,528 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:04:33,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:04:33,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:04:33,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:04:33,529 INFO L87 Difference]: Start difference. First operand 509361 states and 798229 transitions. Second operand 3 states. [2019-09-10 09:04:43,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:04:43,281 INFO L93 Difference]: Finished difference Result 1016938 states and 1593157 transitions. [2019-09-10 09:04:43,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:04:43,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2019-09-10 09:04:43,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:04:45,632 INFO L225 Difference]: With dead ends: 1016938 [2019-09-10 09:04:45,633 INFO L226 Difference]: Without dead ends: 1016938 [2019-09-10 09:04:45,633 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 09:04:46,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016938 states. [2019-09-10 09:04:53,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016938 to 509887. [2019-09-10 09:04:53,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509887 states. [2019-09-10 09:04:55,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509887 states to 509887 states and 798962 transitions. [2019-09-10 09:04:55,720 INFO L78 Accepts]: Start accepts. Automaton has 509887 states and 798962 transitions. Word has length 183 [2019-09-10 09:04:55,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:04:55,720 INFO L475 AbstractCegarLoop]: Abstraction has 509887 states and 798962 transitions. [2019-09-10 09:04:55,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:04:55,720 INFO L276 IsEmpty]: Start isEmpty. Operand 509887 states and 798962 transitions. [2019-09-10 09:04:55,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-10 09:04:55,732 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:04:55,732 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:04:55,732 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:04:55,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:04:55,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1784408062, now seen corresponding path program 1 times [2019-09-10 09:04:55,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:04:55,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:55,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:04:55,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:55,734 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:04:55,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:04:55,799 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 09:04:55,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:04:55,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:04:55,799 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:04:55,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:04:55,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:04:55,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:04:55,800 INFO L87 Difference]: Start difference. First operand 509887 states and 798962 transitions. Second operand 3 states. [2019-09-10 09:05:00,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:05:00,323 INFO L93 Difference]: Finished difference Result 1017467 states and 1593943 transitions. [2019-09-10 09:05:00,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:05:00,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2019-09-10 09:05:00,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:05:01,863 INFO L225 Difference]: With dead ends: 1017467 [2019-09-10 09:05:01,864 INFO L226 Difference]: Without dead ends: 1017467 [2019-09-10 09:05:01,864 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 09:05:12,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017467 states. [2019-09-10 09:05:20,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017467 to 510764. [2019-09-10 09:05:20,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510764 states. [2019-09-10 09:05:21,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510764 states to 510764 states and 800269 transitions. [2019-09-10 09:05:21,935 INFO L78 Accepts]: Start accepts. Automaton has 510764 states and 800269 transitions. Word has length 183 [2019-09-10 09:05:21,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:05:21,935 INFO L475 AbstractCegarLoop]: Abstraction has 510764 states and 800269 transitions. [2019-09-10 09:05:21,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:05:21,935 INFO L276 IsEmpty]: Start isEmpty. Operand 510764 states and 800269 transitions. [2019-09-10 09:05:21,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-10 09:05:21,944 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:05:21,944 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:05:21,945 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:05:21,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:05:21,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1030945195, now seen corresponding path program 1 times [2019-09-10 09:05:21,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:05:21,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:05:21,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:05:21,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:05:21,946 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:05:21,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:05:22,018 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 09:05:22,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:05:22,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:05:22,018 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:05:22,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:05:22,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:05:22,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:05:22,020 INFO L87 Difference]: Start difference. First operand 510764 states and 800269 transitions. Second operand 3 states. [2019-09-10 09:05:31,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:05:31,209 INFO L93 Difference]: Finished difference Result 1018182 states and 1595149 transitions. [2019-09-10 09:05:31,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:05:31,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2019-09-10 09:05:31,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:05:33,588 INFO L225 Difference]: With dead ends: 1018182 [2019-09-10 09:05:33,588 INFO L226 Difference]: Without dead ends: 1018182 [2019-09-10 09:05:33,588 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 09:05:34,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018182 states. [2019-09-10 09:05:42,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018182 to 510920. [2019-09-10 09:05:42,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510920 states. [2019-09-10 09:05:43,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510920 states to 510920 states and 800427 transitions. [2019-09-10 09:05:43,351 INFO L78 Accepts]: Start accepts. Automaton has 510920 states and 800427 transitions. Word has length 183 [2019-09-10 09:05:43,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:05:43,352 INFO L475 AbstractCegarLoop]: Abstraction has 510920 states and 800427 transitions. [2019-09-10 09:05:43,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:05:43,352 INFO L276 IsEmpty]: Start isEmpty. Operand 510920 states and 800427 transitions. [2019-09-10 09:05:43,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-10 09:05:43,362 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:05:43,362 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:05:43,362 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:05:43,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:05:43,363 INFO L82 PathProgramCache]: Analyzing trace with hash 2133930866, now seen corresponding path program 1 times [2019-09-10 09:05:43,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:05:43,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:05:43,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:05:43,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:05:43,364 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:05:43,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:05:43,418 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 09:05:43,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:05:43,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:05:43,419 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:05:43,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:05:43,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:05:43,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:05:43,420 INFO L87 Difference]: Start difference. First operand 510920 states and 800427 transitions. Second operand 3 states. [2019-09-10 09:05:52,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:05:52,573 INFO L93 Difference]: Finished difference Result 1021612 states and 1600424 transitions. [2019-09-10 09:05:52,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:05:52,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2019-09-10 09:05:52,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:05:53,940 INFO L225 Difference]: With dead ends: 1021612 [2019-09-10 09:05:53,940 INFO L226 Difference]: Without dead ends: 1021612 [2019-09-10 09:05:53,940 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 09:05:54,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021612 states. [2019-09-10 09:06:02,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021612 to 511016. [2019-09-10 09:06:02,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511016 states. [2019-09-10 09:06:03,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511016 states to 511016 states and 800571 transitions. [2019-09-10 09:06:03,575 INFO L78 Accepts]: Start accepts. Automaton has 511016 states and 800571 transitions. Word has length 183 [2019-09-10 09:06:03,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:06:03,575 INFO L475 AbstractCegarLoop]: Abstraction has 511016 states and 800571 transitions. [2019-09-10 09:06:03,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:06:03,575 INFO L276 IsEmpty]: Start isEmpty. Operand 511016 states and 800571 transitions. [2019-09-10 09:06:03,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-10 09:06:03,585 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:06:03,585 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:06:03,585 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:06:03,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:06:03,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1901862356, now seen corresponding path program 1 times [2019-09-10 09:06:03,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:06:03,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:03,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:06:03,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:03,587 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:06:03,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:06:03,642 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 09:06:03,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:06:03,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:06:03,643 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:06:03,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:06:03,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:06:03,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:06:03,644 INFO L87 Difference]: Start difference. First operand 511016 states and 800571 transitions. Second operand 3 states. [2019-09-10 09:06:16,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:06:16,783 INFO L93 Difference]: Finished difference Result 1021178 states and 1599738 transitions. [2019-09-10 09:06:16,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:06:16,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2019-09-10 09:06:16,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:06:18,538 INFO L225 Difference]: With dead ends: 1021178 [2019-09-10 09:06:18,538 INFO L226 Difference]: Without dead ends: 1021178 [2019-09-10 09:06:18,539 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 09:06:19,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021178 states.