java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:09:54,309 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:09:54,312 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:09:54,331 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:09:54,331 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:09:54,333 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:09:54,335 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:09:54,345 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:09:54,349 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:09:54,352 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:09:54,355 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:09:54,357 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:09:54,357 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:09:54,359 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:09:54,361 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:09:54,362 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:09:54,364 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:09:54,365 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:09:54,367 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:09:54,369 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:09:54,370 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:09:54,371 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:09:54,372 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:09:54,373 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:09:54,374 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:09:54,375 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:09:54,375 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:09:54,376 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:09:54,376 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:09:54,377 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:09:54,377 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:09:54,379 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:09:54,379 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:09:54,380 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:09:54,381 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:09:54,383 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:09:54,383 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:09:54,384 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:09:54,384 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:09:54,385 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:09:54,385 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:09:54,387 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:09:54,423 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:09:54,424 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:09:54,424 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:09:54,424 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:09:54,425 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:09:54,425 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:09:54,425 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:09:54,425 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:09:54,426 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:09:54,426 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:09:54,430 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:09:54,430 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:09:54,431 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:09:54,431 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:09:54,431 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:09:54,431 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:09:54,431 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:09:54,432 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:09:54,432 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:09:54,432 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:09:54,432 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:09:54,432 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:09:54,433 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:09:54,433 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:09:54,433 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:09:54,433 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:09:54,433 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:09:54,434 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:09:54,434 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:09:54,434 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:09:54,466 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:09:54,478 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:09:54,481 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:09:54,482 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:09:54,483 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:09:54,483 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.p+lhb-reducer.c [2019-09-10 08:09:54,543 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52d9cd594/b00749358cb6471693d251ae30dbda97/FLAGa9ee6b430 [2019-09-10 08:09:55,136 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:09:55,137 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.p+lhb-reducer.c [2019-09-10 08:09:55,161 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52d9cd594/b00749358cb6471693d251ae30dbda97/FLAGa9ee6b430 [2019-09-10 08:09:55,380 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52d9cd594/b00749358cb6471693d251ae30dbda97 [2019-09-10 08:09:55,388 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:09:55,390 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:09:55,391 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:09:55,391 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:09:55,394 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:09:55,395 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:09:55" (1/1) ... [2019-09-10 08:09:55,398 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52f1ec00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:09:55, skipping insertion in model container [2019-09-10 08:09:55,398 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:09:55" (1/1) ... [2019-09-10 08:09:55,405 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:09:55,487 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:09:56,084 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:09:56,111 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:09:56,483 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:09:56,507 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:09:56,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:09:56 WrapperNode [2019-09-10 08:09:56,507 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:09:56,508 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:09:56,508 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:09:56,509 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:09:56,523 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:09:56" (1/1) ... [2019-09-10 08:09:56,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:09:56" (1/1) ... [2019-09-10 08:09:56,541 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:09:56" (1/1) ... [2019-09-10 08:09:56,541 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:09:56" (1/1) ... [2019-09-10 08:09:56,566 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:09:56" (1/1) ... [2019-09-10 08:09:56,587 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:09:56" (1/1) ... [2019-09-10 08:09:56,592 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:09:56" (1/1) ... [2019-09-10 08:09:56,606 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:09:56,607 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:09:56,609 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:09:56,609 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:09:56,610 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:09:56" (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:09:56,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:09:56,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:09:56,686 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:09:56,686 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:09:56,686 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:09:56,687 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:09:56,687 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:09:56,687 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:09:56,687 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:09:56,687 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:09:56,687 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:09:56,688 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:09:56,688 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:09:56,688 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 08:09:56,688 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 08:09:56,688 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-10 08:09:56,689 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:09:56,689 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:09:56,689 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:09:56,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:09:56,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:09:58,261 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:09:58,262 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:09:58,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:09:58 BoogieIcfgContainer [2019-09-10 08:09:58,266 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:09:58,267 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:09:58,267 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:09:58,271 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:09:58,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:09:55" (1/3) ... [2019-09-10 08:09:58,273 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@628710b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:09:58, skipping insertion in model container [2019-09-10 08:09:58,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:09:56" (2/3) ... [2019-09-10 08:09:58,274 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@628710b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:09:58, skipping insertion in model container [2019-09-10 08:09:58,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:09:58" (3/3) ... [2019-09-10 08:09:58,279 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.1.ufo.BOUNDED-12.pals.c.p+lhb-reducer.c [2019-09-10 08:09:58,290 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:09:58,314 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 08:09:58,334 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 08:09:58,368 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:09:58,368 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:09:58,368 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:09:58,368 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:09:58,369 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:09:58,369 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:09:58,369 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:09:58,369 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:09:58,412 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states. [2019-09-10 08:09:58,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-10 08:09:58,457 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:09:58,458 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:09:58,461 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:09:58,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:09:58,465 INFO L82 PathProgramCache]: Analyzing trace with hash 266849754, now seen corresponding path program 1 times [2019-09-10 08:09:58,467 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:09:58,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:09:58,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:09:58,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:09:58,520 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:09:58,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:09:58,941 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:09:58,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:09:58,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:09:58,944 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:09:58,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:09:58,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:09:58,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:09:58,970 INFO L87 Difference]: Start difference. First operand 395 states. Second operand 4 states. [2019-09-10 08:09:59,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:09:59,190 INFO L93 Difference]: Finished difference Result 401 states and 654 transitions. [2019-09-10 08:09:59,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:09:59,195 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-09-10 08:09:59,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:09:59,222 INFO L225 Difference]: With dead ends: 401 [2019-09-10 08:09:59,222 INFO L226 Difference]: Without dead ends: 391 [2019-09-10 08:09:59,227 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:09:59,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2019-09-10 08:09:59,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2019-09-10 08:09:59,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2019-09-10 08:09:59,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 596 transitions. [2019-09-10 08:09:59,336 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 596 transitions. Word has length 151 [2019-09-10 08:09:59,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:09:59,339 INFO L475 AbstractCegarLoop]: Abstraction has 391 states and 596 transitions. [2019-09-10 08:09:59,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:09:59,340 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 596 transitions. [2019-09-10 08:09:59,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-10 08:09:59,343 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:09:59,343 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:09:59,344 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:09:59,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:09:59,344 INFO L82 PathProgramCache]: Analyzing trace with hash -286354186, now seen corresponding path program 1 times [2019-09-10 08:09:59,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:09:59,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:09:59,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:09:59,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:09:59,347 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:09:59,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:09:59,616 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:09:59,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:09:59,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:09:59,617 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:09:59,619 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:09:59,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:09:59,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:09:59,620 INFO L87 Difference]: Start difference. First operand 391 states and 596 transitions. Second operand 3 states. [2019-09-10 08:09:59,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:09:59,689 INFO L93 Difference]: Finished difference Result 628 states and 969 transitions. [2019-09-10 08:09:59,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:09:59,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 190 [2019-09-10 08:09:59,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:09:59,694 INFO L225 Difference]: With dead ends: 628 [2019-09-10 08:09:59,695 INFO L226 Difference]: Without dead ends: 628 [2019-09-10 08:09:59,695 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:09:59,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2019-09-10 08:09:59,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 626. [2019-09-10 08:09:59,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-09-10 08:09:59,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 968 transitions. [2019-09-10 08:09:59,716 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 968 transitions. Word has length 190 [2019-09-10 08:09:59,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:09:59,717 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 968 transitions. [2019-09-10 08:09:59,717 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:09:59,717 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 968 transitions. [2019-09-10 08:09:59,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-10 08:09:59,720 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:09:59,720 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:09:59,721 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:09:59,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:09:59,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1628621540, now seen corresponding path program 1 times [2019-09-10 08:09:59,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:09:59,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:09:59,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:09:59,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:09:59,724 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:09:59,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:09:59,963 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:09:59,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:09:59,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:09:59,964 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:09:59,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:09:59,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:09:59,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:09:59,970 INFO L87 Difference]: Start difference. First operand 626 states and 968 transitions. Second operand 3 states. [2019-09-10 08:10:00,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:10:00,034 INFO L93 Difference]: Finished difference Result 1058 states and 1647 transitions. [2019-09-10 08:10:00,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:10:00,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2019-09-10 08:10:00,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:10:00,047 INFO L225 Difference]: With dead ends: 1058 [2019-09-10 08:10:00,047 INFO L226 Difference]: Without dead ends: 1058 [2019-09-10 08:10:00,047 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:10:00,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2019-09-10 08:10:00,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 1056. [2019-09-10 08:10:00,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1056 states. [2019-09-10 08:10:00,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 1646 transitions. [2019-09-10 08:10:00,076 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 1646 transitions. Word has length 193 [2019-09-10 08:10:00,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:10:00,076 INFO L475 AbstractCegarLoop]: Abstraction has 1056 states and 1646 transitions. [2019-09-10 08:10:00,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:10:00,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1646 transitions. [2019-09-10 08:10:00,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-10 08:10:00,081 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:10:00,081 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:10:00,081 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:10:00,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:10:00,082 INFO L82 PathProgramCache]: Analyzing trace with hash 981722112, now seen corresponding path program 1 times [2019-09-10 08:10:00,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:10:00,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:00,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:10:00,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:00,084 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:10:00,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:10:00,244 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:10:00,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:10:00,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:10:00,245 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:10:00,246 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:10:00,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:10:00,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:10:00,246 INFO L87 Difference]: Start difference. First operand 1056 states and 1646 transitions. Second operand 3 states. [2019-09-10 08:10:00,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:10:00,307 INFO L93 Difference]: Finished difference Result 1834 states and 2863 transitions. [2019-09-10 08:10:00,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:10:00,308 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2019-09-10 08:10:00,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:10:00,317 INFO L225 Difference]: With dead ends: 1834 [2019-09-10 08:10:00,317 INFO L226 Difference]: Without dead ends: 1834 [2019-09-10 08:10:00,318 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:10:00,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1834 states. [2019-09-10 08:10:00,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1834 to 1832. [2019-09-10 08:10:00,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1832 states. [2019-09-10 08:10:00,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1832 states to 1832 states and 2862 transitions. [2019-09-10 08:10:00,361 INFO L78 Accepts]: Start accepts. Automaton has 1832 states and 2862 transitions. Word has length 196 [2019-09-10 08:10:00,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:10:00,361 INFO L475 AbstractCegarLoop]: Abstraction has 1832 states and 2862 transitions. [2019-09-10 08:10:00,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:10:00,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1832 states and 2862 transitions. [2019-09-10 08:10:00,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-09-10 08:10:00,368 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:10:00,368 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:10:00,368 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:10:00,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:10:00,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1479581457, now seen corresponding path program 1 times [2019-09-10 08:10:00,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:10:00,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:00,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:10:00,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:00,371 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:10:00,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:10:00,553 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:10:00,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:10:00,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:10:00,555 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:10:00,556 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:10:00,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:10:00,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:10:00,557 INFO L87 Difference]: Start difference. First operand 1832 states and 2862 transitions. Second operand 3 states. [2019-09-10 08:10:00,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:10:00,627 INFO L93 Difference]: Finished difference Result 3214 states and 5007 transitions. [2019-09-10 08:10:00,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:10:00,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 199 [2019-09-10 08:10:00,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:10:00,643 INFO L225 Difference]: With dead ends: 3214 [2019-09-10 08:10:00,643 INFO L226 Difference]: Without dead ends: 3214 [2019-09-10 08:10:00,644 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:10:00,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3214 states. [2019-09-10 08:10:00,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3214 to 3212. [2019-09-10 08:10:00,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3212 states. [2019-09-10 08:10:00,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3212 states to 3212 states and 5006 transitions. [2019-09-10 08:10:00,728 INFO L78 Accepts]: Start accepts. Automaton has 3212 states and 5006 transitions. Word has length 199 [2019-09-10 08:10:00,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:10:00,728 INFO L475 AbstractCegarLoop]: Abstraction has 3212 states and 5006 transitions. [2019-09-10 08:10:00,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:10:00,729 INFO L276 IsEmpty]: Start isEmpty. Operand 3212 states and 5006 transitions. [2019-09-10 08:10:00,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-09-10 08:10:00,739 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:10:00,739 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:10:00,739 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:10:00,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:10:00,740 INFO L82 PathProgramCache]: Analyzing trace with hash 560825427, now seen corresponding path program 1 times [2019-09-10 08:10:00,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:10:00,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:00,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:10:00,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:00,742 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:10:00,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:10:00,858 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:10:00,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:10:00,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:10:00,859 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:10:00,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:10:00,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:10:00,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:10:00,861 INFO L87 Difference]: Start difference. First operand 3212 states and 5006 transitions. Second operand 3 states. [2019-09-10 08:10:00,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:10:00,980 INFO L93 Difference]: Finished difference Result 5626 states and 8711 transitions. [2019-09-10 08:10:00,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:10:00,981 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 202 [2019-09-10 08:10:00,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:10:01,008 INFO L225 Difference]: With dead ends: 5626 [2019-09-10 08:10:01,008 INFO L226 Difference]: Without dead ends: 5626 [2019-09-10 08:10:01,009 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:10:01,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5626 states. [2019-09-10 08:10:01,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5626 to 5624. [2019-09-10 08:10:01,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5624 states. [2019-09-10 08:10:01,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5624 states to 5624 states and 8710 transitions. [2019-09-10 08:10:01,216 INFO L78 Accepts]: Start accepts. Automaton has 5624 states and 8710 transitions. Word has length 202 [2019-09-10 08:10:01,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:10:01,220 INFO L475 AbstractCegarLoop]: Abstraction has 5624 states and 8710 transitions. [2019-09-10 08:10:01,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:10:01,226 INFO L276 IsEmpty]: Start isEmpty. Operand 5624 states and 8710 transitions. [2019-09-10 08:10:01,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-10 08:10:01,243 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:10:01,243 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:10:01,251 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:10:01,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:10:01,252 INFO L82 PathProgramCache]: Analyzing trace with hash -2136736005, now seen corresponding path program 1 times [2019-09-10 08:10:01,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:10:01,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:01,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:10:01,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:01,254 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:10:01,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:10:01,383 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:10:01,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:10:01,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:10:01,384 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:10:01,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:10:01,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:10:01,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:10:01,385 INFO L87 Difference]: Start difference. First operand 5624 states and 8710 transitions. Second operand 3 states. [2019-09-10 08:10:01,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:10:01,492 INFO L93 Difference]: Finished difference Result 9750 states and 14943 transitions. [2019-09-10 08:10:01,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:10:01,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2019-09-10 08:10:01,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:10:01,551 INFO L225 Difference]: With dead ends: 9750 [2019-09-10 08:10:01,551 INFO L226 Difference]: Without dead ends: 9750 [2019-09-10 08:10:01,552 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:10:01,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9750 states. [2019-09-10 08:10:01,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9750 to 9748. [2019-09-10 08:10:01,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9748 states. [2019-09-10 08:10:01,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9748 states to 9748 states and 14942 transitions. [2019-09-10 08:10:01,987 INFO L78 Accepts]: Start accepts. Automaton has 9748 states and 14942 transitions. Word has length 205 [2019-09-10 08:10:01,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:10:01,987 INFO L475 AbstractCegarLoop]: Abstraction has 9748 states and 14942 transitions. [2019-09-10 08:10:01,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:10:01,988 INFO L276 IsEmpty]: Start isEmpty. Operand 9748 states and 14942 transitions. [2019-09-10 08:10:02,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-10 08:10:02,010 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:10:02,010 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:10:02,010 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:10:02,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:10:02,011 INFO L82 PathProgramCache]: Analyzing trace with hash -684524413, now seen corresponding path program 1 times [2019-09-10 08:10:02,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:10:02,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:02,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:10:02,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:02,013 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:10:02,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:10:02,116 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:10:02,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:10:02,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:10:02,117 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:10:02,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:10:02,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:10:02,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:10:02,118 INFO L87 Difference]: Start difference. First operand 9748 states and 14942 transitions. Second operand 3 states. [2019-09-10 08:10:02,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:10:02,719 INFO L93 Difference]: Finished difference Result 19332 states and 29514 transitions. [2019-09-10 08:10:02,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:10:02,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 208 [2019-09-10 08:10:02,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:10:02,786 INFO L225 Difference]: With dead ends: 19332 [2019-09-10 08:10:02,786 INFO L226 Difference]: Without dead ends: 19332 [2019-09-10 08:10:02,787 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:10:02,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19332 states. [2019-09-10 08:10:03,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19332 to 19330. [2019-09-10 08:10:03,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19330 states. [2019-09-10 08:10:03,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19330 states to 19330 states and 29513 transitions. [2019-09-10 08:10:03,244 INFO L78 Accepts]: Start accepts. Automaton has 19330 states and 29513 transitions. Word has length 208 [2019-09-10 08:10:03,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:10:03,245 INFO L475 AbstractCegarLoop]: Abstraction has 19330 states and 29513 transitions. [2019-09-10 08:10:03,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:10:03,245 INFO L276 IsEmpty]: Start isEmpty. Operand 19330 states and 29513 transitions. [2019-09-10 08:10:03,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-10 08:10:03,289 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:10:03,289 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:03,289 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:10:03,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:10:03,290 INFO L82 PathProgramCache]: Analyzing trace with hash 897876104, now seen corresponding path program 1 times [2019-09-10 08:10:03,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:10:03,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:03,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:10:03,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:03,292 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:10:03,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:10:03,395 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:10:03,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:10:03,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:10:03,396 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:10:03,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:10:03,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:10:03,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:10:03,397 INFO L87 Difference]: Start difference. First operand 19330 states and 29513 transitions. Second operand 3 states. [2019-09-10 08:10:04,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:10:04,571 INFO L93 Difference]: Finished difference Result 38376 states and 58316 transitions. [2019-09-10 08:10:04,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:10:04,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 208 [2019-09-10 08:10:04,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:10:04,657 INFO L225 Difference]: With dead ends: 38376 [2019-09-10 08:10:04,657 INFO L226 Difference]: Without dead ends: 38376 [2019-09-10 08:10:04,658 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:10:04,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38376 states. [2019-09-10 08:10:05,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38376 to 38374. [2019-09-10 08:10:05,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38374 states. [2019-09-10 08:10:05,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38374 states to 38374 states and 58315 transitions. [2019-09-10 08:10:05,271 INFO L78 Accepts]: Start accepts. Automaton has 38374 states and 58315 transitions. Word has length 208 [2019-09-10 08:10:05,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:10:05,272 INFO L475 AbstractCegarLoop]: Abstraction has 38374 states and 58315 transitions. [2019-09-10 08:10:05,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:10:05,272 INFO L276 IsEmpty]: Start isEmpty. Operand 38374 states and 58315 transitions. [2019-09-10 08:10:05,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-10 08:10:05,379 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:10:05,380 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:10:05,380 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:10:05,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:10:05,380 INFO L82 PathProgramCache]: Analyzing trace with hash -312518254, now seen corresponding path program 1 times [2019-09-10 08:10:05,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:10:05,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:05,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:10:05,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:05,385 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:10:05,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:10:05,653 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:10:05,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:10:05,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:10:05,654 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:10:05,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:10:05,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:10:05,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:10:05,655 INFO L87 Difference]: Start difference. First operand 38374 states and 58315 transitions. Second operand 3 states. [2019-09-10 08:10:06,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:10:06,309 INFO L93 Difference]: Finished difference Result 76298 states and 115392 transitions. [2019-09-10 08:10:06,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:10:06,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 208 [2019-09-10 08:10:06,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:10:06,471 INFO L225 Difference]: With dead ends: 76298 [2019-09-10 08:10:06,471 INFO L226 Difference]: Without dead ends: 76298 [2019-09-10 08:10:06,471 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:10:06,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76298 states. [2019-09-10 08:10:08,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76298 to 76296. [2019-09-10 08:10:08,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76296 states. [2019-09-10 08:10:08,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76296 states to 76296 states and 115391 transitions. [2019-09-10 08:10:08,847 INFO L78 Accepts]: Start accepts. Automaton has 76296 states and 115391 transitions. Word has length 208 [2019-09-10 08:10:08,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:10:08,848 INFO L475 AbstractCegarLoop]: Abstraction has 76296 states and 115391 transitions. [2019-09-10 08:10:08,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:10:08,848 INFO L276 IsEmpty]: Start isEmpty. Operand 76296 states and 115391 transitions. [2019-09-10 08:10:08,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-10 08:10:08,929 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:10:08,929 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:10:08,930 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:10:08,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:10:08,930 INFO L82 PathProgramCache]: Analyzing trace with hash 97169672, now seen corresponding path program 1 times [2019-09-10 08:10:08,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:10:08,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:08,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:10:08,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:08,932 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:10:08,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:10:09,072 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:10:09,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:10:09,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:10:09,073 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:10:09,073 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:10:09,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:10:09,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:10:09,074 INFO L87 Difference]: Start difference. First operand 76296 states and 115391 transitions. Second operand 3 states. [2019-09-10 08:10:11,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:10:11,592 INFO L93 Difference]: Finished difference Result 151554 states and 227920 transitions. [2019-09-10 08:10:11,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:10:11,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 208 [2019-09-10 08:10:11,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:10:11,772 INFO L225 Difference]: With dead ends: 151554 [2019-09-10 08:10:11,772 INFO L226 Difference]: Without dead ends: 151554 [2019-09-10 08:10:11,773 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:10:11,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151554 states. [2019-09-10 08:10:13,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151554 to 151552. [2019-09-10 08:10:13,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151552 states. [2019-09-10 08:10:13,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151552 states to 151552 states and 227919 transitions. [2019-09-10 08:10:13,241 INFO L78 Accepts]: Start accepts. Automaton has 151552 states and 227919 transitions. Word has length 208 [2019-09-10 08:10:13,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:10:13,242 INFO L475 AbstractCegarLoop]: Abstraction has 151552 states and 227919 transitions. [2019-09-10 08:10:13,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:10:13,242 INFO L276 IsEmpty]: Start isEmpty. Operand 151552 states and 227919 transitions. [2019-09-10 08:10:15,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-10 08:10:15,595 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:10:15,595 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:10:15,595 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:10:15,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:10:15,596 INFO L82 PathProgramCache]: Analyzing trace with hash 200913421, now seen corresponding path program 1 times [2019-09-10 08:10:15,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:10:15,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:15,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:10:15,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:15,598 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:10:15,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:10:15,761 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:10:15,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:10:15,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:10:15,761 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:10:15,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:10:15,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:10:15,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:10:15,763 INFO L87 Difference]: Start difference. First operand 151552 states and 227919 transitions. Second operand 5 states. [2019-09-10 08:10:17,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:10:17,078 INFO L93 Difference]: Finished difference Result 291066 states and 434663 transitions. [2019-09-10 08:10:17,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:10:17,080 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 208 [2019-09-10 08:10:17,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:10:18,094 INFO L225 Difference]: With dead ends: 291066 [2019-09-10 08:10:18,098 INFO L226 Difference]: Without dead ends: 291066 [2019-09-10 08:10:18,099 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:10:18,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291066 states. [2019-09-10 08:10:23,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291066 to 291064. [2019-09-10 08:10:23,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291064 states. [2019-09-10 08:10:24,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291064 states to 291064 states and 434662 transitions. [2019-09-10 08:10:24,106 INFO L78 Accepts]: Start accepts. Automaton has 291064 states and 434662 transitions. Word has length 208 [2019-09-10 08:10:24,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:10:24,107 INFO L475 AbstractCegarLoop]: Abstraction has 291064 states and 434662 transitions. [2019-09-10 08:10:24,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:10:24,107 INFO L276 IsEmpty]: Start isEmpty. Operand 291064 states and 434662 transitions. [2019-09-10 08:10:24,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-10 08:10:24,406 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:10:24,406 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:10:24,407 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:10:24,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:10:24,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1879775556, now seen corresponding path program 1 times [2019-09-10 08:10:24,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:10:24,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:24,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:10:24,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:24,409 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:10:24,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:10:28,077 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:10:28,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:10:28,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:10:28,078 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:10:28,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:10:28,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:10:28,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:10:28,079 INFO L87 Difference]: Start difference. First operand 291064 states and 434662 transitions. Second operand 5 states. [2019-09-10 08:10:28,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:10:28,781 INFO L93 Difference]: Finished difference Result 146468 states and 218274 transitions. [2019-09-10 08:10:28,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:10:28,781 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 208 [2019-09-10 08:10:28,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:10:28,959 INFO L225 Difference]: With dead ends: 146468 [2019-09-10 08:10:28,959 INFO L226 Difference]: Without dead ends: 146468 [2019-09-10 08:10:28,961 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:10:29,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146468 states. [2019-09-10 08:10:30,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146468 to 146468. [2019-09-10 08:10:30,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146468 states. [2019-09-10 08:10:30,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146468 states to 146468 states and 218274 transitions. [2019-09-10 08:10:30,931 INFO L78 Accepts]: Start accepts. Automaton has 146468 states and 218274 transitions. Word has length 208 [2019-09-10 08:10:30,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:10:30,932 INFO L475 AbstractCegarLoop]: Abstraction has 146468 states and 218274 transitions. [2019-09-10 08:10:30,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:10:30,933 INFO L276 IsEmpty]: Start isEmpty. Operand 146468 states and 218274 transitions. [2019-09-10 08:10:31,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-10 08:10:31,066 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:10:31,067 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:10:31,067 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:10:31,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:10:31,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1401934911, now seen corresponding path program 1 times [2019-09-10 08:10:31,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:10:31,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:31,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:10:31,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:31,069 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:10:31,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:10:31,611 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:10:31,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:10:31,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:10:31,612 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:10:31,613 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:10:31,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:10:31,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:10:31,613 INFO L87 Difference]: Start difference. First operand 146468 states and 218274 transitions. Second operand 5 states. [2019-09-10 08:10:32,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:10:32,153 INFO L93 Difference]: Finished difference Result 73666 states and 109570 transitions. [2019-09-10 08:10:32,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:10:32,154 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 208 [2019-09-10 08:10:32,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:10:32,233 INFO L225 Difference]: With dead ends: 73666 [2019-09-10 08:10:32,233 INFO L226 Difference]: Without dead ends: 73666 [2019-09-10 08:10:32,234 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:10:32,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73666 states. [2019-09-10 08:10:32,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73666 to 73666. [2019-09-10 08:10:32,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73666 states. [2019-09-10 08:10:33,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73666 states to 73666 states and 109570 transitions. [2019-09-10 08:10:33,048 INFO L78 Accepts]: Start accepts. Automaton has 73666 states and 109570 transitions. Word has length 208 [2019-09-10 08:10:33,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:10:33,049 INFO L475 AbstractCegarLoop]: Abstraction has 73666 states and 109570 transitions. [2019-09-10 08:10:33,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:10:33,049 INFO L276 IsEmpty]: Start isEmpty. Operand 73666 states and 109570 transitions. [2019-09-10 08:10:33,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-10 08:10:33,117 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:10:33,117 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:10:33,117 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:10:33,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:10:33,118 INFO L82 PathProgramCache]: Analyzing trace with hash 653760604, now seen corresponding path program 1 times [2019-09-10 08:10:33,118 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:10:33,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:33,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:10:33,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:33,120 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:10:33,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:10:33,235 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:10:33,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:10:33,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:10:33,236 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:10:33,236 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:10:33,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:10:33,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:10:33,237 INFO L87 Difference]: Start difference. First operand 73666 states and 109570 transitions. Second operand 3 states. [2019-09-10 08:10:33,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:10:33,618 INFO L93 Difference]: Finished difference Result 48416 states and 71495 transitions. [2019-09-10 08:10:33,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:10:33,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 208 [2019-09-10 08:10:33,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:10:33,671 INFO L225 Difference]: With dead ends: 48416 [2019-09-10 08:10:33,672 INFO L226 Difference]: Without dead ends: 48416 [2019-09-10 08:10:33,674 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:10:33,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48416 states. [2019-09-10 08:10:34,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48416 to 48414. [2019-09-10 08:10:34,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48414 states. [2019-09-10 08:10:34,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48414 states to 48414 states and 71494 transitions. [2019-09-10 08:10:34,286 INFO L78 Accepts]: Start accepts. Automaton has 48414 states and 71494 transitions. Word has length 208 [2019-09-10 08:10:34,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:10:34,286 INFO L475 AbstractCegarLoop]: Abstraction has 48414 states and 71494 transitions. [2019-09-10 08:10:34,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:10:34,286 INFO L276 IsEmpty]: Start isEmpty. Operand 48414 states and 71494 transitions. [2019-09-10 08:10:34,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-10 08:10:34,319 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:10:34,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:34,319 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:10:34,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:10:34,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1860490876, now seen corresponding path program 1 times [2019-09-10 08:10:34,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:10:34,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:34,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:10:34,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:34,321 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:10:34,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:10:34,530 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:10:34,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:10:34,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:10:34,532 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:10:34,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:10:34,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:10:34,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:10:34,533 INFO L87 Difference]: Start difference. First operand 48414 states and 71494 transitions. Second operand 8 states. [2019-09-10 08:10:36,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:10:36,672 INFO L93 Difference]: Finished difference Result 432096 states and 627987 transitions. [2019-09-10 08:10:36,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:10:36,673 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 208 [2019-09-10 08:10:36,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:10:37,084 INFO L225 Difference]: With dead ends: 432096 [2019-09-10 08:10:37,084 INFO L226 Difference]: Without dead ends: 432096 [2019-09-10 08:10:37,084 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:10:37,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432096 states. [2019-09-10 08:10:42,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432096 to 142692. [2019-09-10 08:10:42,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142692 states. [2019-09-10 08:10:42,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142692 states to 142692 states and 208096 transitions. [2019-09-10 08:10:42,208 INFO L78 Accepts]: Start accepts. Automaton has 142692 states and 208096 transitions. Word has length 208 [2019-09-10 08:10:42,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:10:42,208 INFO L475 AbstractCegarLoop]: Abstraction has 142692 states and 208096 transitions. [2019-09-10 08:10:42,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:10:42,208 INFO L276 IsEmpty]: Start isEmpty. Operand 142692 states and 208096 transitions. [2019-09-10 08:10:42,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-10 08:10:42,320 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:10:42,321 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:10:42,321 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:10:42,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:10:42,321 INFO L82 PathProgramCache]: Analyzing trace with hash 269574654, now seen corresponding path program 1 times [2019-09-10 08:10:42,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:10:42,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:42,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:10:42,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:42,323 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:10:42,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:10:42,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:10:42,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:10:42,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:10:42,906 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:10:42,906 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:10:42,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:10:42,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:10:42,907 INFO L87 Difference]: Start difference. First operand 142692 states and 208096 transitions. Second operand 3 states. [2019-09-10 08:10:43,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:10:43,264 INFO L93 Difference]: Finished difference Result 174562 states and 251989 transitions. [2019-09-10 08:10:43,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:10:43,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2019-09-10 08:10:43,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:10:43,412 INFO L225 Difference]: With dead ends: 174562 [2019-09-10 08:10:43,413 INFO L226 Difference]: Without dead ends: 174562 [2019-09-10 08:10:43,413 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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:10:43,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174562 states. [2019-09-10 08:10:45,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174562 to 174560. [2019-09-10 08:10:45,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174560 states. [2019-09-10 08:10:46,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174560 states to 174560 states and 251988 transitions. [2019-09-10 08:10:46,114 INFO L78 Accepts]: Start accepts. Automaton has 174560 states and 251988 transitions. Word has length 212 [2019-09-10 08:10:46,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:10:46,115 INFO L475 AbstractCegarLoop]: Abstraction has 174560 states and 251988 transitions. [2019-09-10 08:10:46,115 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:10:46,115 INFO L276 IsEmpty]: Start isEmpty. Operand 174560 states and 251988 transitions. [2019-09-10 08:10:46,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-10 08:10:46,226 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:10:46,226 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:10:46,227 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:10:46,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:10:46,227 INFO L82 PathProgramCache]: Analyzing trace with hash -704600929, now seen corresponding path program 1 times [2019-09-10 08:10:46,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:10:46,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:46,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:10:46,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:46,228 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:10:46,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:10:46,366 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:10:46,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:10:46,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:10:46,367 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:10:46,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:10:46,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:10:46,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:10:46,369 INFO L87 Difference]: Start difference. First operand 174560 states and 251988 transitions. Second operand 3 states. [2019-09-10 08:10:46,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:10:46,668 INFO L93 Difference]: Finished difference Result 88034 states and 126133 transitions. [2019-09-10 08:10:46,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:10:46,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2019-09-10 08:10:46,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:10:46,777 INFO L225 Difference]: With dead ends: 88034 [2019-09-10 08:10:46,777 INFO L226 Difference]: Without dead ends: 88034 [2019-09-10 08:10:46,777 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:10:46,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88034 states. [2019-09-10 08:10:48,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88034 to 88032. [2019-09-10 08:10:48,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88032 states. [2019-09-10 08:10:48,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88032 states to 88032 states and 126132 transitions. [2019-09-10 08:10:48,516 INFO L78 Accepts]: Start accepts. Automaton has 88032 states and 126132 transitions. Word has length 212 [2019-09-10 08:10:48,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:10:48,516 INFO L475 AbstractCegarLoop]: Abstraction has 88032 states and 126132 transitions. [2019-09-10 08:10:48,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:10:48,516 INFO L276 IsEmpty]: Start isEmpty. Operand 88032 states and 126132 transitions. [2019-09-10 08:10:48,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-10 08:10:48,570 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:10:48,570 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:10:48,571 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:10:48,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:10:48,571 INFO L82 PathProgramCache]: Analyzing trace with hash 444335492, now seen corresponding path program 1 times [2019-09-10 08:10:48,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:10:48,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:48,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:10:48,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:48,573 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:10:48,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:10:48,782 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:10:48,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:10:48,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:10:48,783 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:10:48,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:10:48,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:10:48,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:10:48,784 INFO L87 Difference]: Start difference. First operand 88032 states and 126132 transitions. Second operand 8 states. [2019-09-10 08:10:50,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:10:50,059 INFO L93 Difference]: Finished difference Result 400052 states and 572106 transitions. [2019-09-10 08:10:50,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:10:50,059 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 212 [2019-09-10 08:10:50,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:10:50,471 INFO L225 Difference]: With dead ends: 400052 [2019-09-10 08:10:50,471 INFO L226 Difference]: Without dead ends: 400052 [2019-09-10 08:10:50,471 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:10:50,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400052 states. [2019-09-10 08:10:55,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400052 to 144134. [2019-09-10 08:10:55,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144134 states. [2019-09-10 08:10:55,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144134 states to 144134 states and 205130 transitions. [2019-09-10 08:10:55,361 INFO L78 Accepts]: Start accepts. Automaton has 144134 states and 205130 transitions. Word has length 212 [2019-09-10 08:10:55,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:10:55,361 INFO L475 AbstractCegarLoop]: Abstraction has 144134 states and 205130 transitions. [2019-09-10 08:10:55,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:10:55,362 INFO L276 IsEmpty]: Start isEmpty. Operand 144134 states and 205130 transitions. [2019-09-10 08:10:55,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-10 08:10:55,452 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:10:55,452 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:55,453 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:10:55,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:10:55,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1139261002, now seen corresponding path program 1 times [2019-09-10 08:10:55,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:10:55,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:55,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:10:55,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:55,454 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:10:55,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:10:55,559 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:10:55,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:10:55,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:10:55,560 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:10:55,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:10:55,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:10:55,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:10:55,561 INFO L87 Difference]: Start difference. First operand 144134 states and 205130 transitions. Second operand 3 states. [2019-09-10 08:10:56,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:10:56,038 INFO L93 Difference]: Finished difference Result 72502 states and 102365 transitions. [2019-09-10 08:10:56,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:10:56,039 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2019-09-10 08:10:56,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:10:56,096 INFO L225 Difference]: With dead ends: 72502 [2019-09-10 08:10:56,096 INFO L226 Difference]: Without dead ends: 72502 [2019-09-10 08:10:56,096 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:10:56,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72502 states. [2019-09-10 08:10:56,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72502 to 72500. [2019-09-10 08:10:56,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72500 states. [2019-09-10 08:10:56,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72500 states to 72500 states and 102364 transitions. [2019-09-10 08:10:56,988 INFO L78 Accepts]: Start accepts. Automaton has 72500 states and 102364 transitions. Word has length 212 [2019-09-10 08:10:56,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:10:56,988 INFO L475 AbstractCegarLoop]: Abstraction has 72500 states and 102364 transitions. [2019-09-10 08:10:56,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:10:56,988 INFO L276 IsEmpty]: Start isEmpty. Operand 72500 states and 102364 transitions. [2019-09-10 08:10:57,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-10 08:10:57,032 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:10:57,032 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:10:57,032 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:10:57,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:10:57,033 INFO L82 PathProgramCache]: Analyzing trace with hash -307060370, now seen corresponding path program 1 times [2019-09-10 08:10:57,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:10:57,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:57,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:10:57,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:57,034 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:10:57,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:10:57,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:10:57,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:10:57,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:10:57,146 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:10:57,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:10:57,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:10:57,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:10:57,147 INFO L87 Difference]: Start difference. First operand 72500 states and 102364 transitions. Second operand 3 states. [2019-09-10 08:10:57,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:10:57,240 INFO L93 Difference]: Finished difference Result 30536 states and 43367 transitions. [2019-09-10 08:10:57,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:10:57,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2019-09-10 08:10:57,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:10:57,271 INFO L225 Difference]: With dead ends: 30536 [2019-09-10 08:10:57,271 INFO L226 Difference]: Without dead ends: 30536 [2019-09-10 08:10:57,272 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:10:57,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30536 states. [2019-09-10 08:10:57,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30536 to 30534. [2019-09-10 08:10:57,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30534 states. [2019-09-10 08:10:57,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30534 states to 30534 states and 43366 transitions. [2019-09-10 08:10:57,574 INFO L78 Accepts]: Start accepts. Automaton has 30534 states and 43366 transitions. Word has length 212 [2019-09-10 08:10:57,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:10:57,575 INFO L475 AbstractCegarLoop]: Abstraction has 30534 states and 43366 transitions. [2019-09-10 08:10:57,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:10:57,575 INFO L276 IsEmpty]: Start isEmpty. Operand 30534 states and 43366 transitions. [2019-09-10 08:10:57,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-10 08:10:57,592 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:10:57,592 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:10:57,592 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:10:57,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:10:57,593 INFO L82 PathProgramCache]: Analyzing trace with hash -652693046, now seen corresponding path program 1 times [2019-09-10 08:10:57,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:10:57,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:57,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:10:57,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:57,594 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:10:57,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:10:58,200 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:10:58,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:10:58,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:10:58,200 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:10:58,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:10:58,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:10:58,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:10:58,202 INFO L87 Difference]: Start difference. First operand 30534 states and 43366 transitions. Second operand 8 states. [2019-09-10 08:10:58,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:10:58,785 INFO L93 Difference]: Finished difference Result 69514 states and 98748 transitions. [2019-09-10 08:10:58,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:10:58,787 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 212 [2019-09-10 08:10:58,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:10:58,844 INFO L225 Difference]: With dead ends: 69514 [2019-09-10 08:10:58,844 INFO L226 Difference]: Without dead ends: 69514 [2019-09-10 08:10:58,844 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:10:58,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69514 states. [2019-09-10 08:10:59,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69514 to 42454. [2019-09-10 08:10:59,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42454 states. [2019-09-10 08:10:59,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42454 states to 42454 states and 60134 transitions. [2019-09-10 08:10:59,438 INFO L78 Accepts]: Start accepts. Automaton has 42454 states and 60134 transitions. Word has length 212 [2019-09-10 08:10:59,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:10:59,439 INFO L475 AbstractCegarLoop]: Abstraction has 42454 states and 60134 transitions. [2019-09-10 08:10:59,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:10:59,439 INFO L276 IsEmpty]: Start isEmpty. Operand 42454 states and 60134 transitions. [2019-09-10 08:10:59,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-10 08:10:59,463 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:10:59,463 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:10:59,464 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:10:59,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:10:59,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1848208190, now seen corresponding path program 1 times [2019-09-10 08:10:59,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:10:59,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:59,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:10:59,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:59,465 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:10:59,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:10:59,700 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:10:59,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:10:59,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:10:59,700 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:10:59,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:10:59,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:10:59,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:10:59,701 INFO L87 Difference]: Start difference. First operand 42454 states and 60134 transitions. Second operand 8 states. [2019-09-10 08:11:00,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:00,262 INFO L93 Difference]: Finished difference Result 81434 states and 115516 transitions. [2019-09-10 08:11:00,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:11:00,262 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 212 [2019-09-10 08:11:00,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:00,328 INFO L225 Difference]: With dead ends: 81434 [2019-09-10 08:11:00,328 INFO L226 Difference]: Without dead ends: 81434 [2019-09-10 08:11:00,328 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:11:00,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81434 states. [2019-09-10 08:11:01,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81434 to 54278. [2019-09-10 08:11:01,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54278 states. [2019-09-10 08:11:01,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54278 states to 54278 states and 76758 transitions. [2019-09-10 08:11:01,210 INFO L78 Accepts]: Start accepts. Automaton has 54278 states and 76758 transitions. Word has length 212 [2019-09-10 08:11:01,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:01,210 INFO L475 AbstractCegarLoop]: Abstraction has 54278 states and 76758 transitions. [2019-09-10 08:11:01,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:11:01,211 INFO L276 IsEmpty]: Start isEmpty. Operand 54278 states and 76758 transitions. [2019-09-10 08:11:01,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-10 08:11:01,241 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:01,241 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:11:01,242 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:01,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:01,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1701657416, now seen corresponding path program 1 times [2019-09-10 08:11:01,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:01,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:01,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:01,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:01,244 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:01,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:01,761 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:11:01,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:01,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:11:01,764 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:01,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:11:01,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:11:01,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:11:01,767 INFO L87 Difference]: Start difference. First operand 54278 states and 76758 transitions. Second operand 8 states. [2019-09-10 08:11:02,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:02,482 INFO L93 Difference]: Finished difference Result 59826 states and 84608 transitions. [2019-09-10 08:11:02,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:11:02,483 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 212 [2019-09-10 08:11:02,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:02,530 INFO L225 Difference]: With dead ends: 59826 [2019-09-10 08:11:02,530 INFO L226 Difference]: Without dead ends: 59826 [2019-09-10 08:11:02,531 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-09-10 08:11:02,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59826 states. [2019-09-10 08:11:03,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59826 to 54278. [2019-09-10 08:11:03,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54278 states. [2019-09-10 08:11:03,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54278 states to 54278 states and 76594 transitions. [2019-09-10 08:11:03,063 INFO L78 Accepts]: Start accepts. Automaton has 54278 states and 76594 transitions. Word has length 212 [2019-09-10 08:11:03,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:03,064 INFO L475 AbstractCegarLoop]: Abstraction has 54278 states and 76594 transitions. [2019-09-10 08:11:03,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:11:03,064 INFO L276 IsEmpty]: Start isEmpty. Operand 54278 states and 76594 transitions. [2019-09-10 08:11:03,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-09-10 08:11:03,096 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:03,096 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:11:03,096 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:03,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:03,096 INFO L82 PathProgramCache]: Analyzing trace with hash 2121254364, now seen corresponding path program 1 times [2019-09-10 08:11:03,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:03,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:03,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:03,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:03,098 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:03,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:03,335 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:11:03,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:03,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:11:03,336 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:03,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:11:03,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:11:03,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:11:03,337 INFO L87 Difference]: Start difference. First operand 54278 states and 76594 transitions. Second operand 8 states. [2019-09-10 08:11:03,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:03,962 INFO L93 Difference]: Finished difference Result 91754 states and 129924 transitions. [2019-09-10 08:11:03,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:11:03,963 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 213 [2019-09-10 08:11:03,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:04,038 INFO L225 Difference]: With dead ends: 91754 [2019-09-10 08:11:04,038 INFO L226 Difference]: Without dead ends: 91754 [2019-09-10 08:11:04,038 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:11:04,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91754 states. [2019-09-10 08:11:04,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91754 to 64574. [2019-09-10 08:11:04,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64574 states. [2019-09-10 08:11:05,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64574 states to 64574 states and 91130 transitions. [2019-09-10 08:11:05,056 INFO L78 Accepts]: Start accepts. Automaton has 64574 states and 91130 transitions. Word has length 213 [2019-09-10 08:11:05,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:05,057 INFO L475 AbstractCegarLoop]: Abstraction has 64574 states and 91130 transitions. [2019-09-10 08:11:05,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:11:05,057 INFO L276 IsEmpty]: Start isEmpty. Operand 64574 states and 91130 transitions. [2019-09-10 08:11:05,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-09-10 08:11:05,107 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:05,108 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:11:05,108 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:05,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:05,108 INFO L82 PathProgramCache]: Analyzing trace with hash 202619752, now seen corresponding path program 1 times [2019-09-10 08:11:05,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:05,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:05,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:05,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:05,110 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:05,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:05,339 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:11:05,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:05,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:11:05,339 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:05,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:11:05,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:11:05,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:11:05,341 INFO L87 Difference]: Start difference. First operand 64574 states and 91130 transitions. Second operand 8 states. [2019-09-10 08:11:06,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:06,188 INFO L93 Difference]: Finished difference Result 103554 states and 146512 transitions. [2019-09-10 08:11:06,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:11:06,188 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 213 [2019-09-10 08:11:06,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:06,273 INFO L225 Difference]: With dead ends: 103554 [2019-09-10 08:11:06,273 INFO L226 Difference]: Without dead ends: 103554 [2019-09-10 08:11:06,274 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-09-10 08:11:06,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103554 states. [2019-09-10 08:11:07,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103554 to 76494. [2019-09-10 08:11:07,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76494 states. [2019-09-10 08:11:07,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76494 states to 76494 states and 107898 transitions. [2019-09-10 08:11:07,461 INFO L78 Accepts]: Start accepts. Automaton has 76494 states and 107898 transitions. Word has length 213 [2019-09-10 08:11:07,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:07,461 INFO L475 AbstractCegarLoop]: Abstraction has 76494 states and 107898 transitions. [2019-09-10 08:11:07,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:11:07,461 INFO L276 IsEmpty]: Start isEmpty. Operand 76494 states and 107898 transitions. [2019-09-10 08:11:07,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-09-10 08:11:07,508 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:07,508 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:11:07,508 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:07,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:07,508 INFO L82 PathProgramCache]: Analyzing trace with hash 940546938, now seen corresponding path program 1 times [2019-09-10 08:11:07,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:07,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:07,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:07,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:07,510 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:07,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:07,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:11:07,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:07,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:11:07,728 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:07,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:11:07,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:11:07,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:11:07,729 INFO L87 Difference]: Start difference. First operand 76494 states and 107898 transitions. Second operand 8 states. [2019-09-10 08:11:08,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:08,596 INFO L93 Difference]: Finished difference Result 123608 states and 175534 transitions. [2019-09-10 08:11:08,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:11:08,596 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 213 [2019-09-10 08:11:08,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:08,709 INFO L225 Difference]: With dead ends: 123608 [2019-09-10 08:11:08,709 INFO L226 Difference]: Without dead ends: 123608 [2019-09-10 08:11:08,710 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:11:08,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123608 states. [2019-09-10 08:11:10,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123608 to 81690. [2019-09-10 08:11:10,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81690 states. [2019-09-10 08:11:10,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81690 states to 81690 states and 115322 transitions. [2019-09-10 08:11:10,394 INFO L78 Accepts]: Start accepts. Automaton has 81690 states and 115322 transitions. Word has length 213 [2019-09-10 08:11:10,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:10,394 INFO L475 AbstractCegarLoop]: Abstraction has 81690 states and 115322 transitions. [2019-09-10 08:11:10,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:11:10,394 INFO L276 IsEmpty]: Start isEmpty. Operand 81690 states and 115322 transitions. [2019-09-10 08:11:10,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-09-10 08:11:10,445 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:10,446 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:10,446 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:10,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:10,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1430789519, now seen corresponding path program 1 times [2019-09-10 08:11:10,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:10,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:10,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:10,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:10,447 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:10,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:10,738 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:11:10,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:10,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:11:10,739 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:10,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:11:10,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:11:10,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:11:10,740 INFO L87 Difference]: Start difference. First operand 81690 states and 115322 transitions. Second operand 10 states. [2019-09-10 08:11:14,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:14,226 INFO L93 Difference]: Finished difference Result 591746 states and 832946 transitions. [2019-09-10 08:11:14,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 08:11:14,227 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 215 [2019-09-10 08:11:14,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:14,838 INFO L225 Difference]: With dead ends: 591746 [2019-09-10 08:11:14,838 INFO L226 Difference]: Without dead ends: 591746 [2019-09-10 08:11:14,839 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=266, Invalid=790, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 08:11:15,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591746 states. [2019-09-10 08:11:21,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591746 to 149324. [2019-09-10 08:11:21,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149324 states. [2019-09-10 08:11:21,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149324 states to 149324 states and 210048 transitions. [2019-09-10 08:11:21,954 INFO L78 Accepts]: Start accepts. Automaton has 149324 states and 210048 transitions. Word has length 215 [2019-09-10 08:11:21,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:21,954 INFO L475 AbstractCegarLoop]: Abstraction has 149324 states and 210048 transitions. [2019-09-10 08:11:21,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:11:21,954 INFO L276 IsEmpty]: Start isEmpty. Operand 149324 states and 210048 transitions. [2019-09-10 08:11:22,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-09-10 08:11:22,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:22,041 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:22,041 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:22,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:22,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1674445669, now seen corresponding path program 1 times [2019-09-10 08:11:22,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:22,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:22,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:22,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:22,043 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:22,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:22,342 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:11:22,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:22,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:11:22,342 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:22,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:11:22,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:11:22,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:11:22,343 INFO L87 Difference]: Start difference. First operand 149324 states and 210048 transitions. Second operand 10 states. [2019-09-10 08:11:27,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:27,005 INFO L93 Difference]: Finished difference Result 827097 states and 1163866 transitions. [2019-09-10 08:11:27,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 08:11:27,006 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 215 [2019-09-10 08:11:27,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:27,926 INFO L225 Difference]: With dead ends: 827097 [2019-09-10 08:11:27,926 INFO L226 Difference]: Without dead ends: 827097 [2019-09-10 08:11:27,927 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=293, Invalid=897, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 08:11:28,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827097 states. [2019-09-10 08:11:38,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827097 to 143955. [2019-09-10 08:11:38,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143955 states. [2019-09-10 08:11:38,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143955 states to 143955 states and 202310 transitions. [2019-09-10 08:11:38,437 INFO L78 Accepts]: Start accepts. Automaton has 143955 states and 202310 transitions. Word has length 215 [2019-09-10 08:11:38,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:38,437 INFO L475 AbstractCegarLoop]: Abstraction has 143955 states and 202310 transitions. [2019-09-10 08:11:38,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:11:38,437 INFO L276 IsEmpty]: Start isEmpty. Operand 143955 states and 202310 transitions. [2019-09-10 08:11:39,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-09-10 08:11:39,154 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:39,154 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:39,154 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:39,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:39,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1606591339, now seen corresponding path program 1 times [2019-09-10 08:11:39,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:39,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:39,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:39,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:39,156 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:39,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:39,584 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:11:39,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:39,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 08:11:39,585 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:39,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 08:11:39,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 08:11:39,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:11:39,586 INFO L87 Difference]: Start difference. First operand 143955 states and 202310 transitions. Second operand 14 states. [2019-09-10 08:11:45,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:45,128 INFO L93 Difference]: Finished difference Result 550632 states and 769602 transitions. [2019-09-10 08:11:45,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 08:11:45,128 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 215 [2019-09-10 08:11:45,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:45,652 INFO L225 Difference]: With dead ends: 550632 [2019-09-10 08:11:45,652 INFO L226 Difference]: Without dead ends: 550632 [2019-09-10 08:11:45,653 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=289, Invalid=971, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 08:11:45,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550632 states. [2019-09-10 08:11:54,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550632 to 144269. [2019-09-10 08:11:54,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144269 states. [2019-09-10 08:11:54,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144269 states to 144269 states and 202690 transitions. [2019-09-10 08:11:54,298 INFO L78 Accepts]: Start accepts. Automaton has 144269 states and 202690 transitions. Word has length 215 [2019-09-10 08:11:54,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:54,298 INFO L475 AbstractCegarLoop]: Abstraction has 144269 states and 202690 transitions. [2019-09-10 08:11:54,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 08:11:54,298 INFO L276 IsEmpty]: Start isEmpty. Operand 144269 states and 202690 transitions. [2019-09-10 08:11:54,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-09-10 08:11:54,379 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:54,379 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:54,379 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:54,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:54,380 INFO L82 PathProgramCache]: Analyzing trace with hash 328296319, now seen corresponding path program 1 times [2019-09-10 08:11:54,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:54,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:54,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:54,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:54,381 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:54,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:54,483 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:11:54,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:54,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:11:54,483 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:54,484 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:11:54,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:11:54,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:11:54,485 INFO L87 Difference]: Start difference. First operand 144269 states and 202690 transitions. Second operand 3 states. [2019-09-10 08:11:54,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:54,652 INFO L93 Difference]: Finished difference Result 74380 states and 103870 transitions. [2019-09-10 08:11:54,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:11:54,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 215 [2019-09-10 08:11:54,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:55,194 INFO L225 Difference]: With dead ends: 74380 [2019-09-10 08:11:55,194 INFO L226 Difference]: Without dead ends: 74380 [2019-09-10 08:11:55,195 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:11:55,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74380 states. [2019-09-10 08:11:55,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74380 to 74378. [2019-09-10 08:11:55,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74378 states. [2019-09-10 08:11:56,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74378 states to 74378 states and 103869 transitions. [2019-09-10 08:11:56,053 INFO L78 Accepts]: Start accepts. Automaton has 74378 states and 103869 transitions. Word has length 215 [2019-09-10 08:11:56,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:56,053 INFO L475 AbstractCegarLoop]: Abstraction has 74378 states and 103869 transitions. [2019-09-10 08:11:56,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:11:56,054 INFO L276 IsEmpty]: Start isEmpty. Operand 74378 states and 103869 transitions. [2019-09-10 08:11:56,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-09-10 08:11:56,118 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:56,119 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:56,119 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:56,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:56,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1132820967, now seen corresponding path program 1 times [2019-09-10 08:11:56,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:56,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:56,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:56,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:56,123 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:56,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:56,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:11:56,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:56,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:11:56,203 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:56,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:11:56,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:11:56,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:11:56,204 INFO L87 Difference]: Start difference. First operand 74378 states and 103869 transitions. Second operand 3 states. [2019-09-10 08:11:56,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:56,716 INFO L93 Difference]: Finished difference Result 73448 states and 102179 transitions. [2019-09-10 08:11:56,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:11:56,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 216 [2019-09-10 08:11:56,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:56,778 INFO L225 Difference]: With dead ends: 73448 [2019-09-10 08:11:56,778 INFO L226 Difference]: Without dead ends: 73448 [2019-09-10 08:11:56,778 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:11:56,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73448 states. [2019-09-10 08:11:57,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73448 to 73448. [2019-09-10 08:11:57,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73448 states. [2019-09-10 08:11:57,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73448 states to 73448 states and 102179 transitions. [2019-09-10 08:11:57,652 INFO L78 Accepts]: Start accepts. Automaton has 73448 states and 102179 transitions. Word has length 216 [2019-09-10 08:11:57,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:57,652 INFO L475 AbstractCegarLoop]: Abstraction has 73448 states and 102179 transitions. [2019-09-10 08:11:57,652 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:11:57,652 INFO L276 IsEmpty]: Start isEmpty. Operand 73448 states and 102179 transitions. [2019-09-10 08:11:57,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-09-10 08:11:57,697 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:57,697 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:57,698 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:57,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:57,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1194416177, now seen corresponding path program 1 times [2019-09-10 08:11:57,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:57,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:57,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:57,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:57,699 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:57,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:58,563 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:11:58,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:58,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 08:11:58,566 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:58,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:11:58,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:11:58,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:11:58,568 INFO L87 Difference]: Start difference. First operand 73448 states and 102179 transitions. Second operand 12 states. [2019-09-10 08:12:02,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:02,503 INFO L93 Difference]: Finished difference Result 279877 states and 389807 transitions. [2019-09-10 08:12:02,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 08:12:02,503 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 216 [2019-09-10 08:12:02,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:03,239 INFO L225 Difference]: With dead ends: 279877 [2019-09-10 08:12:03,239 INFO L226 Difference]: Without dead ends: 279877 [2019-09-10 08:12:03,240 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=293, Invalid=763, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 08:12:03,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279877 states. [2019-09-10 08:12:07,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279877 to 82918. [2019-09-10 08:12:07,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82918 states. [2019-09-10 08:12:07,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82918 states to 82918 states and 114195 transitions. [2019-09-10 08:12:07,798 INFO L78 Accepts]: Start accepts. Automaton has 82918 states and 114195 transitions. Word has length 216 [2019-09-10 08:12:07,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:07,799 INFO L475 AbstractCegarLoop]: Abstraction has 82918 states and 114195 transitions. [2019-09-10 08:12:07,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:12:07,799 INFO L276 IsEmpty]: Start isEmpty. Operand 82918 states and 114195 transitions. [2019-09-10 08:12:07,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-09-10 08:12:07,844 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:07,844 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:07,844 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:07,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:07,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1630308617, now seen corresponding path program 1 times [2019-09-10 08:12:07,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:07,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:07,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:07,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:07,846 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:07,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:08,338 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:12:08,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:08,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 08:12:08,339 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:08,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:12:08,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:12:08,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:12:08,340 INFO L87 Difference]: Start difference. First operand 82918 states and 114195 transitions. Second operand 12 states. [2019-09-10 08:12:11,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:11,353 INFO L93 Difference]: Finished difference Result 256257 states and 354809 transitions. [2019-09-10 08:12:11,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:12:11,353 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 216 [2019-09-10 08:12:11,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:12,092 INFO L225 Difference]: With dead ends: 256257 [2019-09-10 08:12:12,092 INFO L226 Difference]: Without dead ends: 256257 [2019-09-10 08:12:12,092 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=159, Invalid=441, Unknown=0, NotChecked=0, Total=600 [2019-09-10 08:12:12,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256257 states. [2019-09-10 08:12:15,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256257 to 110347. [2019-09-10 08:12:15,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110347 states. [2019-09-10 08:12:15,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110347 states to 110347 states and 150310 transitions. [2019-09-10 08:12:15,216 INFO L78 Accepts]: Start accepts. Automaton has 110347 states and 150310 transitions. Word has length 216 [2019-09-10 08:12:15,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:15,216 INFO L475 AbstractCegarLoop]: Abstraction has 110347 states and 150310 transitions. [2019-09-10 08:12:15,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:12:15,217 INFO L276 IsEmpty]: Start isEmpty. Operand 110347 states and 150310 transitions. [2019-09-10 08:12:15,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-09-10 08:12:15,288 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:15,288 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:15,289 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:15,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:15,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1719729708, now seen corresponding path program 1 times [2019-09-10 08:12:15,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:15,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:15,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:15,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:15,290 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:15,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:15,386 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:12:15,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:15,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:12:15,386 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:15,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:12:15,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:12:15,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:12:15,388 INFO L87 Difference]: Start difference. First operand 110347 states and 150310 transitions. Second operand 4 states. [2019-09-10 08:12:16,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:16,069 INFO L93 Difference]: Finished difference Result 173069 states and 237437 transitions. [2019-09-10 08:12:16,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:12:16,069 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 216 [2019-09-10 08:12:16,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:16,229 INFO L225 Difference]: With dead ends: 173069 [2019-09-10 08:12:16,230 INFO L226 Difference]: Without dead ends: 173069 [2019-09-10 08:12:16,230 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:12:16,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173069 states. [2019-09-10 08:12:18,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173069 to 86323. [2019-09-10 08:12:18,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86323 states. [2019-09-10 08:12:19,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86323 states to 86323 states and 118586 transitions. [2019-09-10 08:12:19,085 INFO L78 Accepts]: Start accepts. Automaton has 86323 states and 118586 transitions. Word has length 216 [2019-09-10 08:12:19,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:19,086 INFO L475 AbstractCegarLoop]: Abstraction has 86323 states and 118586 transitions. [2019-09-10 08:12:19,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:12:19,086 INFO L276 IsEmpty]: Start isEmpty. Operand 86323 states and 118586 transitions. [2019-09-10 08:12:19,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-09-10 08:12:19,133 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:19,133 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:19,133 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:19,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:19,134 INFO L82 PathProgramCache]: Analyzing trace with hash 354699572, now seen corresponding path program 1 times [2019-09-10 08:12:19,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:19,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:19,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:19,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:19,135 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:19,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:19,548 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:12:19,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:19,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 08:12:19,549 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:19,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:12:19,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:12:19,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:12:19,549 INFO L87 Difference]: Start difference. First operand 86323 states and 118586 transitions. Second operand 12 states. [2019-09-10 08:12:24,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:24,468 INFO L93 Difference]: Finished difference Result 312909 states and 430151 transitions. [2019-09-10 08:12:24,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 08:12:24,468 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 216 [2019-09-10 08:12:24,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:24,761 INFO L225 Difference]: With dead ends: 312909 [2019-09-10 08:12:24,761 INFO L226 Difference]: Without dead ends: 312909 [2019-09-10 08:12:24,762 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=287, Invalid=769, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 08:12:24,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312909 states. [2019-09-10 08:12:30,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312909 to 113291. [2019-09-10 08:12:30,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113291 states. [2019-09-10 08:12:30,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113291 states to 113291 states and 153254 transitions. [2019-09-10 08:12:30,157 INFO L78 Accepts]: Start accepts. Automaton has 113291 states and 153254 transitions. Word has length 216 [2019-09-10 08:12:30,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:30,158 INFO L475 AbstractCegarLoop]: Abstraction has 113291 states and 153254 transitions. [2019-09-10 08:12:30,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:12:30,158 INFO L276 IsEmpty]: Start isEmpty. Operand 113291 states and 153254 transitions. [2019-09-10 08:12:30,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-09-10 08:12:30,223 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:30,223 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:30,223 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:30,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:30,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1793956816, now seen corresponding path program 1 times [2019-09-10 08:12:30,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:30,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:30,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:30,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:30,225 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:30,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:30,695 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:12:30,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:30,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 08:12:30,695 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:30,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 08:12:30,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 08:12:30,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:12:30,697 INFO L87 Difference]: Start difference. First operand 113291 states and 153254 transitions. Second operand 14 states. [2019-09-10 08:12:35,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:35,456 INFO L93 Difference]: Finished difference Result 477872 states and 652066 transitions. [2019-09-10 08:12:35,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 08:12:35,457 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 216 [2019-09-10 08:12:35,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:35,930 INFO L225 Difference]: With dead ends: 477872 [2019-09-10 08:12:35,931 INFO L226 Difference]: Without dead ends: 477872 [2019-09-10 08:12:35,931 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=346, Invalid=986, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 08:12:36,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477872 states. [2019-09-10 08:12:43,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477872 to 111777. [2019-09-10 08:12:43,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111777 states. [2019-09-10 08:12:43,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111777 states to 111777 states and 151006 transitions. [2019-09-10 08:12:43,991 INFO L78 Accepts]: Start accepts. Automaton has 111777 states and 151006 transitions. Word has length 216 [2019-09-10 08:12:43,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:43,992 INFO L475 AbstractCegarLoop]: Abstraction has 111777 states and 151006 transitions. [2019-09-10 08:12:43,992 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 08:12:43,992 INFO L276 IsEmpty]: Start isEmpty. Operand 111777 states and 151006 transitions. [2019-09-10 08:12:44,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 08:12:44,060 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:44,060 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:44,060 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:44,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:44,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1835503925, now seen corresponding path program 1 times [2019-09-10 08:12:44,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:44,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:44,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:44,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:44,062 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:44,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:44,152 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:12:44,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:44,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:12:44,153 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:44,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:12:44,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:12:44,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:12:44,154 INFO L87 Difference]: Start difference. First operand 111777 states and 151006 transitions. Second operand 4 states. [2019-09-10 08:12:44,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:44,745 INFO L93 Difference]: Finished difference Result 163535 states and 222201 transitions. [2019-09-10 08:12:44,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:12:44,745 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 217 [2019-09-10 08:12:44,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:44,878 INFO L225 Difference]: With dead ends: 163535 [2019-09-10 08:12:44,878 INFO L226 Difference]: Without dead ends: 163535 [2019-09-10 08:12:44,878 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:12:44,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163535 states. [2019-09-10 08:12:46,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163535 to 101609. [2019-09-10 08:12:46,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101609 states. [2019-09-10 08:12:46,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101609 states to 101609 states and 137082 transitions. [2019-09-10 08:12:46,885 INFO L78 Accepts]: Start accepts. Automaton has 101609 states and 137082 transitions. Word has length 217 [2019-09-10 08:12:46,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:46,886 INFO L475 AbstractCegarLoop]: Abstraction has 101609 states and 137082 transitions. [2019-09-10 08:12:46,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:12:46,886 INFO L276 IsEmpty]: Start isEmpty. Operand 101609 states and 137082 transitions. [2019-09-10 08:12:47,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 08:12:47,408 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:47,408 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:47,408 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:47,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:47,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1132078182, now seen corresponding path program 1 times [2019-09-10 08:12:47,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:47,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:47,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:47,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:47,410 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:47,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:47,870 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:12:47,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:47,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:12:47,870 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:47,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:12:47,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:12:47,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:12:47,872 INFO L87 Difference]: Start difference. First operand 101609 states and 137082 transitions. Second operand 10 states. [2019-09-10 08:12:50,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:50,783 INFO L93 Difference]: Finished difference Result 280927 states and 384850 transitions. [2019-09-10 08:12:50,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 08:12:50,783 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 217 [2019-09-10 08:12:50,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:51,036 INFO L225 Difference]: With dead ends: 280927 [2019-09-10 08:12:51,037 INFO L226 Difference]: Without dead ends: 280927 [2019-09-10 08:12:51,037 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=266, Invalid=790, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 08:12:51,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280927 states. [2019-09-10 08:12:55,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280927 to 105065. [2019-09-10 08:12:55,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105065 states. [2019-09-10 08:12:55,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105065 states to 105065 states and 141578 transitions. [2019-09-10 08:12:55,610 INFO L78 Accepts]: Start accepts. Automaton has 105065 states and 141578 transitions. Word has length 217 [2019-09-10 08:12:55,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:55,610 INFO L475 AbstractCegarLoop]: Abstraction has 105065 states and 141578 transitions. [2019-09-10 08:12:55,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:12:55,610 INFO L276 IsEmpty]: Start isEmpty. Operand 105065 states and 141578 transitions. [2019-09-10 08:12:56,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 08:12:56,007 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:56,007 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:56,007 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:56,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:56,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1623152612, now seen corresponding path program 1 times [2019-09-10 08:12:56,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:56,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:56,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:56,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:56,009 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:56,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:56,103 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:12:56,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:56,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:12:56,103 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:56,104 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:12:56,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:12:56,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:12:56,104 INFO L87 Difference]: Start difference. First operand 105065 states and 141578 transitions. Second operand 3 states. [2019-09-10 08:12:56,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:56,273 INFO L93 Difference]: Finished difference Result 60359 states and 80019 transitions. [2019-09-10 08:12:56,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:12:56,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2019-09-10 08:12:56,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:56,331 INFO L225 Difference]: With dead ends: 60359 [2019-09-10 08:12:56,331 INFO L226 Difference]: Without dead ends: 60359 [2019-09-10 08:12:56,331 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:12:56,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60359 states. [2019-09-10 08:12:56,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60359 to 60357. [2019-09-10 08:12:56,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60357 states. [2019-09-10 08:12:56,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60357 states to 60357 states and 80018 transitions. [2019-09-10 08:12:56,949 INFO L78 Accepts]: Start accepts. Automaton has 60357 states and 80018 transitions. Word has length 217 [2019-09-10 08:12:56,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:56,949 INFO L475 AbstractCegarLoop]: Abstraction has 60357 states and 80018 transitions. [2019-09-10 08:12:56,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:12:56,949 INFO L276 IsEmpty]: Start isEmpty. Operand 60357 states and 80018 transitions. [2019-09-10 08:12:56,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 08:12:56,982 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:56,982 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:56,982 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:56,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:56,983 INFO L82 PathProgramCache]: Analyzing trace with hash 791731644, now seen corresponding path program 1 times [2019-09-10 08:12:56,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:56,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:56,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:56,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:56,984 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:57,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:57,221 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:12:57,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:57,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:12:57,222 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:57,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:12:57,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:12:57,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:12:57,222 INFO L87 Difference]: Start difference. First operand 60357 states and 80018 transitions. Second operand 10 states. [2019-09-10 08:12:58,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:58,392 INFO L93 Difference]: Finished difference Result 82951 states and 111363 transitions. [2019-09-10 08:12:58,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 08:12:58,393 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 218 [2019-09-10 08:12:58,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:58,455 INFO L225 Difference]: With dead ends: 82951 [2019-09-10 08:12:58,455 INFO L226 Difference]: Without dead ends: 82951 [2019-09-10 08:12:58,456 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:12:58,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82951 states. [2019-09-10 08:12:59,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82951 to 60225. [2019-09-10 08:12:59,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60225 states. [2019-09-10 08:12:59,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60225 states to 60225 states and 79820 transitions. [2019-09-10 08:12:59,632 INFO L78 Accepts]: Start accepts. Automaton has 60225 states and 79820 transitions. Word has length 218 [2019-09-10 08:12:59,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:59,633 INFO L475 AbstractCegarLoop]: Abstraction has 60225 states and 79820 transitions. [2019-09-10 08:12:59,633 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:12:59,633 INFO L276 IsEmpty]: Start isEmpty. Operand 60225 states and 79820 transitions. [2019-09-10 08:12:59,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 08:12:59,666 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:59,666 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:59,666 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:59,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:59,667 INFO L82 PathProgramCache]: Analyzing trace with hash 2113241776, now seen corresponding path program 1 times [2019-09-10 08:12:59,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:59,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:59,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:59,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:59,668 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:59,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:00,024 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:13:00,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:13:00,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:13:00,024 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:13:00,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:13:00,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:13:00,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:13:00,025 INFO L87 Difference]: Start difference. First operand 60225 states and 79820 transitions. Second operand 10 states. [2019-09-10 08:13:03,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:03,701 INFO L93 Difference]: Finished difference Result 308239 states and 409699 transitions. [2019-09-10 08:13:03,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 08:13:03,701 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 218 [2019-09-10 08:13:03,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:03,958 INFO L225 Difference]: With dead ends: 308239 [2019-09-10 08:13:03,959 INFO L226 Difference]: Without dead ends: 308239 [2019-09-10 08:13:03,959 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=270, Invalid=852, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 08:13:04,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308239 states. [2019-09-10 08:13:07,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308239 to 60447. [2019-09-10 08:13:07,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60447 states. [2019-09-10 08:13:07,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60447 states to 60447 states and 80067 transitions. [2019-09-10 08:13:07,556 INFO L78 Accepts]: Start accepts. Automaton has 60447 states and 80067 transitions. Word has length 218 [2019-09-10 08:13:07,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:07,556 INFO L475 AbstractCegarLoop]: Abstraction has 60447 states and 80067 transitions. [2019-09-10 08:13:07,556 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:13:07,556 INFO L276 IsEmpty]: Start isEmpty. Operand 60447 states and 80067 transitions. [2019-09-10 08:13:07,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-09-10 08:13:07,589 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:07,589 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:07,590 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:07,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:07,590 INFO L82 PathProgramCache]: Analyzing trace with hash -680016769, now seen corresponding path program 1 times [2019-09-10 08:13:07,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:07,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:07,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:07,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:07,591 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:07,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:07,967 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:13:07,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:13:07,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 08:13:07,968 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:13:07,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:13:07,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:13:07,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:13:07,970 INFO L87 Difference]: Start difference. First operand 60447 states and 80067 transitions. Second operand 12 states. [2019-09-10 08:13:10,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:10,841 INFO L93 Difference]: Finished difference Result 160135 states and 215540 transitions. [2019-09-10 08:13:10,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 08:13:10,842 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 219 [2019-09-10 08:13:10,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:10,970 INFO L225 Difference]: With dead ends: 160135 [2019-09-10 08:13:10,970 INFO L226 Difference]: Without dead ends: 160135 [2019-09-10 08:13:10,970 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=286, Invalid=770, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 08:13:11,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160135 states. [2019-09-10 08:13:12,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160135 to 75345. [2019-09-10 08:13:12,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75345 states. [2019-09-10 08:13:12,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75345 states to 75345 states and 99211 transitions. [2019-09-10 08:13:12,753 INFO L78 Accepts]: Start accepts. Automaton has 75345 states and 99211 transitions. Word has length 219 [2019-09-10 08:13:12,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:12,754 INFO L475 AbstractCegarLoop]: Abstraction has 75345 states and 99211 transitions. [2019-09-10 08:13:12,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:13:12,754 INFO L276 IsEmpty]: Start isEmpty. Operand 75345 states and 99211 transitions. [2019-09-10 08:13:12,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-09-10 08:13:12,799 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:12,800 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:12,800 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:12,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:12,800 INFO L82 PathProgramCache]: Analyzing trace with hash 651004301, now seen corresponding path program 1 times [2019-09-10 08:13:12,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:12,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:12,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:12,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:12,801 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:12,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:12,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:13:12,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:13:12,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:13:12,866 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:13:12,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:13:12,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:13:12,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:13:12,867 INFO L87 Difference]: Start difference. First operand 75345 states and 99211 transitions. Second operand 3 states. [2019-09-10 08:13:13,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:13,202 INFO L93 Difference]: Finished difference Result 74541 states and 97501 transitions. [2019-09-10 08:13:13,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:13:13,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 219 [2019-09-10 08:13:13,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:13,279 INFO L225 Difference]: With dead ends: 74541 [2019-09-10 08:13:13,279 INFO L226 Difference]: Without dead ends: 74541 [2019-09-10 08:13:13,279 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:13:13,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74541 states. [2019-09-10 08:13:14,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74541 to 74541. [2019-09-10 08:13:14,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74541 states. [2019-09-10 08:13:14,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74541 states to 74541 states and 97501 transitions. [2019-09-10 08:13:14,385 INFO L78 Accepts]: Start accepts. Automaton has 74541 states and 97501 transitions. Word has length 219 [2019-09-10 08:13:14,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:14,386 INFO L475 AbstractCegarLoop]: Abstraction has 74541 states and 97501 transitions. [2019-09-10 08:13:14,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:13:14,386 INFO L276 IsEmpty]: Start isEmpty. Operand 74541 states and 97501 transitions. [2019-09-10 08:13:14,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-09-10 08:13:14,432 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:14,432 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:14,432 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:14,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:14,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1026049536, now seen corresponding path program 1 times [2019-09-10 08:13:14,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:14,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:14,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:14,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:14,434 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:14,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:14,493 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:13:14,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:13:14,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:13:14,494 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:13:14,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:13:14,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:13:14,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:13:14,495 INFO L87 Difference]: Start difference. First operand 74541 states and 97501 transitions. Second operand 3 states. [2019-09-10 08:13:14,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:14,721 INFO L93 Difference]: Finished difference Result 61623 states and 80724 transitions. [2019-09-10 08:13:14,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:13:14,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 219 [2019-09-10 08:13:14,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:14,768 INFO L225 Difference]: With dead ends: 61623 [2019-09-10 08:13:14,768 INFO L226 Difference]: Without dead ends: 61623 [2019-09-10 08:13:14,769 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:13:14,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61623 states. [2019-09-10 08:13:15,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61623 to 61623. [2019-09-10 08:13:15,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61623 states. [2019-09-10 08:13:15,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61623 states to 61623 states and 80724 transitions. [2019-09-10 08:13:15,380 INFO L78 Accepts]: Start accepts. Automaton has 61623 states and 80724 transitions. Word has length 219 [2019-09-10 08:13:15,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:15,381 INFO L475 AbstractCegarLoop]: Abstraction has 61623 states and 80724 transitions. [2019-09-10 08:13:15,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:13:15,381 INFO L276 IsEmpty]: Start isEmpty. Operand 61623 states and 80724 transitions. [2019-09-10 08:13:15,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-09-10 08:13:15,414 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:15,415 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:15,415 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:15,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:15,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1056421380, now seen corresponding path program 1 times [2019-09-10 08:13:15,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:15,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:15,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:15,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:15,416 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:15,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:15,511 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:13:15,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:13:15,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:13:15,512 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:13:15,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:13:15,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:13:15,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:13:15,513 INFO L87 Difference]: Start difference. First operand 61623 states and 80724 transitions. Second operand 4 states. [2019-09-10 08:13:16,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:16,251 INFO L93 Difference]: Finished difference Result 85769 states and 113563 transitions. [2019-09-10 08:13:16,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:13:16,251 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 220 [2019-09-10 08:13:16,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:16,316 INFO L225 Difference]: With dead ends: 85769 [2019-09-10 08:13:16,316 INFO L226 Difference]: Without dead ends: 85769 [2019-09-10 08:13:16,316 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:13:16,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85769 states. [2019-09-10 08:13:16,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85769 to 61447. [2019-09-10 08:13:16,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61447 states. [2019-09-10 08:13:16,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61447 states to 61447 states and 80548 transitions. [2019-09-10 08:13:16,926 INFO L78 Accepts]: Start accepts. Automaton has 61447 states and 80548 transitions. Word has length 220 [2019-09-10 08:13:16,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:16,926 INFO L475 AbstractCegarLoop]: Abstraction has 61447 states and 80548 transitions. [2019-09-10 08:13:16,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:13:16,926 INFO L276 IsEmpty]: Start isEmpty. Operand 61447 states and 80548 transitions. [2019-09-10 08:13:16,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-09-10 08:13:16,961 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:16,961 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:16,961 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:16,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:16,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1791516321, now seen corresponding path program 1 times [2019-09-10 08:13:16,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:16,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:16,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:16,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:16,962 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:16,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:17,239 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:13:17,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:13:17,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:13:17,240 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:13:17,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:13:17,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:13:17,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:13:17,240 INFO L87 Difference]: Start difference. First operand 61447 states and 80548 transitions. Second operand 10 states. [2019-09-10 08:13:20,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:20,210 INFO L93 Difference]: Finished difference Result 179455 states and 241210 transitions. [2019-09-10 08:13:20,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 08:13:20,210 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 220 [2019-09-10 08:13:20,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:20,350 INFO L225 Difference]: With dead ends: 179455 [2019-09-10 08:13:20,350 INFO L226 Difference]: Without dead ends: 179455 [2019-09-10 08:13:20,350 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=272, Invalid=850, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 08:13:20,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179455 states. [2019-09-10 08:13:21,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179455 to 44134. [2019-09-10 08:13:21,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44134 states. [2019-09-10 08:13:21,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44134 states to 44134 states and 58615 transitions. [2019-09-10 08:13:21,351 INFO L78 Accepts]: Start accepts. Automaton has 44134 states and 58615 transitions. Word has length 220 [2019-09-10 08:13:21,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:21,351 INFO L475 AbstractCegarLoop]: Abstraction has 44134 states and 58615 transitions. [2019-09-10 08:13:21,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:13:21,351 INFO L276 IsEmpty]: Start isEmpty. Operand 44134 states and 58615 transitions. [2019-09-10 08:13:21,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-09-10 08:13:21,371 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:21,372 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:21,372 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:21,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:21,372 INFO L82 PathProgramCache]: Analyzing trace with hash 70375717, now seen corresponding path program 1 times [2019-09-10 08:13:21,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:21,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:21,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:21,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:21,373 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:21,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:21,606 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:13:21,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:13:21,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:13:21,607 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:13:21,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:13:21,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:13:21,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:13:21,608 INFO L87 Difference]: Start difference. First operand 44134 states and 58615 transitions. Second operand 10 states. [2019-09-10 08:13:24,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:24,879 INFO L93 Difference]: Finished difference Result 251239 states and 333900 transitions. [2019-09-10 08:13:24,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 08:13:24,879 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 220 [2019-09-10 08:13:24,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:25,080 INFO L225 Difference]: With dead ends: 251239 [2019-09-10 08:13:25,080 INFO L226 Difference]: Without dead ends: 251239 [2019-09-10 08:13:25,081 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=270, Invalid=852, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 08:13:25,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251239 states. [2019-09-10 08:13:26,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251239 to 44538. [2019-09-10 08:13:26,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44538 states. [2019-09-10 08:13:26,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44538 states to 44538 states and 59096 transitions. [2019-09-10 08:13:26,911 INFO L78 Accepts]: Start accepts. Automaton has 44538 states and 59096 transitions. Word has length 220 [2019-09-10 08:13:26,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:26,911 INFO L475 AbstractCegarLoop]: Abstraction has 44538 states and 59096 transitions. [2019-09-10 08:13:26,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:13:26,911 INFO L276 IsEmpty]: Start isEmpty. Operand 44538 states and 59096 transitions. [2019-09-10 08:13:26,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-09-10 08:13:26,932 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:26,932 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:26,932 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:26,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:26,932 INFO L82 PathProgramCache]: Analyzing trace with hash -679970111, now seen corresponding path program 1 times [2019-09-10 08:13:26,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:26,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:26,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:26,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:26,934 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:26,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:27,222 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:13:27,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:13:27,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:13:27,223 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:13:27,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:13:27,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:13:27,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:13:27,224 INFO L87 Difference]: Start difference. First operand 44538 states and 59096 transitions. Second operand 10 states. [2019-09-10 08:13:29,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:29,874 INFO L93 Difference]: Finished difference Result 228308 states and 303201 transitions. [2019-09-10 08:13:29,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 08:13:29,874 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 221 [2019-09-10 08:13:29,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:30,068 INFO L225 Difference]: With dead ends: 228308 [2019-09-10 08:13:30,068 INFO L226 Difference]: Without dead ends: 228308 [2019-09-10 08:13:30,069 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=185, Invalid=571, Unknown=0, NotChecked=0, Total=756 [2019-09-10 08:13:30,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228308 states. [2019-09-10 08:13:31,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228308 to 45610. [2019-09-10 08:13:31,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45610 states. [2019-09-10 08:13:31,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45610 states to 45610 states and 60434 transitions. [2019-09-10 08:13:31,855 INFO L78 Accepts]: Start accepts. Automaton has 45610 states and 60434 transitions. Word has length 221 [2019-09-10 08:13:31,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:31,856 INFO L475 AbstractCegarLoop]: Abstraction has 45610 states and 60434 transitions. [2019-09-10 08:13:31,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:13:31,856 INFO L276 IsEmpty]: Start isEmpty. Operand 45610 states and 60434 transitions. [2019-09-10 08:13:31,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-09-10 08:13:31,877 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:31,877 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:31,877 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:31,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:31,878 INFO L82 PathProgramCache]: Analyzing trace with hash -164625816, now seen corresponding path program 1 times [2019-09-10 08:13:31,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:31,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:31,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:31,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:31,879 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:31,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:32,221 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:13:32,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:13:32,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 08:13:32,222 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:13:32,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:13:32,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:13:32,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:13:32,223 INFO L87 Difference]: Start difference. First operand 45610 states and 60434 transitions. Second operand 12 states. [2019-09-10 08:13:35,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:35,670 INFO L93 Difference]: Finished difference Result 117951 states and 158356 transitions. [2019-09-10 08:13:35,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 08:13:35,670 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 221 [2019-09-10 08:13:35,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:35,767 INFO L225 Difference]: With dead ends: 117951 [2019-09-10 08:13:35,767 INFO L226 Difference]: Without dead ends: 117951 [2019-09-10 08:13:35,768 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=275, Invalid=717, Unknown=0, NotChecked=0, Total=992 [2019-09-10 08:13:35,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117951 states. [2019-09-10 08:13:36,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117951 to 36036. [2019-09-10 08:13:36,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36036 states. [2019-09-10 08:13:36,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36036 states to 36036 states and 47976 transitions. [2019-09-10 08:13:36,715 INFO L78 Accepts]: Start accepts. Automaton has 36036 states and 47976 transitions. Word has length 221 [2019-09-10 08:13:36,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:36,716 INFO L475 AbstractCegarLoop]: Abstraction has 36036 states and 47976 transitions. [2019-09-10 08:13:36,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:13:36,716 INFO L276 IsEmpty]: Start isEmpty. Operand 36036 states and 47976 transitions. [2019-09-10 08:13:36,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-09-10 08:13:36,729 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:36,729 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:36,729 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:36,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:36,730 INFO L82 PathProgramCache]: Analyzing trace with hash 294057753, now seen corresponding path program 1 times [2019-09-10 08:13:36,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:36,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:36,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:36,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:36,731 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:36,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:36,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:13:36,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:13:36,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:13:36,802 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:13:36,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:13:36,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:13:36,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:13:36,803 INFO L87 Difference]: Start difference. First operand 36036 states and 47976 transitions. Second operand 3 states. [2019-09-10 08:13:36,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:36,982 INFO L93 Difference]: Finished difference Result 34550 states and 45760 transitions. [2019-09-10 08:13:36,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:13:36,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 222 [2019-09-10 08:13:36,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:37,008 INFO L225 Difference]: With dead ends: 34550 [2019-09-10 08:13:37,008 INFO L226 Difference]: Without dead ends: 34550 [2019-09-10 08:13:37,008 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:13:37,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34550 states. [2019-09-10 08:13:37,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34550 to 34550. [2019-09-10 08:13:37,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34550 states. [2019-09-10 08:13:37,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34550 states to 34550 states and 45760 transitions. [2019-09-10 08:13:37,300 INFO L78 Accepts]: Start accepts. Automaton has 34550 states and 45760 transitions. Word has length 222 [2019-09-10 08:13:37,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:37,301 INFO L475 AbstractCegarLoop]: Abstraction has 34550 states and 45760 transitions. [2019-09-10 08:13:37,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:13:37,301 INFO L276 IsEmpty]: Start isEmpty. Operand 34550 states and 45760 transitions. [2019-09-10 08:13:37,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-09-10 08:13:37,314 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:37,314 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:37,314 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:37,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:37,315 INFO L82 PathProgramCache]: Analyzing trace with hash 394144330, now seen corresponding path program 1 times [2019-09-10 08:13:37,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:37,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:37,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:37,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:37,316 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:37,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:37,860 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:13:37,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:13:37,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 08:13:37,861 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:13:37,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 08:13:37,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 08:13:37,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:13:37,862 INFO L87 Difference]: Start difference. First operand 34550 states and 45760 transitions. Second operand 13 states. [2019-09-10 08:13:38,986 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-09-10 08:13:48,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:48,057 INFO L93 Difference]: Finished difference Result 184681 states and 246171 transitions. [2019-09-10 08:13:48,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-10 08:13:48,057 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 222 [2019-09-10 08:13:48,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:48,215 INFO L225 Difference]: With dead ends: 184681 [2019-09-10 08:13:48,216 INFO L226 Difference]: Without dead ends: 184681 [2019-09-10 08:13:48,216 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=384, Invalid=1420, Unknown=2, NotChecked=0, Total=1806 [2019-09-10 08:13:48,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184681 states. [2019-09-10 08:13:49,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184681 to 35678. [2019-09-10 08:13:49,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35678 states. [2019-09-10 08:13:49,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35678 states to 35678 states and 47188 transitions. [2019-09-10 08:13:49,152 INFO L78 Accepts]: Start accepts. Automaton has 35678 states and 47188 transitions. Word has length 222 [2019-09-10 08:13:49,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:49,152 INFO L475 AbstractCegarLoop]: Abstraction has 35678 states and 47188 transitions. [2019-09-10 08:13:49,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 08:13:49,152 INFO L276 IsEmpty]: Start isEmpty. Operand 35678 states and 47188 transitions. [2019-09-10 08:13:49,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-09-10 08:13:49,166 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:49,166 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:49,166 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:49,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:49,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1137301345, now seen corresponding path program 1 times [2019-09-10 08:13:49,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:49,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:49,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:49,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:49,168 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:49,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:49,539 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:13:49,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:13:49,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:13:49,540 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:13:49,540 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:13:49,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:13:49,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:13:49,541 INFO L87 Difference]: Start difference. First operand 35678 states and 47188 transitions. Second operand 10 states. [2019-09-10 08:13:51,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:51,413 INFO L93 Difference]: Finished difference Result 97286 states and 131344 transitions. [2019-09-10 08:13:51,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 08:13:51,414 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 223 [2019-09-10 08:13:51,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:51,490 INFO L225 Difference]: With dead ends: 97286 [2019-09-10 08:13:51,490 INFO L226 Difference]: Without dead ends: 97286 [2019-09-10 08:13:51,491 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2019-09-10 08:13:51,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97286 states. [2019-09-10 08:13:52,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97286 to 28888. [2019-09-10 08:13:52,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28888 states. [2019-09-10 08:13:52,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28888 states to 28888 states and 38568 transitions. [2019-09-10 08:13:52,179 INFO L78 Accepts]: Start accepts. Automaton has 28888 states and 38568 transitions. Word has length 223 [2019-09-10 08:13:52,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:52,179 INFO L475 AbstractCegarLoop]: Abstraction has 28888 states and 38568 transitions. [2019-09-10 08:13:52,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:13:52,180 INFO L276 IsEmpty]: Start isEmpty. Operand 28888 states and 38568 transitions. [2019-09-10 08:13:52,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-09-10 08:13:52,188 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:52,188 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:52,188 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:52,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:52,189 INFO L82 PathProgramCache]: Analyzing trace with hash 77928718, now seen corresponding path program 1 times [2019-09-10 08:13:52,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:52,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:52,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:52,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:52,190 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:52,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:52,506 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:13:52,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:13:52,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:13:52,506 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:13:52,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:13:52,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:13:52,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:13:52,507 INFO L87 Difference]: Start difference. First operand 28888 states and 38568 transitions. Second operand 10 states. [2019-09-10 08:13:54,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:54,240 INFO L93 Difference]: Finished difference Result 72784 states and 97897 transitions. [2019-09-10 08:13:54,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:13:54,241 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 223 [2019-09-10 08:13:54,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:54,301 INFO L225 Difference]: With dead ends: 72784 [2019-09-10 08:13:54,301 INFO L226 Difference]: Without dead ends: 72784 [2019-09-10 08:13:54,301 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:13:54,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72784 states. [2019-09-10 08:13:54,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72784 to 24760. [2019-09-10 08:13:54,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24760 states. [2019-09-10 08:13:54,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24760 states to 24760 states and 33293 transitions. [2019-09-10 08:13:54,705 INFO L78 Accepts]: Start accepts. Automaton has 24760 states and 33293 transitions. Word has length 223 [2019-09-10 08:13:54,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:54,706 INFO L475 AbstractCegarLoop]: Abstraction has 24760 states and 33293 transitions. [2019-09-10 08:13:54,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:13:54,706 INFO L276 IsEmpty]: Start isEmpty. Operand 24760 states and 33293 transitions. [2019-09-10 08:13:54,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-09-10 08:13:54,711 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:54,712 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:54,712 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:54,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:54,712 INFO L82 PathProgramCache]: Analyzing trace with hash 720210647, now seen corresponding path program 1 times [2019-09-10 08:13:54,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:54,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:54,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:54,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:54,713 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:54,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:55,015 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:13:55,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:13:55,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:13:55,015 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:13:55,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:13:55,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:13:55,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:13:55,016 INFO L87 Difference]: Start difference. First operand 24760 states and 33293 transitions. Second operand 10 states. [2019-09-10 08:13:56,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:56,951 INFO L93 Difference]: Finished difference Result 87818 states and 118694 transitions. [2019-09-10 08:13:56,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:13:56,951 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 224 [2019-09-10 08:13:56,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:57,019 INFO L225 Difference]: With dead ends: 87818 [2019-09-10 08:13:57,019 INFO L226 Difference]: Without dead ends: 87818 [2019-09-10 08:13:57,020 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:13:57,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87818 states. [2019-09-10 08:13:57,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87818 to 28570. [2019-09-10 08:13:57,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28570 states. [2019-09-10 08:13:57,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28570 states to 28570 states and 38155 transitions. [2019-09-10 08:13:57,471 INFO L78 Accepts]: Start accepts. Automaton has 28570 states and 38155 transitions. Word has length 224 [2019-09-10 08:13:57,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:57,471 INFO L475 AbstractCegarLoop]: Abstraction has 28570 states and 38155 transitions. [2019-09-10 08:13:57,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:13:57,471 INFO L276 IsEmpty]: Start isEmpty. Operand 28570 states and 38155 transitions. [2019-09-10 08:13:57,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-09-10 08:13:57,479 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:57,479 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:57,479 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:57,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:57,480 INFO L82 PathProgramCache]: Analyzing trace with hash 64462522, now seen corresponding path program 1 times [2019-09-10 08:13:57,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:57,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:57,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:57,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:57,481 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:57,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:57,596 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:13:57,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:13:57,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:13:57,597 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:13:57,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:13:57,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:13:57,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:13:57,598 INFO L87 Difference]: Start difference. First operand 28570 states and 38155 transitions. Second operand 4 states. [2019-09-10 08:13:57,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:57,683 INFO L93 Difference]: Finished difference Result 28670 states and 38205 transitions. [2019-09-10 08:13:57,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:13:57,684 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 224 [2019-09-10 08:13:57,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:57,715 INFO L225 Difference]: With dead ends: 28670 [2019-09-10 08:13:57,715 INFO L226 Difference]: Without dead ends: 28548 [2019-09-10 08:13:57,715 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:13:57,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28548 states. [2019-09-10 08:13:57,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28548 to 28548. [2019-09-10 08:13:57,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28548 states. [2019-09-10 08:13:57,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28548 states to 28548 states and 38047 transitions. [2019-09-10 08:13:57,987 INFO L78 Accepts]: Start accepts. Automaton has 28548 states and 38047 transitions. Word has length 224 [2019-09-10 08:13:57,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:57,987 INFO L475 AbstractCegarLoop]: Abstraction has 28548 states and 38047 transitions. [2019-09-10 08:13:57,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:13:57,987 INFO L276 IsEmpty]: Start isEmpty. Operand 28548 states and 38047 transitions. [2019-09-10 08:13:57,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-09-10 08:13:57,995 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:57,995 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:57,995 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:57,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:57,996 INFO L82 PathProgramCache]: Analyzing trace with hash 691057391, now seen corresponding path program 1 times [2019-09-10 08:13:57,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:57,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:57,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:57,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:57,997 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:58,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:58,064 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:13:58,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:13:58,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:13:58,064 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:13:58,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:13:58,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:13:58,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:13:58,065 INFO L87 Difference]: Start difference. First operand 28548 states and 38047 transitions. Second operand 3 states. [2019-09-10 08:13:58,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:58,179 INFO L93 Difference]: Finished difference Result 39804 states and 50198 transitions. [2019-09-10 08:13:58,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:13:58,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 226 [2019-09-10 08:13:58,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:58,221 INFO L225 Difference]: With dead ends: 39804 [2019-09-10 08:13:58,222 INFO L226 Difference]: Without dead ends: 39800 [2019-09-10 08:13:58,222 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:13:58,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39800 states. [2019-09-10 08:13:58,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39800 to 38166. [2019-09-10 08:13:58,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38166 states. [2019-09-10 08:13:58,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38166 states to 38166 states and 48337 transitions. [2019-09-10 08:13:58,586 INFO L78 Accepts]: Start accepts. Automaton has 38166 states and 48337 transitions. Word has length 226 [2019-09-10 08:13:58,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:58,587 INFO L475 AbstractCegarLoop]: Abstraction has 38166 states and 48337 transitions. [2019-09-10 08:13:58,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:13:58,587 INFO L276 IsEmpty]: Start isEmpty. Operand 38166 states and 48337 transitions. [2019-09-10 08:13:58,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-09-10 08:13:58,599 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:58,599 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:58,599 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:58,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:58,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1859521385, now seen corresponding path program 1 times [2019-09-10 08:13:58,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:58,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:58,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:58,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:58,600 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:58,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:58,700 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:13:58,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:13:58,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:13:58,701 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:13:58,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:13:58,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:13:58,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:13:58,702 INFO L87 Difference]: Start difference. First operand 38166 states and 48337 transitions. Second operand 3 states. [2019-09-10 08:13:58,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:58,832 INFO L93 Difference]: Finished difference Result 43334 states and 55172 transitions. [2019-09-10 08:13:58,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:13:58,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 227 [2019-09-10 08:13:58,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:58,873 INFO L225 Difference]: With dead ends: 43334 [2019-09-10 08:13:58,873 INFO L226 Difference]: Without dead ends: 43334 [2019-09-10 08:13:58,873 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:13:58,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43334 states. [2019-09-10 08:13:59,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43334 to 41014. [2019-09-10 08:13:59,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41014 states. [2019-09-10 08:13:59,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41014 states to 41014 states and 51961 transitions. [2019-09-10 08:13:59,383 INFO L78 Accepts]: Start accepts. Automaton has 41014 states and 51961 transitions. Word has length 227 [2019-09-10 08:13:59,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:59,384 INFO L475 AbstractCegarLoop]: Abstraction has 41014 states and 51961 transitions. [2019-09-10 08:13:59,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:13:59,384 INFO L276 IsEmpty]: Start isEmpty. Operand 41014 states and 51961 transitions. [2019-09-10 08:13:59,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-10 08:13:59,395 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:59,395 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:59,395 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:59,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:59,396 INFO L82 PathProgramCache]: Analyzing trace with hash 368205995, now seen corresponding path program 1 times [2019-09-10 08:13:59,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:59,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:59,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:59,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:59,397 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:59,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:59,487 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:13:59,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:13:59,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:13:59,488 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:13:59,488 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:13:59,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:13:59,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:13:59,489 INFO L87 Difference]: Start difference. First operand 41014 states and 51961 transitions. Second operand 3 states. [2019-09-10 08:13:59,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:59,643 INFO L93 Difference]: Finished difference Result 48106 states and 60476 transitions. [2019-09-10 08:13:59,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:13:59,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 229 [2019-09-10 08:13:59,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:59,690 INFO L225 Difference]: With dead ends: 48106 [2019-09-10 08:13:59,691 INFO L226 Difference]: Without dead ends: 48096 [2019-09-10 08:13:59,691 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:13:59,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48096 states. [2019-09-10 08:14:00,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48096 to 41306. [2019-09-10 08:14:00,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41306 states. [2019-09-10 08:14:00,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41306 states to 41306 states and 51865 transitions. [2019-09-10 08:14:00,121 INFO L78 Accepts]: Start accepts. Automaton has 41306 states and 51865 transitions. Word has length 229 [2019-09-10 08:14:00,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:00,121 INFO L475 AbstractCegarLoop]: Abstraction has 41306 states and 51865 transitions. [2019-09-10 08:14:00,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:14:00,121 INFO L276 IsEmpty]: Start isEmpty. Operand 41306 states and 51865 transitions. [2019-09-10 08:14:00,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-10 08:14:00,133 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:00,133 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:00,133 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:00,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:00,133 INFO L82 PathProgramCache]: Analyzing trace with hash 2111644515, now seen corresponding path program 1 times [2019-09-10 08:14:00,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:00,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:00,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:00,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:00,134 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:00,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:00,220 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:14:00,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:00,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:14:00,220 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:00,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:14:00,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:14:00,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:14:00,221 INFO L87 Difference]: Start difference. First operand 41306 states and 51865 transitions. Second operand 3 states. [2019-09-10 08:14:00,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:00,327 INFO L93 Difference]: Finished difference Result 42300 states and 52362 transitions. [2019-09-10 08:14:00,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:14:00,327 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2019-09-10 08:14:00,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:00,360 INFO L225 Difference]: With dead ends: 42300 [2019-09-10 08:14:00,360 INFO L226 Difference]: Without dead ends: 42300 [2019-09-10 08:14:00,360 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:14:00,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42300 states. [2019-09-10 08:14:00,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42300 to 41098. [2019-09-10 08:14:00,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41098 states. [2019-09-10 08:14:00,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41098 states to 41098 states and 50921 transitions. [2019-09-10 08:14:00,705 INFO L78 Accepts]: Start accepts. Automaton has 41098 states and 50921 transitions. Word has length 230 [2019-09-10 08:14:00,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:00,705 INFO L475 AbstractCegarLoop]: Abstraction has 41098 states and 50921 transitions. [2019-09-10 08:14:00,705 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:14:00,705 INFO L276 IsEmpty]: Start isEmpty. Operand 41098 states and 50921 transitions. [2019-09-10 08:14:00,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-10 08:14:00,716 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:00,716 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:00,716 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:00,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:00,716 INFO L82 PathProgramCache]: Analyzing trace with hash 30284511, now seen corresponding path program 1 times [2019-09-10 08:14:00,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:00,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:00,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:00,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:00,717 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:00,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:00,871 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:14:00,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:00,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:14:00,872 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:00,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:14:00,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:14:00,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:14:00,873 INFO L87 Difference]: Start difference. First operand 41098 states and 50921 transitions. Second operand 5 states. [2019-09-10 08:14:01,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:01,123 INFO L93 Difference]: Finished difference Result 45458 states and 56397 transitions. [2019-09-10 08:14:01,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:14:01,123 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 230 [2019-09-10 08:14:01,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:01,159 INFO L225 Difference]: With dead ends: 45458 [2019-09-10 08:14:01,159 INFO L226 Difference]: Without dead ends: 45458 [2019-09-10 08:14:01,160 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:14:01,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45458 states. [2019-09-10 08:14:01,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45458 to 38420. [2019-09-10 08:14:01,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38420 states. [2019-09-10 08:14:01,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38420 states to 38420 states and 47663 transitions. [2019-09-10 08:14:01,732 INFO L78 Accepts]: Start accepts. Automaton has 38420 states and 47663 transitions. Word has length 230 [2019-09-10 08:14:01,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:01,733 INFO L475 AbstractCegarLoop]: Abstraction has 38420 states and 47663 transitions. [2019-09-10 08:14:01,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:14:01,733 INFO L276 IsEmpty]: Start isEmpty. Operand 38420 states and 47663 transitions. [2019-09-10 08:14:01,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-10 08:14:01,743 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:01,744 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:01,744 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:01,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:01,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1134228004, now seen corresponding path program 1 times [2019-09-10 08:14:01,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:01,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:01,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:01,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:01,745 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:01,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:01,880 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:14:01,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:01,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:14:01,881 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:01,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:14:01,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:14:01,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:14:01,882 INFO L87 Difference]: Start difference. First operand 38420 states and 47663 transitions. Second operand 5 states. [2019-09-10 08:14:02,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:02,139 INFO L93 Difference]: Finished difference Result 42644 states and 52943 transitions. [2019-09-10 08:14:02,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:14:02,140 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 230 [2019-09-10 08:14:02,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:02,182 INFO L225 Difference]: With dead ends: 42644 [2019-09-10 08:14:02,183 INFO L226 Difference]: Without dead ends: 42644 [2019-09-10 08:14:02,183 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:14:02,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42644 states. [2019-09-10 08:14:02,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42644 to 36047. [2019-09-10 08:14:02,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36047 states. [2019-09-10 08:14:02,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36047 states to 36047 states and 44765 transitions. [2019-09-10 08:14:02,518 INFO L78 Accepts]: Start accepts. Automaton has 36047 states and 44765 transitions. Word has length 230 [2019-09-10 08:14:02,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:02,519 INFO L475 AbstractCegarLoop]: Abstraction has 36047 states and 44765 transitions. [2019-09-10 08:14:02,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:14:02,519 INFO L276 IsEmpty]: Start isEmpty. Operand 36047 states and 44765 transitions. [2019-09-10 08:14:02,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-10 08:14:02,529 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:02,529 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:02,529 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:02,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:02,529 INFO L82 PathProgramCache]: Analyzing trace with hash -681572804, now seen corresponding path program 1 times [2019-09-10 08:14:02,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:02,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:02,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:02,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:02,530 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:02,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:02,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:14:02,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:02,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:14:02,741 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:02,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:14:02,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:14:02,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:14:02,742 INFO L87 Difference]: Start difference. First operand 36047 states and 44765 transitions. Second operand 8 states. [2019-09-10 08:14:03,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:03,240 INFO L93 Difference]: Finished difference Result 68941 states and 86363 transitions. [2019-09-10 08:14:03,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:14:03,240 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 230 [2019-09-10 08:14:03,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:03,295 INFO L225 Difference]: With dead ends: 68941 [2019-09-10 08:14:03,295 INFO L226 Difference]: Without dead ends: 68933 [2019-09-10 08:14:03,295 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:14:03,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68933 states. [2019-09-10 08:14:03,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68933 to 68923. [2019-09-10 08:14:03,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68923 states. [2019-09-10 08:14:03,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68923 states to 68923 states and 86350 transitions. [2019-09-10 08:14:03,938 INFO L78 Accepts]: Start accepts. Automaton has 68923 states and 86350 transitions. Word has length 230 [2019-09-10 08:14:03,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:03,938 INFO L475 AbstractCegarLoop]: Abstraction has 68923 states and 86350 transitions. [2019-09-10 08:14:03,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:14:03,938 INFO L276 IsEmpty]: Start isEmpty. Operand 68923 states and 86350 transitions. [2019-09-10 08:14:03,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-10 08:14:03,954 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:03,955 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:03,955 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:03,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:03,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1711342111, now seen corresponding path program 1 times [2019-09-10 08:14:03,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:03,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:03,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:03,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:03,957 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:03,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:04,070 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:14:04,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:04,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:14:04,070 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:04,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:14:04,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:14:04,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:14:04,072 INFO L87 Difference]: Start difference. First operand 68923 states and 86350 transitions. Second operand 4 states. [2019-09-10 08:14:04,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:04,298 INFO L93 Difference]: Finished difference Result 63328 states and 79602 transitions. [2019-09-10 08:14:04,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:14:04,299 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 230 [2019-09-10 08:14:04,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:04,378 INFO L225 Difference]: With dead ends: 63328 [2019-09-10 08:14:04,378 INFO L226 Difference]: Without dead ends: 63272 [2019-09-10 08:14:04,380 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:14:04,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63272 states. [2019-09-10 08:14:05,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63272 to 63184. [2019-09-10 08:14:05,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63184 states. [2019-09-10 08:14:05,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63184 states to 63184 states and 79434 transitions. [2019-09-10 08:14:05,555 INFO L78 Accepts]: Start accepts. Automaton has 63184 states and 79434 transitions. Word has length 230 [2019-09-10 08:14:05,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:05,555 INFO L475 AbstractCegarLoop]: Abstraction has 63184 states and 79434 transitions. [2019-09-10 08:14:05,555 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:14:05,556 INFO L276 IsEmpty]: Start isEmpty. Operand 63184 states and 79434 transitions. [2019-09-10 08:14:05,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-10 08:14:05,567 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:05,568 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:05,568 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:05,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:05,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1625736191, now seen corresponding path program 1 times [2019-09-10 08:14:05,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:05,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:05,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:05,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:05,569 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:05,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:06,022 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:14:06,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:06,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 08:14:06,022 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:06,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 08:14:06,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 08:14:06,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2019-09-10 08:14:06,023 INFO L87 Difference]: Start difference. First operand 63184 states and 79434 transitions. Second operand 18 states. [2019-09-10 08:14:09,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:09,178 INFO L93 Difference]: Finished difference Result 326676 states and 411115 transitions. [2019-09-10 08:14:09,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 08:14:09,179 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 230 [2019-09-10 08:14:09,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:09,540 INFO L225 Difference]: With dead ends: 326676 [2019-09-10 08:14:09,541 INFO L226 Difference]: Without dead ends: 326676 [2019-09-10 08:14:09,541 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=204, Invalid=1128, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 08:14:09,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326676 states. [2019-09-10 08:14:11,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326676 to 64820. [2019-09-10 08:14:11,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64820 states. [2019-09-10 08:14:11,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64820 states to 64820 states and 81273 transitions. [2019-09-10 08:14:11,718 INFO L78 Accepts]: Start accepts. Automaton has 64820 states and 81273 transitions. Word has length 230 [2019-09-10 08:14:11,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:11,719 INFO L475 AbstractCegarLoop]: Abstraction has 64820 states and 81273 transitions. [2019-09-10 08:14:11,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 08:14:11,719 INFO L276 IsEmpty]: Start isEmpty. Operand 64820 states and 81273 transitions. [2019-09-10 08:14:11,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-10 08:14:11,731 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:11,731 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:11,731 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:11,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:11,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1620154012, now seen corresponding path program 1 times [2019-09-10 08:14:11,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:11,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:11,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:11,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:11,733 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:11,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:12,433 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:14:12,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:12,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 08:14:12,433 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:12,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 08:14:12,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 08:14:12,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:14:12,434 INFO L87 Difference]: Start difference. First operand 64820 states and 81273 transitions. Second operand 19 states. [2019-09-10 08:14:15,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:15,867 INFO L93 Difference]: Finished difference Result 417560 states and 525798 transitions. [2019-09-10 08:14:15,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 08:14:15,868 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 230 [2019-09-10 08:14:15,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:16,301 INFO L225 Difference]: With dead ends: 417560 [2019-09-10 08:14:16,301 INFO L226 Difference]: Without dead ends: 417560 [2019-09-10 08:14:16,301 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=192, Invalid=1068, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 08:14:16,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417560 states. [2019-09-10 08:14:18,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417560 to 68824. [2019-09-10 08:14:18,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68824 states. [2019-09-10 08:14:18,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68824 states to 68824 states and 85956 transitions. [2019-09-10 08:14:18,291 INFO L78 Accepts]: Start accepts. Automaton has 68824 states and 85956 transitions. Word has length 230 [2019-09-10 08:14:18,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:18,291 INFO L475 AbstractCegarLoop]: Abstraction has 68824 states and 85956 transitions. [2019-09-10 08:14:18,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 08:14:18,292 INFO L276 IsEmpty]: Start isEmpty. Operand 68824 states and 85956 transitions. [2019-09-10 08:14:18,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-10 08:14:18,306 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:18,307 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:18,307 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:18,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:18,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1027413727, now seen corresponding path program 1 times [2019-09-10 08:14:18,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:18,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:18,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:18,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:18,308 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:18,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:19,328 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:14:19,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:19,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 08:14:19,329 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:19,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 08:14:19,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 08:14:19,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-09-10 08:14:19,330 INFO L87 Difference]: Start difference. First operand 68824 states and 85956 transitions. Second operand 18 states. [2019-09-10 08:14:21,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:21,806 INFO L93 Difference]: Finished difference Result 377756 states and 473974 transitions. [2019-09-10 08:14:21,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 08:14:21,806 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 230 [2019-09-10 08:14:21,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:22,170 INFO L225 Difference]: With dead ends: 377756 [2019-09-10 08:14:22,170 INFO L226 Difference]: Without dead ends: 377756 [2019-09-10 08:14:22,170 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=161, Invalid=961, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 08:14:22,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377756 states. [2019-09-10 08:14:24,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377756 to 75688. [2019-09-10 08:14:24,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75688 states. [2019-09-10 08:14:24,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75688 states to 75688 states and 93859 transitions. [2019-09-10 08:14:24,810 INFO L78 Accepts]: Start accepts. Automaton has 75688 states and 93859 transitions. Word has length 230 [2019-09-10 08:14:24,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:24,810 INFO L475 AbstractCegarLoop]: Abstraction has 75688 states and 93859 transitions. [2019-09-10 08:14:24,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 08:14:24,811 INFO L276 IsEmpty]: Start isEmpty. Operand 75688 states and 93859 transitions. [2019-09-10 08:14:24,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-10 08:14:24,831 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:24,831 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:24,831 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:24,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:24,832 INFO L82 PathProgramCache]: Analyzing trace with hash 211239551, now seen corresponding path program 1 times [2019-09-10 08:14:24,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:24,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:24,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:24,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:24,833 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:24,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:25,307 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:14:25,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:25,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 08:14:25,308 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:25,309 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 08:14:25,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 08:14:25,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-09-10 08:14:25,310 INFO L87 Difference]: Start difference. First operand 75688 states and 93859 transitions. Second operand 18 states. [2019-09-10 08:14:27,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:27,752 INFO L93 Difference]: Finished difference Result 331433 states and 414017 transitions. [2019-09-10 08:14:27,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 08:14:27,753 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 230 [2019-09-10 08:14:27,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:28,066 INFO L225 Difference]: With dead ends: 331433 [2019-09-10 08:14:28,066 INFO L226 Difference]: Without dead ends: 331433 [2019-09-10 08:14:28,067 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=192, Invalid=998, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 08:14:28,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331433 states. [2019-09-10 08:14:30,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331433 to 78176. [2019-09-10 08:14:30,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78176 states. [2019-09-10 08:14:30,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78176 states to 78176 states and 96598 transitions. [2019-09-10 08:14:30,561 INFO L78 Accepts]: Start accepts. Automaton has 78176 states and 96598 transitions. Word has length 230 [2019-09-10 08:14:30,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:30,561 INFO L475 AbstractCegarLoop]: Abstraction has 78176 states and 96598 transitions. [2019-09-10 08:14:30,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 08:14:30,561 INFO L276 IsEmpty]: Start isEmpty. Operand 78176 states and 96598 transitions. [2019-09-10 08:14:30,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-10 08:14:30,583 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:30,583 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:30,583 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:30,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:30,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1383498276, now seen corresponding path program 1 times [2019-09-10 08:14:30,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:30,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:30,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:30,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:30,585 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:30,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:30,712 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:14:30,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:30,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:14:30,713 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:30,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:14:30,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:14:30,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:14:30,714 INFO L87 Difference]: Start difference. First operand 78176 states and 96598 transitions. Second operand 5 states. [2019-09-10 08:14:30,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:30,999 INFO L93 Difference]: Finished difference Result 83112 states and 102866 transitions. [2019-09-10 08:14:30,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:14:30,999 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 230 [2019-09-10 08:14:30,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:31,063 INFO L225 Difference]: With dead ends: 83112 [2019-09-10 08:14:31,063 INFO L226 Difference]: Without dead ends: 83112 [2019-09-10 08:14:31,064 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:14:31,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83112 states. [2019-09-10 08:14:31,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83112 to 74418. [2019-09-10 08:14:31,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74418 states. [2019-09-10 08:14:31,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74418 states to 74418 states and 92021 transitions. [2019-09-10 08:14:31,998 INFO L78 Accepts]: Start accepts. Automaton has 74418 states and 92021 transitions. Word has length 230 [2019-09-10 08:14:31,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:31,998 INFO L475 AbstractCegarLoop]: Abstraction has 74418 states and 92021 transitions. [2019-09-10 08:14:31,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:14:31,998 INFO L276 IsEmpty]: Start isEmpty. Operand 74418 states and 92021 transitions. [2019-09-10 08:14:32,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-10 08:14:32,019 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:32,019 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:32,019 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:32,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:32,019 INFO L82 PathProgramCache]: Analyzing trace with hash 2109201986, now seen corresponding path program 1 times [2019-09-10 08:14:32,019 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:32,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:32,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:32,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:32,020 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:32,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:32,218 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:14:32,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:32,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:14:32,219 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:32,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:14:32,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:14:32,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:14:32,220 INFO L87 Difference]: Start difference. First operand 74418 states and 92021 transitions. Second operand 8 states. [2019-09-10 08:14:32,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:32,810 INFO L93 Difference]: Finished difference Result 147715 states and 184527 transitions. [2019-09-10 08:14:32,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:14:32,810 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 230 [2019-09-10 08:14:32,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:32,935 INFO L225 Difference]: With dead ends: 147715 [2019-09-10 08:14:32,935 INFO L226 Difference]: Without dead ends: 147627 [2019-09-10 08:14:32,936 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:14:33,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147627 states. [2019-09-10 08:14:34,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147627 to 147601. [2019-09-10 08:14:34,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147601 states. [2019-09-10 08:14:34,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147601 states to 147601 states and 184398 transitions. [2019-09-10 08:14:34,889 INFO L78 Accepts]: Start accepts. Automaton has 147601 states and 184398 transitions. Word has length 230 [2019-09-10 08:14:34,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:34,889 INFO L475 AbstractCegarLoop]: Abstraction has 147601 states and 184398 transitions. [2019-09-10 08:14:34,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:14:34,889 INFO L276 IsEmpty]: Start isEmpty. Operand 147601 states and 184398 transitions. [2019-09-10 08:14:34,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-10 08:14:34,924 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:34,925 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:34,925 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:34,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:34,925 INFO L82 PathProgramCache]: Analyzing trace with hash 782533234, now seen corresponding path program 1 times [2019-09-10 08:14:34,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:34,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:34,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:34,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:34,926 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:34,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:34,992 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:14:34,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:34,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:14:34,992 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:34,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:14:34,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:14:34,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:14:34,993 INFO L87 Difference]: Start difference. First operand 147601 states and 184398 transitions. Second operand 4 states. [2019-09-10 08:14:36,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:36,136 INFO L93 Difference]: Finished difference Result 452418 states and 576468 transitions. [2019-09-10 08:14:36,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:14:36,137 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 230 [2019-09-10 08:14:36,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:36,624 INFO L225 Difference]: With dead ends: 452418 [2019-09-10 08:14:36,624 INFO L226 Difference]: Without dead ends: 452418 [2019-09-10 08:14:36,624 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:14:36,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452418 states. [2019-09-10 08:14:40,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452418 to 145866. [2019-09-10 08:14:40,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145866 states. [2019-09-10 08:14:40,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145866 states to 145866 states and 182351 transitions. [2019-09-10 08:14:40,241 INFO L78 Accepts]: Start accepts. Automaton has 145866 states and 182351 transitions. Word has length 230 [2019-09-10 08:14:40,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:40,242 INFO L475 AbstractCegarLoop]: Abstraction has 145866 states and 182351 transitions. [2019-09-10 08:14:40,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:14:40,242 INFO L276 IsEmpty]: Start isEmpty. Operand 145866 states and 182351 transitions. [2019-09-10 08:14:40,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-10 08:14:40,272 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:40,272 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:40,272 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:40,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:40,272 INFO L82 PathProgramCache]: Analyzing trace with hash 258190381, now seen corresponding path program 1 times [2019-09-10 08:14:40,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:40,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:40,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:40,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:40,273 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:40,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:40,652 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:14:40,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:40,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 08:14:40,653 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:40,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:14:40,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:14:40,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:14:40,653 INFO L87 Difference]: Start difference. First operand 145866 states and 182351 transitions. Second operand 12 states. [2019-09-10 08:14:41,975 WARN L188 SmtUtils]: Spent 785.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 32 [2019-09-10 08:14:44,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:44,112 INFO L93 Difference]: Finished difference Result 384992 states and 485549 transitions. [2019-09-10 08:14:44,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:14:44,112 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 230 [2019-09-10 08:14:44,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:44,509 INFO L225 Difference]: With dead ends: 384992 [2019-09-10 08:14:44,509 INFO L226 Difference]: Without dead ends: 384992 [2019-09-10 08:14:44,510 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=159, Invalid=441, Unknown=0, NotChecked=0, Total=600 [2019-09-10 08:14:44,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384992 states. [2019-09-10 08:14:48,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384992 to 136914. [2019-09-10 08:14:48,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136914 states. [2019-09-10 08:14:48,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136914 states to 136914 states and 171892 transitions. [2019-09-10 08:14:48,308 INFO L78 Accepts]: Start accepts. Automaton has 136914 states and 171892 transitions. Word has length 230 [2019-09-10 08:14:48,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:48,308 INFO L475 AbstractCegarLoop]: Abstraction has 136914 states and 171892 transitions. [2019-09-10 08:14:48,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:14:48,308 INFO L276 IsEmpty]: Start isEmpty. Operand 136914 states and 171892 transitions. [2019-09-10 08:14:48,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-10 08:14:48,334 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:48,334 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:48,334 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:48,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:48,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1081868765, now seen corresponding path program 1 times [2019-09-10 08:14:48,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:48,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:48,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:48,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:48,335 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:48,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:48,452 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:14:48,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:48,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:14:48,452 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:48,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:14:48,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:14:48,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:14:48,453 INFO L87 Difference]: Start difference. First operand 136914 states and 171892 transitions. Second operand 5 states. [2019-09-10 08:14:50,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:50,243 INFO L93 Difference]: Finished difference Result 177358 states and 222314 transitions. [2019-09-10 08:14:50,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:14:50,244 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 231 [2019-09-10 08:14:50,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:50,400 INFO L225 Difference]: With dead ends: 177358 [2019-09-10 08:14:50,401 INFO L226 Difference]: Without dead ends: 177358 [2019-09-10 08:14:50,401 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:14:50,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177358 states. [2019-09-10 08:14:55,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177358 to 151290. [2019-09-10 08:14:55,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151290 states. [2019-09-10 08:14:55,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151290 states to 151290 states and 190401 transitions. [2019-09-10 08:14:55,373 INFO L78 Accepts]: Start accepts. Automaton has 151290 states and 190401 transitions. Word has length 231 [2019-09-10 08:14:55,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:55,374 INFO L475 AbstractCegarLoop]: Abstraction has 151290 states and 190401 transitions. [2019-09-10 08:14:55,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:14:55,374 INFO L276 IsEmpty]: Start isEmpty. Operand 151290 states and 190401 transitions. [2019-09-10 08:14:55,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-10 08:14:55,398 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:55,398 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:55,399 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:55,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:55,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1320216829, now seen corresponding path program 1 times [2019-09-10 08:14:55,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:55,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:55,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:55,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:55,400 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:55,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:55,882 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:14:55,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:55,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 08:14:55,883 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:55,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 08:14:55,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 08:14:55,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-09-10 08:14:55,884 INFO L87 Difference]: Start difference. First operand 151290 states and 190401 transitions. Second operand 18 states. [2019-09-10 08:15:01,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:01,064 INFO L93 Difference]: Finished difference Result 924905 states and 1168880 transitions. [2019-09-10 08:15:01,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 08:15:01,064 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 231 [2019-09-10 08:15:01,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:02,205 INFO L225 Difference]: With dead ends: 924905 [2019-09-10 08:15:02,205 INFO L226 Difference]: Without dead ends: 924905 [2019-09-10 08:15:02,206 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=161, Invalid=961, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 08:15:02,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924905 states. [2019-09-10 08:15:09,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924905 to 154766. [2019-09-10 08:15:09,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154766 states. [2019-09-10 08:15:10,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154766 states to 154766 states and 194409 transitions. [2019-09-10 08:15:10,063 INFO L78 Accepts]: Start accepts. Automaton has 154766 states and 194409 transitions. Word has length 231 [2019-09-10 08:15:10,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:10,063 INFO L475 AbstractCegarLoop]: Abstraction has 154766 states and 194409 transitions. [2019-09-10 08:15:10,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 08:15:10,063 INFO L276 IsEmpty]: Start isEmpty. Operand 154766 states and 194409 transitions. [2019-09-10 08:15:10,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-10 08:15:10,090 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:10,090 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:10,091 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:10,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:10,091 INFO L82 PathProgramCache]: Analyzing trace with hash 159079887, now seen corresponding path program 1 times [2019-09-10 08:15:10,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:10,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:10,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:10,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:10,092 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:10,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:10,485 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:15:10,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:10,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:15:10,485 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:10,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:15:10,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:15:10,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:15:10,486 INFO L87 Difference]: Start difference. First operand 154766 states and 194409 transitions. Second operand 16 states. [2019-09-10 08:15:12,607 WARN L188 SmtUtils]: Spent 663.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2019-09-10 08:15:20,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:20,118 INFO L93 Difference]: Finished difference Result 989400 states and 1248159 transitions. [2019-09-10 08:15:20,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-10 08:15:20,118 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 231 [2019-09-10 08:15:20,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:22,516 INFO L225 Difference]: With dead ends: 989400 [2019-09-10 08:15:22,517 INFO L226 Difference]: Without dead ends: 989400 [2019-09-10 08:15:22,517 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=436, Invalid=1726, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 08:15:22,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989400 states. [2019-09-10 08:15:33,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989400 to 154768. [2019-09-10 08:15:33,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154768 states. [2019-09-10 08:15:34,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154768 states to 154768 states and 194413 transitions. [2019-09-10 08:15:34,519 INFO L78 Accepts]: Start accepts. Automaton has 154768 states and 194413 transitions. Word has length 231 [2019-09-10 08:15:34,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:34,519 INFO L475 AbstractCegarLoop]: Abstraction has 154768 states and 194413 transitions. [2019-09-10 08:15:34,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:15:34,519 INFO L276 IsEmpty]: Start isEmpty. Operand 154768 states and 194413 transitions. [2019-09-10 08:15:34,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-10 08:15:34,545 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:34,545 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:34,545 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:34,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:34,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1000020862, now seen corresponding path program 1 times [2019-09-10 08:15:34,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:34,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:34,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:34,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:34,547 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:34,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:34,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:15:34,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:34,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:15:34,595 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:34,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:15:34,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:15:34,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:15:34,595 INFO L87 Difference]: Start difference. First operand 154768 states and 194413 transitions. Second operand 3 states. [2019-09-10 08:15:34,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:34,926 INFO L93 Difference]: Finished difference Result 148497 states and 185217 transitions. [2019-09-10 08:15:34,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:15:34,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 231 [2019-09-10 08:15:34,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:35,044 INFO L225 Difference]: With dead ends: 148497 [2019-09-10 08:15:35,044 INFO L226 Difference]: Without dead ends: 148497 [2019-09-10 08:15:35,044 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:15:35,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148497 states. [2019-09-10 08:15:36,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148497 to 148497. [2019-09-10 08:15:36,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148497 states. [2019-09-10 08:15:36,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148497 states to 148497 states and 185217 transitions. [2019-09-10 08:15:36,735 INFO L78 Accepts]: Start accepts. Automaton has 148497 states and 185217 transitions. Word has length 231 [2019-09-10 08:15:36,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:36,735 INFO L475 AbstractCegarLoop]: Abstraction has 148497 states and 185217 transitions. [2019-09-10 08:15:36,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:15:36,736 INFO L276 IsEmpty]: Start isEmpty. Operand 148497 states and 185217 transitions. [2019-09-10 08:15:36,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-10 08:15:36,759 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:36,759 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:36,760 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:36,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:36,760 INFO L82 PathProgramCache]: Analyzing trace with hash 920410162, now seen corresponding path program 1 times [2019-09-10 08:15:36,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:36,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:36,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:36,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:36,761 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:36,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:36,829 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:15:36,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:36,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:15:36,829 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:36,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:15:36,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:15:36,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:15:36,830 INFO L87 Difference]: Start difference. First operand 148497 states and 185217 transitions. Second operand 3 states. [2019-09-10 08:15:37,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:37,157 INFO L93 Difference]: Finished difference Result 143242 states and 178007 transitions. [2019-09-10 08:15:37,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:15:37,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 231 [2019-09-10 08:15:37,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:37,275 INFO L225 Difference]: With dead ends: 143242 [2019-09-10 08:15:37,275 INFO L226 Difference]: Without dead ends: 143242 [2019-09-10 08:15:37,275 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:15:37,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143242 states. [2019-09-10 08:15:38,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143242 to 143242. [2019-09-10 08:15:38,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143242 states. [2019-09-10 08:15:42,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143242 states to 143242 states and 178007 transitions. [2019-09-10 08:15:42,396 INFO L78 Accepts]: Start accepts. Automaton has 143242 states and 178007 transitions. Word has length 231 [2019-09-10 08:15:42,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:42,396 INFO L475 AbstractCegarLoop]: Abstraction has 143242 states and 178007 transitions. [2019-09-10 08:15:42,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:15:42,396 INFO L276 IsEmpty]: Start isEmpty. Operand 143242 states and 178007 transitions. [2019-09-10 08:15:42,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-10 08:15:42,418 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:42,419 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:42,419 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:42,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:42,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1176577099, now seen corresponding path program 1 times [2019-09-10 08:15:42,419 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:42,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:42,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:42,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:42,420 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:42,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:42,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:15:42,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:42,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:15:42,526 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:42,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:15:42,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:15:42,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:15:42,526 INFO L87 Difference]: Start difference. First operand 143242 states and 178007 transitions. Second operand 5 states. [2019-09-10 08:15:42,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:42,879 INFO L93 Difference]: Finished difference Result 155708 states and 193797 transitions. [2019-09-10 08:15:42,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:15:42,879 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-10 08:15:42,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:43,019 INFO L225 Difference]: With dead ends: 155708 [2019-09-10 08:15:43,020 INFO L226 Difference]: Without dead ends: 155708 [2019-09-10 08:15:43,020 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:15:43,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155708 states. [2019-09-10 08:15:44,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155708 to 153544. [2019-09-10 08:15:44,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153544 states. [2019-09-10 08:15:44,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153544 states to 153544 states and 190675 transitions. [2019-09-10 08:15:44,452 INFO L78 Accepts]: Start accepts. Automaton has 153544 states and 190675 transitions. Word has length 232 [2019-09-10 08:15:44,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:44,452 INFO L475 AbstractCegarLoop]: Abstraction has 153544 states and 190675 transitions. [2019-09-10 08:15:44,452 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:15:44,453 INFO L276 IsEmpty]: Start isEmpty. Operand 153544 states and 190675 transitions. [2019-09-10 08:15:44,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-10 08:15:44,474 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:44,474 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:44,474 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:44,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:44,475 INFO L82 PathProgramCache]: Analyzing trace with hash -610387048, now seen corresponding path program 1 times [2019-09-10 08:15:44,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:44,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:44,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:44,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:44,476 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:44,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:44,586 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:15:44,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:44,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:15:44,587 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:44,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:15:44,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:15:44,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:15:44,587 INFO L87 Difference]: Start difference. First operand 153544 states and 190675 transitions. Second operand 5 states. [2019-09-10 08:15:45,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:45,505 INFO L93 Difference]: Finished difference Result 170942 states and 212337 transitions. [2019-09-10 08:15:45,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:15:45,505 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-10 08:15:45,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:45,655 INFO L225 Difference]: With dead ends: 170942 [2019-09-10 08:15:45,655 INFO L226 Difference]: Without dead ends: 170942 [2019-09-10 08:15:45,655 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:15:45,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170942 states. [2019-09-10 08:15:49,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170942 to 157145. [2019-09-10 08:15:49,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157145 states. [2019-09-10 08:15:49,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157145 states to 157145 states and 195315 transitions. [2019-09-10 08:15:49,586 INFO L78 Accepts]: Start accepts. Automaton has 157145 states and 195315 transitions. Word has length 232 [2019-09-10 08:15:49,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:49,587 INFO L475 AbstractCegarLoop]: Abstraction has 157145 states and 195315 transitions. [2019-09-10 08:15:49,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:15:49,587 INFO L276 IsEmpty]: Start isEmpty. Operand 157145 states and 195315 transitions. [2019-09-10 08:15:49,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-10 08:15:49,610 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:49,610 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:49,610 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:49,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:49,610 INFO L82 PathProgramCache]: Analyzing trace with hash 982506995, now seen corresponding path program 1 times [2019-09-10 08:15:49,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:49,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:49,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:49,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:49,611 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:49,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:49,794 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:15:49,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:49,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:15:49,795 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:49,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:15:49,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:15:49,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:15:49,796 INFO L87 Difference]: Start difference. First operand 157145 states and 195315 transitions. Second operand 8 states. [2019-09-10 08:15:51,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:51,091 INFO L93 Difference]: Finished difference Result 217546 states and 270917 transitions. [2019-09-10 08:15:51,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:15:51,092 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 232 [2019-09-10 08:15:51,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:51,310 INFO L225 Difference]: With dead ends: 217546 [2019-09-10 08:15:51,310 INFO L226 Difference]: Without dead ends: 217399 [2019-09-10 08:15:51,310 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:15:51,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217399 states. [2019-09-10 08:15:55,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217399 to 217389. [2019-09-10 08:15:55,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217389 states. [2019-09-10 08:15:55,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217389 states to 217389 states and 270759 transitions. [2019-09-10 08:15:55,756 INFO L78 Accepts]: Start accepts. Automaton has 217389 states and 270759 transitions. Word has length 232 [2019-09-10 08:15:55,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:55,757 INFO L475 AbstractCegarLoop]: Abstraction has 217389 states and 270759 transitions. [2019-09-10 08:15:55,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:15:55,757 INFO L276 IsEmpty]: Start isEmpty. Operand 217389 states and 270759 transitions. [2019-09-10 08:15:55,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-10 08:15:55,783 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:55,783 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:55,783 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:55,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:55,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1897582538, now seen corresponding path program 1 times [2019-09-10 08:15:55,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:55,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:55,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:55,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:55,785 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:55,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:55,917 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:15:55,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:55,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:15:55,917 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:55,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:15:55,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:15:55,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:15:55,919 INFO L87 Difference]: Start difference. First operand 217389 states and 270759 transitions. Second operand 4 states. [2019-09-10 08:15:56,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:56,906 INFO L93 Difference]: Finished difference Result 217757 states and 270573 transitions. [2019-09-10 08:15:56,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:15:56,907 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 232 [2019-09-10 08:15:56,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:57,102 INFO L225 Difference]: With dead ends: 217757 [2019-09-10 08:15:57,102 INFO L226 Difference]: Without dead ends: 216414 [2019-09-10 08:15:57,102 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:15:57,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216414 states. [2019-09-10 08:16:01,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216414 to 216175. [2019-09-10 08:16:01,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216175 states. [2019-09-10 08:16:01,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216175 states to 216175 states and 268991 transitions. [2019-09-10 08:16:01,947 INFO L78 Accepts]: Start accepts. Automaton has 216175 states and 268991 transitions. Word has length 232 [2019-09-10 08:16:01,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:01,947 INFO L475 AbstractCegarLoop]: Abstraction has 216175 states and 268991 transitions. [2019-09-10 08:16:01,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:16:01,947 INFO L276 IsEmpty]: Start isEmpty. Operand 216175 states and 268991 transitions. [2019-09-10 08:16:01,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-09-10 08:16:01,962 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:01,963 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:01,963 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:01,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:01,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1524136683, now seen corresponding path program 1 times [2019-09-10 08:16:01,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:01,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:01,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:01,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:01,964 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:01,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:02,078 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:16:02,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:02,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:16:02,079 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:02,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:16:02,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:16:02,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:16:02,080 INFO L87 Difference]: Start difference. First operand 216175 states and 268991 transitions. Second operand 6 states. [2019-09-10 08:16:03,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:03,321 INFO L93 Difference]: Finished difference Result 335064 states and 422277 transitions. [2019-09-10 08:16:03,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 08:16:03,322 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 235 [2019-09-10 08:16:03,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:03,680 INFO L225 Difference]: With dead ends: 335064 [2019-09-10 08:16:03,680 INFO L226 Difference]: Without dead ends: 335064 [2019-09-10 08:16:03,680 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:16:03,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335064 states. [2019-09-10 08:16:06,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335064 to 220911. [2019-09-10 08:16:06,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220911 states. [2019-09-10 08:16:07,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220911 states to 220911 states and 273407 transitions. [2019-09-10 08:16:07,799 INFO L78 Accepts]: Start accepts. Automaton has 220911 states and 273407 transitions. Word has length 235 [2019-09-10 08:16:07,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:07,799 INFO L475 AbstractCegarLoop]: Abstraction has 220911 states and 273407 transitions. [2019-09-10 08:16:07,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:16:07,799 INFO L276 IsEmpty]: Start isEmpty. Operand 220911 states and 273407 transitions. [2019-09-10 08:16:07,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-09-10 08:16:07,814 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:07,814 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:07,815 INFO L418 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:07,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:07,815 INFO L82 PathProgramCache]: Analyzing trace with hash -140717113, now seen corresponding path program 1 times [2019-09-10 08:16:07,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:07,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:07,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:07,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:07,816 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:07,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:07,886 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:16:07,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:07,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:16:07,886 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:07,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:16:07,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:16:07,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:16:07,887 INFO L87 Difference]: Start difference. First operand 220911 states and 273407 transitions. Second operand 3 states. [2019-09-10 08:16:08,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:08,533 INFO L93 Difference]: Finished difference Result 342769 states and 420864 transitions. [2019-09-10 08:16:08,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:16:08,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 236 [2019-09-10 08:16:08,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:08,884 INFO L225 Difference]: With dead ends: 342769 [2019-09-10 08:16:08,884 INFO L226 Difference]: Without dead ends: 342769 [2019-09-10 08:16:08,884 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:16:09,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342769 states. [2019-09-10 08:16:16,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342769 to 342767. [2019-09-10 08:16:16,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342767 states. [2019-09-10 08:16:16,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342767 states to 342767 states and 420863 transitions. [2019-09-10 08:16:16,509 INFO L78 Accepts]: Start accepts. Automaton has 342767 states and 420863 transitions. Word has length 236 [2019-09-10 08:16:16,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:16,509 INFO L475 AbstractCegarLoop]: Abstraction has 342767 states and 420863 transitions. [2019-09-10 08:16:16,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:16:16,509 INFO L276 IsEmpty]: Start isEmpty. Operand 342767 states and 420863 transitions. [2019-09-10 08:16:16,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-09-10 08:16:16,570 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:16,571 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:16,571 INFO L418 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:16,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:16,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1583901728, now seen corresponding path program 1 times [2019-09-10 08:16:16,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:16,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:16,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:16,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:16,572 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:16,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:17,787 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:16:17,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:16:17,787 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:16:17,788 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 268 with the following transitions: [2019-09-10 08:16:17,790 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [122], [125], [128], [141], [154], [167], [180], [193], [206], [209], [216], [218], [222], [225], [228], [231], [234], [236], [238], [241], [244], [247], [249], [251], [254], [257], [260], [262], [264], [267], [270], [273], [275], [277], [280], [283], [286], [288], [290], [293], [296], [299], [301], [303], [306], [313], [315], [319], [322], [335], [348], [361], [374], [387], [400], [403], [410], [412], [416], [419], [422], [425], [428], [430], [432], [435], [438], [441], [443], [445], [448], [451], [454], [456], [458], [461], [464], [467], [469], [471], [474], [477], [480], [482], [484], [487], [490], [493], [495], [497], [500], [507], [509], [513], [515], [518], [521], [529], [531], [534], [542], [544], [547], [555], [557], [560], [568], [570], [573], [581], [583], [586], [594], [596], [599], [602], [606], [608], [611], [612], [614], [616], [621], [623], [626], [639], [641], [644], [647], [649], [664], [666], [669], [672], [674], [689], [691], [694], [697], [699], [714], [716], [719], [722], [724], [739], [741], [744], [747], [749], [764], [766], [769], [772], [774], [790], [793], [957], [960], [975], [978], [981], [983], [1000], [1003], [1006], [1008], [1025], [1028], [1031], [1033], [1050], [1053], [1056], [1058], [1075], [1078], [1081], [1083], [1100], [1103], [1106], [1108], [1124], [1127], [1291], [1294], [1309], [1312], [1315], [1317], [1334], [1337], [1340], [1342], [1359], [1362], [1365], [1367], [1384], [1387], [1390], [1392], [1409], [1412], [1415], [1417], [1434], [1437], [1440], [1442], [1533], [1534], [1538], [1539], [1540] [2019-09-10 08:16:17,840 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:16:17,841 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:16:18,006 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:16:19,489 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:16:19,494 INFO L272 AbstractInterpreter]: Visited 257 different actions 1217 times. Merged at 61 different actions 829 times. Widened at 27 different actions 161 times. Performed 4404 root evaluator evaluations with a maximum evaluation depth of 8. Performed 4404 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 136 fixpoints after 27 different actions. Largest state had 218 variables. [2019-09-10 08:16:19,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:19,500 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:16:19,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:16:19,501 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:16:19,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:19,529 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:16:19,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:19,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 1429 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 08:16:19,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:16:20,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:16:20,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:16:20,992 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:16:20,992 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:16:21,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:16:21,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:16:21,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:16:21,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:16:21,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:16:21,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:16:21,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:16:21,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:16:21,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:16:21,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:16:21,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:16:21,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:16:21,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:16:21,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:16:21,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:16:21,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:16:21,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:16:21,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:16:21,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:16:21,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:16:21,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:16:28,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:16:29,012 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:16:29,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:16:29,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 31 [2019-09-10 08:16:29,017 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:16:29,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:16:29,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:16:29,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=835, Unknown=0, NotChecked=0, Total=930 [2019-09-10 08:16:29,019 INFO L87 Difference]: Start difference. First operand 342767 states and 420863 transitions. Second operand 21 states. [2019-09-10 08:16:29,431 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-09-10 08:16:30,649 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-09-10 08:16:32,866 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-10 08:16:33,221 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-09-10 08:16:33,974 WARN L188 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2019-09-10 08:16:34,243 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2019-09-10 08:16:34,623 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2019-09-10 08:16:34,934 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 68 [2019-09-10 08:16:35,571 WARN L188 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 78 [2019-09-10 08:16:35,951 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 83 [2019-09-10 08:16:36,273 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2019-09-10 08:16:36,674 WARN L188 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 80 [2019-09-10 08:16:37,360 WARN L188 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 89 [2019-09-10 08:16:37,870 WARN L188 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 92 [2019-09-10 08:16:38,519 WARN L188 SmtUtils]: Spent 582.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 74 [2019-09-10 08:16:38,936 WARN L188 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 77 [2019-09-10 08:16:39,519 WARN L188 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 92 [2019-09-10 08:16:40,039 WARN L188 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 80 [2019-09-10 08:16:40,376 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 77 [2019-09-10 08:16:41,166 WARN L188 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2019-09-10 08:16:41,700 WARN L188 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2019-09-10 08:16:42,179 WARN L188 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 92 [2019-09-10 08:16:43,438 WARN L188 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2019-09-10 08:16:43,838 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 80 [2019-09-10 08:16:46,269 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2019-09-10 08:16:47,552 WARN L188 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 89 [2019-09-10 08:16:47,869 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 74 [2019-09-10 08:16:48,437 WARN L188 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 84 [2019-09-10 08:16:48,983 WARN L188 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 92 [2019-09-10 08:16:49,460 WARN L188 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 77 [2019-09-10 08:16:49,835 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2019-09-10 08:16:50,404 WARN L188 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 89 [2019-09-10 08:16:50,804 WARN L188 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 74 [2019-09-10 08:16:51,294 WARN L188 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 84 [2019-09-10 08:16:51,670 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 83 [2019-09-10 08:16:52,059 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2019-09-10 08:16:52,456 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2019-09-10 08:16:53,127 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2019-09-10 08:16:53,550 WARN L188 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2019-09-10 08:16:58,141 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2019-09-10 08:16:59,375 WARN L188 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2019-09-10 08:17:00,006 WARN L188 SmtUtils]: Spent 517.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 82 [2019-09-10 08:17:00,371 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 84 [2019-09-10 08:17:00,765 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2019-09-10 08:17:01,217 WARN L188 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 79 [2019-09-10 08:17:01,721 WARN L188 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 84 [2019-09-10 08:17:02,238 WARN L188 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 96 [2019-09-10 08:17:02,723 WARN L188 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 87 [2019-09-10 08:17:03,158 WARN L188 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 93 [2019-09-10 08:17:03,727 WARN L188 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 92 [2019-09-10 08:17:04,148 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 83 [2019-09-10 08:17:04,699 WARN L188 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 89 [2019-09-10 08:17:06,601 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 86 [2019-09-10 08:17:07,056 WARN L188 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 71 [2019-09-10 08:17:07,657 WARN L188 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 95 [2019-09-10 08:17:08,328 WARN L188 SmtUtils]: Spent 586.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 80 [2019-09-10 08:17:10,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:10,964 INFO L93 Difference]: Finished difference Result 1978515 states and 2383848 transitions. [2019-09-10 08:17:10,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-10 08:17:10,965 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 267 [2019-09-10 08:17:10,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:15,643 INFO L225 Difference]: With dead ends: 1978515 [2019-09-10 08:17:15,643 INFO L226 Difference]: Without dead ends: 1978515 [2019-09-10 08:17:15,644 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 604 GetRequests, 372 SyntacticMatches, 144 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4175 ImplicationChecksByTransitivity, 32.8s TimeCoverageRelationStatistics Valid=1861, Invalid=6149, Unknown=0, NotChecked=0, Total=8010 [2019-09-10 08:17:16,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1978515 states. [2019-09-10 08:17:45,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1978515 to 1046209. [2019-09-10 08:17:45,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1046209 states. [2019-09-10 08:18:02,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046209 states to 1046209 states and 1267290 transitions. [2019-09-10 08:18:02,804 INFO L78 Accepts]: Start accepts. Automaton has 1046209 states and 1267290 transitions. Word has length 267 [2019-09-10 08:18:02,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:18:02,804 INFO L475 AbstractCegarLoop]: Abstraction has 1046209 states and 1267290 transitions. [2019-09-10 08:18:02,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:18:02,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1046209 states and 1267290 transitions. [2019-09-10 08:18:02,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-09-10 08:18:02,972 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:18:02,972 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:02,973 INFO L418 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:18:02,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:18:02,973 INFO L82 PathProgramCache]: Analyzing trace with hash -63508637, now seen corresponding path program 1 times [2019-09-10 08:18:02,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:18:02,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:02,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:18:02,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:02,975 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:18:03,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:18:03,439 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:18:03,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:18:03,439 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:18:03,439 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 269 with the following transitions: [2019-09-10 08:18:03,440 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [122], [125], [128], [141], [154], [167], [180], [193], [206], [209], [216], [218], [222], [225], [228], [231], [234], [236], [238], [241], [244], [247], [249], [251], [254], [257], [260], [262], [264], [267], [270], [273], [275], [277], [280], [283], [288], [290], [293], [296], [299], [301], [303], [306], [313], [315], [319], [322], [335], [348], [361], [374], [387], [400], [403], [410], [412], [416], [419], [422], [425], [428], [430], [432], [435], [438], [441], [443], [445], [448], [451], [454], [456], [458], [461], [464], [467], [469], [471], [474], [477], [482], [484], [487], [490], [493], [495], [497], [500], [503], [509], [513], [515], [518], [521], [529], [531], [534], [537], [542], [544], [547], [555], [557], [560], [568], [570], [573], [581], [583], [586], [594], [596], [599], [602], [608], [611], [612], [614], [616], [619], [630], [639], [641], [644], [647], [649], [664], [666], [669], [672], [674], [689], [691], [694], [697], [699], [714], [716], [719], [722], [724], [732], [735], [741], [744], [747], [749], [764], [766], [769], [772], [774], [783], [786], [824], [827], [957], [960], [975], [978], [981], [983], [1000], [1003], [1006], [1008], [1025], [1028], [1031], [1033], [1050], [1053], [1056], [1058], [1075], [1078], [1081], [1083], [1100], [1103], [1106], [1108], [1124], [1127], [1158], [1163], [1291], [1294], [1309], [1312], [1315], [1317], [1334], [1337], [1340], [1342], [1359], [1362], [1365], [1367], [1384], [1387], [1390], [1392], [1409], [1412], [1415], [1417], [1434], [1437], [1440], [1442], [1533], [1534], [1538], [1539], [1540] [2019-09-10 08:18:03,447 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:18:03,448 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:18:03,487 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:18:04,453 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:18:04,454 INFO L272 AbstractInterpreter]: Visited 259 different actions 1051 times. Merged at 61 different actions 686 times. Widened at 24 different actions 114 times. Performed 3904 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3904 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 90 fixpoints after 22 different actions. Largest state had 218 variables. [2019-09-10 08:18:04,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:18:04,455 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:18:04,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:18:04,455 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:18:04,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:18:04,470 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:18:04,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:18:04,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 1431 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 08:18:04,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:18:04,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:18:06,495 WARN L188 SmtUtils]: Spent 1.66 s on a formula simplification that was a NOOP. DAG size: 19 [2019-09-10 08:18:06,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:18:06,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:18:06,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:18:06,931 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:18:06,932 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:18:06,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:18:07,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:18:07,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:18:07,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:18:07,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:18:09,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:18:09,604 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:18:09,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:18:09,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 34 [2019-09-10 08:18:09,608 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:18:09,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 08:18:09,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 08:18:09,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1005, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 08:18:09,610 INFO L87 Difference]: Start difference. First operand 1046209 states and 1267290 transitions. Second operand 23 states. [2019-09-10 08:18:13,284 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 43 [2019-09-10 08:18:13,940 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 45 [2019-09-10 08:18:14,135 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 42 [2019-09-10 08:18:15,170 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 51 [2019-09-10 08:18:15,389 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 54 [2019-09-10 08:18:15,548 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:18:15,730 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:18:16,142 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 58 [2019-09-10 08:18:16,371 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 60 [2019-09-10 08:18:16,518 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 46 [2019-09-10 08:18:16,697 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2019-09-10 08:18:17,350 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 60 [2019-09-10 08:18:17,509 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2019-09-10 08:18:17,676 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:18:18,610 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2019-09-10 08:18:19,000 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2019-09-10 08:18:19,364 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 60 [2019-09-10 08:18:19,751 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2019-09-10 08:18:19,939 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:18:20,182 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 51 [2019-09-10 08:18:21,017 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:18:21,821 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 62 [2019-09-10 08:18:22,002 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2019-09-10 08:18:23,042 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 59 [2019-09-10 08:18:23,208 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:18:23,515 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-09-10 08:18:24,517 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-09-10 08:18:24,958 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 58 [2019-09-10 08:18:42,306 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:18:43,035 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-10 08:18:44,596 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:18:45,054 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 65 [2019-09-10 08:18:45,263 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:18:45,493 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:18:46,164 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:18:46,400 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 62 [2019-09-10 08:18:46,615 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2019-09-10 08:18:47,033 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:18:47,238 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-09-10 08:18:49,588 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 62 [2019-09-10 08:18:49,754 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2019-09-10 08:18:50,464 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 64 [2019-09-10 08:18:50,637 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 52