java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:10:24,417 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:10:24,419 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:10:24,430 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:10:24,431 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:10:24,432 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:10:24,433 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:10:24,435 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:10:24,436 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:10:24,437 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:10:24,438 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:10:24,439 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:10:24,439 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:10:24,440 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:10:24,441 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:10:24,442 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:10:24,443 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:10:24,444 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:10:24,445 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:10:24,447 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:10:24,449 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:10:24,450 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:10:24,451 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:10:24,451 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:10:24,453 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:10:24,454 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:10:24,454 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:10:24,455 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:10:24,455 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:10:24,456 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:10:24,456 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:10:24,457 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:10:24,458 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:10:24,459 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:10:24,460 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:10:24,460 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:10:24,460 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:10:24,461 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:10:24,461 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:10:24,462 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:10:24,462 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:10:24,463 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 06:10:24,477 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:10:24,478 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:10:24,478 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:10:24,478 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:10:24,479 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:10:24,479 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:10:24,479 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:10:24,479 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:10:24,480 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:10:24,480 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:10:24,480 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:10:24,481 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:10:24,481 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:10:24,481 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:10:24,481 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:10:24,481 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:10:24,481 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:10:24,482 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:10:24,482 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:10:24,482 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:10:24,482 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:10:24,482 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:10:24,483 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:10:24,483 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:10:24,483 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:10:24,483 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:10:24,483 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:10:24,484 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:10:24,484 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:10:24,484 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:10:24,511 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:10:24,523 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:10:24,527 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:10:24,528 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:10:24,529 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:10:24,529 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-09-10 06:10:24,603 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec8969ee7/bb8cd4b510964c5c9ac20fcbb47c1195/FLAG4965f11dd [2019-09-10 06:10:25,146 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:10:25,146 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-09-10 06:10:25,164 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec8969ee7/bb8cd4b510964c5c9ac20fcbb47c1195/FLAG4965f11dd [2019-09-10 06:10:25,458 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec8969ee7/bb8cd4b510964c5c9ac20fcbb47c1195 [2019-09-10 06:10:25,467 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:10:25,468 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:10:25,472 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:10:25,472 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:10:25,476 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:10:25,477 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:10:25" (1/1) ... [2019-09-10 06:10:25,481 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10822750 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:10:25, skipping insertion in model container [2019-09-10 06:10:25,481 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:10:25" (1/1) ... [2019-09-10 06:10:25,489 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:10:25,568 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:10:26,183 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:10:26,195 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:10:26,611 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:10:26,644 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:10:26,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:10:26 WrapperNode [2019-09-10 06:10:26,645 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:10:26,646 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:10:26,646 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:10:26,646 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:10:26,661 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:10:26" (1/1) ... [2019-09-10 06:10:26,661 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:10:26" (1/1) ... [2019-09-10 06:10:26,681 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:10:26" (1/1) ... [2019-09-10 06:10:26,682 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:10:26" (1/1) ... [2019-09-10 06:10:26,712 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:10:26" (1/1) ... [2019-09-10 06:10:26,750 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:10:26" (1/1) ... [2019-09-10 06:10:26,759 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:10:26" (1/1) ... [2019-09-10 06:10:26,782 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:10:26,782 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:10:26,783 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:10:26,783 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:10:26,787 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:10:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:10:26,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:10:26,883 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:10:26,883 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:10:26,884 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:10:26,884 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:10:26,884 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:10:26,884 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:10:26,885 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:10:26,885 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:10:26,885 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:10:26,886 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:10:26,886 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:10:26,886 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:10:26,886 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:10:26,886 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:10:26,887 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:10:26,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:10:26,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:10:28,676 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:10:28,676 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:10:28,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:10:28 BoogieIcfgContainer [2019-09-10 06:10:28,679 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:10:28,679 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:10:28,680 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:10:28,683 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:10:28,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:10:25" (1/3) ... [2019-09-10 06:10:28,684 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18a23848 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:10:28, skipping insertion in model container [2019-09-10 06:10:28,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:10:26" (2/3) ... [2019-09-10 06:10:28,684 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18a23848 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:10:28, skipping insertion in model container [2019-09-10 06:10:28,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:10:28" (3/3) ... [2019-09-10 06:10:28,691 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-09-10 06:10:28,699 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:10:28,712 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-09-10 06:10:28,730 INFO L252 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-09-10 06:10:28,753 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:10:28,753 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:10:28,753 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:10:28,753 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:10:28,753 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:10:28,754 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:10:28,754 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:10:28,754 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:10:28,788 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states. [2019-09-10 06:10:28,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-10 06:10:28,809 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:28,810 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:10:28,812 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:28,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:28,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1367025055, now seen corresponding path program 1 times [2019-09-10 06:10:28,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:28,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:28,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:28,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:28,866 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:29,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:29,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:10:29,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:29,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:10:29,506 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:29,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:10:29,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:10:29,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:10:29,529 INFO L87 Difference]: Start difference. First operand 382 states. Second operand 3 states. [2019-09-10 06:10:29,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:29,773 INFO L93 Difference]: Finished difference Result 580 states and 1025 transitions. [2019-09-10 06:10:29,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:10:29,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2019-09-10 06:10:29,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:29,797 INFO L225 Difference]: With dead ends: 580 [2019-09-10 06:10:29,797 INFO L226 Difference]: Without dead ends: 572 [2019-09-10 06:10:29,799 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:10:29,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2019-09-10 06:10:29,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 570. [2019-09-10 06:10:29,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2019-09-10 06:10:29,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 838 transitions. [2019-09-10 06:10:29,877 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 838 transitions. Word has length 143 [2019-09-10 06:10:29,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:29,879 INFO L475 AbstractCegarLoop]: Abstraction has 570 states and 838 transitions. [2019-09-10 06:10:29,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:10:29,879 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 838 transitions. [2019-09-10 06:10:29,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-10 06:10:29,884 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:29,884 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:10:29,885 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:29,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:29,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1366686431, now seen corresponding path program 1 times [2019-09-10 06:10:29,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:29,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:29,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:29,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:29,888 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:30,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:30,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:10:30,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:30,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:10:30,279 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:30,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:10:30,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:10:30,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:10:30,284 INFO L87 Difference]: Start difference. First operand 570 states and 838 transitions. Second operand 4 states. [2019-09-10 06:10:30,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:30,403 INFO L93 Difference]: Finished difference Result 1103 states and 1604 transitions. [2019-09-10 06:10:30,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:10:30,405 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2019-09-10 06:10:30,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:30,412 INFO L225 Difference]: With dead ends: 1103 [2019-09-10 06:10:30,412 INFO L226 Difference]: Without dead ends: 1103 [2019-09-10 06:10:30,413 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 06:10:30,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2019-09-10 06:10:30,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 1067. [2019-09-10 06:10:30,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1067 states. [2019-09-10 06:10:30,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 1564 transitions. [2019-09-10 06:10:30,510 INFO L78 Accepts]: Start accepts. Automaton has 1067 states and 1564 transitions. Word has length 143 [2019-09-10 06:10:30,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:30,513 INFO L475 AbstractCegarLoop]: Abstraction has 1067 states and 1564 transitions. [2019-09-10 06:10:30,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:10:30,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1564 transitions. [2019-09-10 06:10:30,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 06:10:30,524 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:30,525 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:10:30,526 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:30,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:30,527 INFO L82 PathProgramCache]: Analyzing trace with hash 280277689, now seen corresponding path program 1 times [2019-09-10 06:10:30,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:30,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:30,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:30,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:30,530 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:30,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:30,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:10:30,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:30,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:10:30,643 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:30,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:10:30,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:10:30,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:10:30,646 INFO L87 Difference]: Start difference. First operand 1067 states and 1564 transitions. Second operand 3 states. [2019-09-10 06:10:30,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:30,679 INFO L93 Difference]: Finished difference Result 2120 states and 3107 transitions. [2019-09-10 06:10:30,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:10:30,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2019-09-10 06:10:30,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:30,697 INFO L225 Difference]: With dead ends: 2120 [2019-09-10 06:10:30,706 INFO L226 Difference]: Without dead ends: 2120 [2019-09-10 06:10:30,706 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:10:30,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2120 states. [2019-09-10 06:10:30,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2120 to 1069. [2019-09-10 06:10:30,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1069 states. [2019-09-10 06:10:30,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 1566 transitions. [2019-09-10 06:10:30,756 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 1566 transitions. Word has length 144 [2019-09-10 06:10:30,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:30,756 INFO L475 AbstractCegarLoop]: Abstraction has 1069 states and 1566 transitions. [2019-09-10 06:10:30,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:10:30,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1566 transitions. [2019-09-10 06:10:30,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-10 06:10:30,760 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:30,760 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:10:30,760 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:30,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:30,761 INFO L82 PathProgramCache]: Analyzing trace with hash 421615650, now seen corresponding path program 1 times [2019-09-10 06:10:30,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:30,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:30,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:30,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:30,764 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:30,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:30,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 06:10:30,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:30,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:10:30,906 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:30,906 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:10:30,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:10:30,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:10:30,907 INFO L87 Difference]: Start difference. First operand 1069 states and 1566 transitions. Second operand 3 states. [2019-09-10 06:10:30,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:30,976 INFO L93 Difference]: Finished difference Result 2070 states and 3002 transitions. [2019-09-10 06:10:30,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:10:30,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2019-09-10 06:10:30,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:30,988 INFO L225 Difference]: With dead ends: 2070 [2019-09-10 06:10:30,988 INFO L226 Difference]: Without dead ends: 2070 [2019-09-10 06:10:30,989 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:10:30,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2070 states. [2019-09-10 06:10:31,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2070 to 2034. [2019-09-10 06:10:31,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2034 states. [2019-09-10 06:10:31,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2034 states to 2034 states and 2962 transitions. [2019-09-10 06:10:31,069 INFO L78 Accepts]: Start accepts. Automaton has 2034 states and 2962 transitions. Word has length 145 [2019-09-10 06:10:31,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:31,070 INFO L475 AbstractCegarLoop]: Abstraction has 2034 states and 2962 transitions. [2019-09-10 06:10:31,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:10:31,070 INFO L276 IsEmpty]: Start isEmpty. Operand 2034 states and 2962 transitions. [2019-09-10 06:10:31,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-10 06:10:31,075 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:31,075 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] [2019-09-10 06:10:31,075 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:31,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:31,076 INFO L82 PathProgramCache]: Analyzing trace with hash 526087461, now seen corresponding path program 1 times [2019-09-10 06:10:31,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:31,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:31,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:31,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:31,078 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:31,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:31,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:10:31,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:31,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:10:31,262 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:31,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:10:31,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:10:31,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:10:31,263 INFO L87 Difference]: Start difference. First operand 2034 states and 2962 transitions. Second operand 4 states. [2019-09-10 06:10:31,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:31,307 INFO L93 Difference]: Finished difference Result 1622 states and 2348 transitions. [2019-09-10 06:10:31,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:10:31,308 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-09-10 06:10:31,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:31,316 INFO L225 Difference]: With dead ends: 1622 [2019-09-10 06:10:31,317 INFO L226 Difference]: Without dead ends: 1562 [2019-09-10 06:10:31,317 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 06:10:31,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1562 states. [2019-09-10 06:10:31,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1562 to 1562. [2019-09-10 06:10:31,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1562 states. [2019-09-10 06:10:31,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1562 states to 1562 states and 2262 transitions. [2019-09-10 06:10:31,369 INFO L78 Accepts]: Start accepts. Automaton has 1562 states and 2262 transitions. Word has length 145 [2019-09-10 06:10:31,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:31,370 INFO L475 AbstractCegarLoop]: Abstraction has 1562 states and 2262 transitions. [2019-09-10 06:10:31,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:10:31,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1562 states and 2262 transitions. [2019-09-10 06:10:31,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-10 06:10:31,375 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:31,376 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 06:10:31,376 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:31,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:31,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1901734011, now seen corresponding path program 1 times [2019-09-10 06:10:31,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:31,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:31,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:31,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:31,381 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:31,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:31,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:10:31,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:31,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:10:31,606 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:31,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:10:31,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:10:31,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:10:31,607 INFO L87 Difference]: Start difference. First operand 1562 states and 2262 transitions. Second operand 5 states. [2019-09-10 06:10:32,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:32,158 INFO L93 Difference]: Finished difference Result 2462 states and 3575 transitions. [2019-09-10 06:10:32,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:10:32,158 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 151 [2019-09-10 06:10:32,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:32,170 INFO L225 Difference]: With dead ends: 2462 [2019-09-10 06:10:32,170 INFO L226 Difference]: Without dead ends: 2462 [2019-09-10 06:10:32,171 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:10:32,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2462 states. [2019-09-10 06:10:32,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2462 to 2460. [2019-09-10 06:10:32,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2460 states. [2019-09-10 06:10:32,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2460 states to 2460 states and 3574 transitions. [2019-09-10 06:10:32,231 INFO L78 Accepts]: Start accepts. Automaton has 2460 states and 3574 transitions. Word has length 151 [2019-09-10 06:10:32,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:32,231 INFO L475 AbstractCegarLoop]: Abstraction has 2460 states and 3574 transitions. [2019-09-10 06:10:32,231 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:10:32,232 INFO L276 IsEmpty]: Start isEmpty. Operand 2460 states and 3574 transitions. [2019-09-10 06:10:32,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-10 06:10:32,236 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:32,237 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 06:10:32,237 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:32,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:32,238 INFO L82 PathProgramCache]: Analyzing trace with hash 409413755, now seen corresponding path program 1 times [2019-09-10 06:10:32,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:32,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:32,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:32,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:32,240 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:32,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:32,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:10:32,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:32,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:10:32,415 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:32,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:10:32,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:10:32,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:10:32,417 INFO L87 Difference]: Start difference. First operand 2460 states and 3574 transitions. Second operand 4 states. [2019-09-10 06:10:32,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:32,575 INFO L93 Difference]: Finished difference Result 4296 states and 6271 transitions. [2019-09-10 06:10:32,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:10:32,576 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-09-10 06:10:32,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:32,597 INFO L225 Difference]: With dead ends: 4296 [2019-09-10 06:10:32,597 INFO L226 Difference]: Without dead ends: 4296 [2019-09-10 06:10:32,598 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:10:32,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4296 states. [2019-09-10 06:10:32,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4296 to 4294. [2019-09-10 06:10:32,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4294 states. [2019-09-10 06:10:32,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4294 states to 4294 states and 6270 transitions. [2019-09-10 06:10:32,703 INFO L78 Accepts]: Start accepts. Automaton has 4294 states and 6270 transitions. Word has length 151 [2019-09-10 06:10:32,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:32,704 INFO L475 AbstractCegarLoop]: Abstraction has 4294 states and 6270 transitions. [2019-09-10 06:10:32,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:10:32,704 INFO L276 IsEmpty]: Start isEmpty. Operand 4294 states and 6270 transitions. [2019-09-10 06:10:32,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-10 06:10:32,711 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:32,711 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 06:10:32,712 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:32,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:32,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1545001486, now seen corresponding path program 1 times [2019-09-10 06:10:32,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:32,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:32,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:32,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:32,715 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:32,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:32,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 06:10:32,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:32,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:10:32,968 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:32,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:10:32,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:10:32,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:10:32,970 INFO L87 Difference]: Start difference. First operand 4294 states and 6270 transitions. Second operand 4 states. [2019-09-10 06:10:33,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:33,103 INFO L93 Difference]: Finished difference Result 6904 states and 9946 transitions. [2019-09-10 06:10:33,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:10:33,104 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-09-10 06:10:33,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:33,134 INFO L225 Difference]: With dead ends: 6904 [2019-09-10 06:10:33,135 INFO L226 Difference]: Without dead ends: 6904 [2019-09-10 06:10:33,135 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 06:10:33,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6904 states. [2019-09-10 06:10:33,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6904 to 6874. [2019-09-10 06:10:33,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6874 states. [2019-09-10 06:10:33,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6874 states to 6874 states and 9916 transitions. [2019-09-10 06:10:33,305 INFO L78 Accepts]: Start accepts. Automaton has 6874 states and 9916 transitions. Word has length 151 [2019-09-10 06:10:33,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:33,306 INFO L475 AbstractCegarLoop]: Abstraction has 6874 states and 9916 transitions. [2019-09-10 06:10:33,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:10:33,306 INFO L276 IsEmpty]: Start isEmpty. Operand 6874 states and 9916 transitions. [2019-09-10 06:10:33,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-10 06:10:33,320 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:33,320 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:10:33,323 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:33,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:33,323 INFO L82 PathProgramCache]: Analyzing trace with hash 749367939, now seen corresponding path program 1 times [2019-09-10 06:10:33,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:33,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:33,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:33,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:33,325 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:33,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:33,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:10:33,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:33,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:10:33,445 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:33,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:10:33,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:10:33,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:10:33,446 INFO L87 Difference]: Start difference. First operand 6874 states and 9916 transitions. Second operand 3 states. [2019-09-10 06:10:33,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:33,539 INFO L93 Difference]: Finished difference Result 11763 states and 16665 transitions. [2019-09-10 06:10:33,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:10:33,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-09-10 06:10:33,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:33,579 INFO L225 Difference]: With dead ends: 11763 [2019-09-10 06:10:33,579 INFO L226 Difference]: Without dead ends: 11763 [2019-09-10 06:10:33,579 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:10:33,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11763 states. [2019-09-10 06:10:33,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11763 to 11737. [2019-09-10 06:10:33,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11737 states. [2019-09-10 06:10:33,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11737 states to 11737 states and 16643 transitions. [2019-09-10 06:10:33,858 INFO L78 Accepts]: Start accepts. Automaton has 11737 states and 16643 transitions. Word has length 153 [2019-09-10 06:10:33,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:33,859 INFO L475 AbstractCegarLoop]: Abstraction has 11737 states and 16643 transitions. [2019-09-10 06:10:33,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:10:33,859 INFO L276 IsEmpty]: Start isEmpty. Operand 11737 states and 16643 transitions. [2019-09-10 06:10:33,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-10 06:10:33,874 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:33,875 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:10:33,875 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:33,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:33,876 INFO L82 PathProgramCache]: Analyzing trace with hash -758283962, now seen corresponding path program 1 times [2019-09-10 06:10:33,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:33,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:33,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:33,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:33,877 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:33,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:34,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:10:34,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:34,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:10:34,038 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:34,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:10:34,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:10:34,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:10:34,039 INFO L87 Difference]: Start difference. First operand 11737 states and 16643 transitions. Second operand 4 states. [2019-09-10 06:10:34,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:34,100 INFO L93 Difference]: Finished difference Result 10763 states and 15289 transitions. [2019-09-10 06:10:34,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:10:34,101 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-09-10 06:10:34,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:34,121 INFO L225 Difference]: With dead ends: 10763 [2019-09-10 06:10:34,121 INFO L226 Difference]: Without dead ends: 10715 [2019-09-10 06:10:34,122 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 06:10:34,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10715 states. [2019-09-10 06:10:34,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10715 to 10715. [2019-09-10 06:10:34,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10715 states. [2019-09-10 06:10:34,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10715 states to 10715 states and 15226 transitions. [2019-09-10 06:10:34,286 INFO L78 Accepts]: Start accepts. Automaton has 10715 states and 15226 transitions. Word has length 153 [2019-09-10 06:10:34,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:34,286 INFO L475 AbstractCegarLoop]: Abstraction has 10715 states and 15226 transitions. [2019-09-10 06:10:34,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:10:34,286 INFO L276 IsEmpty]: Start isEmpty. Operand 10715 states and 15226 transitions. [2019-09-10 06:10:34,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-10 06:10:34,300 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:34,301 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:10:34,301 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:34,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:34,302 INFO L82 PathProgramCache]: Analyzing trace with hash 806407937, now seen corresponding path program 1 times [2019-09-10 06:10:34,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:34,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:34,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:34,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:34,303 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:34,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:34,622 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 18 [2019-09-10 06:10:34,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:10:34,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:34,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 06:10:34,703 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:34,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 06:10:34,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 06:10:34,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:10:34,705 INFO L87 Difference]: Start difference. First operand 10715 states and 15226 transitions. Second operand 8 states. [2019-09-10 06:10:35,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:35,573 INFO L93 Difference]: Finished difference Result 17569 states and 25731 transitions. [2019-09-10 06:10:35,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 06:10:35,574 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 159 [2019-09-10 06:10:35,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:35,622 INFO L225 Difference]: With dead ends: 17569 [2019-09-10 06:10:35,622 INFO L226 Difference]: Without dead ends: 17569 [2019-09-10 06:10:35,624 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:10:35,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17569 states. [2019-09-10 06:10:35,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17569 to 16970. [2019-09-10 06:10:35,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16970 states. [2019-09-10 06:10:35,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16970 states to 16970 states and 24854 transitions. [2019-09-10 06:10:35,885 INFO L78 Accepts]: Start accepts. Automaton has 16970 states and 24854 transitions. Word has length 159 [2019-09-10 06:10:35,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:35,885 INFO L475 AbstractCegarLoop]: Abstraction has 16970 states and 24854 transitions. [2019-09-10 06:10:35,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 06:10:35,886 INFO L276 IsEmpty]: Start isEmpty. Operand 16970 states and 24854 transitions. [2019-09-10 06:10:35,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-10 06:10:35,905 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:35,906 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:10:35,906 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:35,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:35,907 INFO L82 PathProgramCache]: Analyzing trace with hash -991704476, now seen corresponding path program 1 times [2019-09-10 06:10:35,907 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:35,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:35,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:35,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:35,910 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:36,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:36,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:10:36,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:36,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:10:36,638 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:36,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:10:36,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:10:36,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:10:36,639 INFO L87 Difference]: Start difference. First operand 16970 states and 24854 transitions. Second operand 4 states. [2019-09-10 06:10:36,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:36,863 INFO L93 Difference]: Finished difference Result 32740 states and 47356 transitions. [2019-09-10 06:10:36,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:10:36,864 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-09-10 06:10:36,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:36,956 INFO L225 Difference]: With dead ends: 32740 [2019-09-10 06:10:36,956 INFO L226 Difference]: Without dead ends: 32740 [2019-09-10 06:10:36,957 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:10:36,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32740 states. [2019-09-10 06:10:37,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32740 to 32684. [2019-09-10 06:10:37,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32684 states. [2019-09-10 06:10:37,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32684 states to 32684 states and 47291 transitions. [2019-09-10 06:10:37,582 INFO L78 Accepts]: Start accepts. Automaton has 32684 states and 47291 transitions. Word has length 159 [2019-09-10 06:10:37,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:37,583 INFO L475 AbstractCegarLoop]: Abstraction has 32684 states and 47291 transitions. [2019-09-10 06:10:37,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:10:37,583 INFO L276 IsEmpty]: Start isEmpty. Operand 32684 states and 47291 transitions. [2019-09-10 06:10:37,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-10 06:10:37,615 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:37,615 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] [2019-09-10 06:10:37,615 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:37,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:37,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1237700668, now seen corresponding path program 1 times [2019-09-10 06:10:37,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:37,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:37,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:37,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:37,618 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:37,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:37,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:10:37,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:37,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:10:37,680 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:37,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:10:37,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:10:37,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:10:37,681 INFO L87 Difference]: Start difference. First operand 32684 states and 47291 transitions. Second operand 3 states. [2019-09-10 06:10:37,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:37,886 INFO L93 Difference]: Finished difference Result 65280 states and 94468 transitions. [2019-09-10 06:10:37,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:10:37,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2019-09-10 06:10:37,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:38,068 INFO L225 Difference]: With dead ends: 65280 [2019-09-10 06:10:38,069 INFO L226 Difference]: Without dead ends: 65280 [2019-09-10 06:10:38,069 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:10:38,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65280 states. [2019-09-10 06:10:38,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65280 to 32690. [2019-09-10 06:10:38,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32690 states. [2019-09-10 06:10:39,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32690 states to 32690 states and 47297 transitions. [2019-09-10 06:10:39,016 INFO L78 Accepts]: Start accepts. Automaton has 32690 states and 47297 transitions. Word has length 160 [2019-09-10 06:10:39,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:39,016 INFO L475 AbstractCegarLoop]: Abstraction has 32690 states and 47297 transitions. [2019-09-10 06:10:39,016 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:10:39,017 INFO L276 IsEmpty]: Start isEmpty. Operand 32690 states and 47297 transitions. [2019-09-10 06:10:39,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-10 06:10:39,044 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:39,045 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:10:39,045 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:39,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:39,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1310746621, now seen corresponding path program 1 times [2019-09-10 06:10:39,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:39,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:39,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:39,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:39,047 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:39,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:39,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:10:39,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:39,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:10:39,189 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:39,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:10:39,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:10:39,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:10:39,190 INFO L87 Difference]: Start difference. First operand 32690 states and 47297 transitions. Second operand 4 states. [2019-09-10 06:10:39,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:39,335 INFO L93 Difference]: Finished difference Result 32875 states and 47513 transitions. [2019-09-10 06:10:39,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:10:39,336 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-09-10 06:10:39,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:39,401 INFO L225 Difference]: With dead ends: 32875 [2019-09-10 06:10:39,401 INFO L226 Difference]: Without dead ends: 32684 [2019-09-10 06:10:39,402 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 06:10:39,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32684 states. [2019-09-10 06:10:40,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32684 to 32684. [2019-09-10 06:10:40,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32684 states. [2019-09-10 06:10:40,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32684 states to 32684 states and 47285 transitions. [2019-09-10 06:10:40,623 INFO L78 Accepts]: Start accepts. Automaton has 32684 states and 47285 transitions. Word has length 161 [2019-09-10 06:10:40,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:40,623 INFO L475 AbstractCegarLoop]: Abstraction has 32684 states and 47285 transitions. [2019-09-10 06:10:40,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:10:40,623 INFO L276 IsEmpty]: Start isEmpty. Operand 32684 states and 47285 transitions. [2019-09-10 06:10:40,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-10 06:10:40,652 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:40,652 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:10:40,652 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:40,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:40,653 INFO L82 PathProgramCache]: Analyzing trace with hash 948664643, now seen corresponding path program 1 times [2019-09-10 06:10:40,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:40,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:40,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:40,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:40,655 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:40,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:40,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:10:40,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:40,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:10:40,768 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:40,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:10:40,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:10:40,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:10:40,769 INFO L87 Difference]: Start difference. First operand 32684 states and 47285 transitions. Second operand 3 states. [2019-09-10 06:10:40,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:40,960 INFO L93 Difference]: Finished difference Result 48670 states and 69285 transitions. [2019-09-10 06:10:40,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:10:40,961 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-09-10 06:10:40,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:41,029 INFO L225 Difference]: With dead ends: 48670 [2019-09-10 06:10:41,029 INFO L226 Difference]: Without dead ends: 48670 [2019-09-10 06:10:41,031 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:10:41,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48670 states. [2019-09-10 06:10:41,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48670 to 48614. [2019-09-10 06:10:41,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48614 states. [2019-09-10 06:10:42,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48614 states to 48614 states and 69220 transitions. [2019-09-10 06:10:42,052 INFO L78 Accepts]: Start accepts. Automaton has 48614 states and 69220 transitions. Word has length 161 [2019-09-10 06:10:42,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:42,052 INFO L475 AbstractCegarLoop]: Abstraction has 48614 states and 69220 transitions. [2019-09-10 06:10:42,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:10:42,053 INFO L276 IsEmpty]: Start isEmpty. Operand 48614 states and 69220 transitions. [2019-09-10 06:10:42,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-10 06:10:42,080 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:42,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] [2019-09-10 06:10:42,081 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:42,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:42,081 INFO L82 PathProgramCache]: Analyzing trace with hash -168137185, now seen corresponding path program 1 times [2019-09-10 06:10:42,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:42,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:42,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:42,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:42,083 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:42,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:42,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:10:42,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:42,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 06:10:42,319 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:42,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 06:10:42,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 06:10:42,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:10:42,320 INFO L87 Difference]: Start difference. First operand 48614 states and 69220 transitions. Second operand 8 states. [2019-09-10 06:10:42,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:42,598 INFO L93 Difference]: Finished difference Result 41845 states and 58300 transitions. [2019-09-10 06:10:42,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:10:42,599 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 167 [2019-09-10 06:10:42,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:42,640 INFO L225 Difference]: With dead ends: 41845 [2019-09-10 06:10:42,641 INFO L226 Difference]: Without dead ends: 41845 [2019-09-10 06:10:42,641 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:10:42,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41845 states. [2019-09-10 06:10:43,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41845 to 41843. [2019-09-10 06:10:43,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41843 states. [2019-09-10 06:10:43,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41843 states to 41843 states and 58299 transitions. [2019-09-10 06:10:43,074 INFO L78 Accepts]: Start accepts. Automaton has 41843 states and 58299 transitions. Word has length 167 [2019-09-10 06:10:43,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:43,074 INFO L475 AbstractCegarLoop]: Abstraction has 41843 states and 58299 transitions. [2019-09-10 06:10:43,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 06:10:43,074 INFO L276 IsEmpty]: Start isEmpty. Operand 41843 states and 58299 transitions. [2019-09-10 06:10:43,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-10 06:10:43,096 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:43,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] [2019-09-10 06:10:43,096 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:43,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:43,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1796903089, now seen corresponding path program 1 times [2019-09-10 06:10:43,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:43,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:43,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:43,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:43,099 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:43,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:43,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:10:43,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:43,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:10:43,541 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:43,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:10:43,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:10:43,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:10:43,543 INFO L87 Difference]: Start difference. First operand 41843 states and 58299 transitions. Second operand 4 states. [2019-09-10 06:10:43,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:43,733 INFO L93 Difference]: Finished difference Result 37572 states and 52207 transitions. [2019-09-10 06:10:43,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:10:43,733 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2019-09-10 06:10:43,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:43,778 INFO L225 Difference]: With dead ends: 37572 [2019-09-10 06:10:43,779 INFO L226 Difference]: Without dead ends: 37572 [2019-09-10 06:10:43,780 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:10:43,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37572 states. [2019-09-10 06:10:44,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37572 to 37509. [2019-09-10 06:10:44,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37509 states. [2019-09-10 06:10:44,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37509 states to 37509 states and 52140 transitions. [2019-09-10 06:10:44,281 INFO L78 Accepts]: Start accepts. Automaton has 37509 states and 52140 transitions. Word has length 167 [2019-09-10 06:10:44,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:44,284 INFO L475 AbstractCegarLoop]: Abstraction has 37509 states and 52140 transitions. [2019-09-10 06:10:44,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:10:44,284 INFO L276 IsEmpty]: Start isEmpty. Operand 37509 states and 52140 transitions. [2019-09-10 06:10:44,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-10 06:10:44,302 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:44,302 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] [2019-09-10 06:10:44,303 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:44,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:44,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1194193912, now seen corresponding path program 1 times [2019-09-10 06:10:44,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:44,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:44,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:44,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:44,305 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:44,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:44,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:10:44,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:44,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:10:44,381 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:44,382 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:10:44,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:10:44,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:10:44,382 INFO L87 Difference]: Start difference. First operand 37509 states and 52140 transitions. Second operand 3 states. [2019-09-10 06:10:44,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:44,831 INFO L93 Difference]: Finished difference Result 70260 states and 97487 transitions. [2019-09-10 06:10:44,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:10:44,832 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2019-09-10 06:10:44,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:44,919 INFO L225 Difference]: With dead ends: 70260 [2019-09-10 06:10:44,919 INFO L226 Difference]: Without dead ends: 70260 [2019-09-10 06:10:44,919 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:10:44,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70260 states. [2019-09-10 06:10:46,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70260 to 70204. [2019-09-10 06:10:46,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70204 states. [2019-09-10 06:10:46,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70204 states to 70204 states and 97422 transitions. [2019-09-10 06:10:46,580 INFO L78 Accepts]: Start accepts. Automaton has 70204 states and 97422 transitions. Word has length 169 [2019-09-10 06:10:46,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:46,581 INFO L475 AbstractCegarLoop]: Abstraction has 70204 states and 97422 transitions. [2019-09-10 06:10:46,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:10:46,581 INFO L276 IsEmpty]: Start isEmpty. Operand 70204 states and 97422 transitions. [2019-09-10 06:10:46,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-10 06:10:46,614 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:46,614 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] [2019-09-10 06:10:46,615 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:46,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:46,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1892232456, now seen corresponding path program 1 times [2019-09-10 06:10:46,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:46,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:46,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:46,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:46,617 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:46,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:46,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:10:46,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:46,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:10:46,957 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:46,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:10:46,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:10:46,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:10:46,960 INFO L87 Difference]: Start difference. First operand 70204 states and 97422 transitions. Second operand 9 states. [2019-09-10 06:10:47,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:47,974 INFO L93 Difference]: Finished difference Result 60942 states and 82454 transitions. [2019-09-10 06:10:47,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:10:47,974 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 169 [2019-09-10 06:10:47,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:48,028 INFO L225 Difference]: With dead ends: 60942 [2019-09-10 06:10:48,028 INFO L226 Difference]: Without dead ends: 60942 [2019-09-10 06:10:48,028 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:10:48,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60942 states. [2019-09-10 06:10:48,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60942 to 38753. [2019-09-10 06:10:48,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38753 states. [2019-09-10 06:10:48,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38753 states to 38753 states and 50778 transitions. [2019-09-10 06:10:48,498 INFO L78 Accepts]: Start accepts. Automaton has 38753 states and 50778 transitions. Word has length 169 [2019-09-10 06:10:48,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:48,498 INFO L475 AbstractCegarLoop]: Abstraction has 38753 states and 50778 transitions. [2019-09-10 06:10:48,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:10:48,498 INFO L276 IsEmpty]: Start isEmpty. Operand 38753 states and 50778 transitions. [2019-09-10 06:10:48,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-10 06:10:48,518 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:48,518 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] [2019-09-10 06:10:48,518 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:48,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:48,519 INFO L82 PathProgramCache]: Analyzing trace with hash 602422408, now seen corresponding path program 1 times [2019-09-10 06:10:48,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:48,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:48,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:48,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:48,520 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:48,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:48,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:10:48,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:48,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:10:48,692 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:48,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:10:48,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:10:48,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:10:48,693 INFO L87 Difference]: Start difference. First operand 38753 states and 50778 transitions. Second operand 4 states. [2019-09-10 06:10:48,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:48,855 INFO L93 Difference]: Finished difference Result 39006 states and 51056 transitions. [2019-09-10 06:10:48,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:10:48,856 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2019-09-10 06:10:48,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:48,904 INFO L225 Difference]: With dead ends: 39006 [2019-09-10 06:10:48,904 INFO L226 Difference]: Without dead ends: 39006 [2019-09-10 06:10:48,904 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:10:48,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39006 states. [2019-09-10 06:10:49,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39006 to 38866. [2019-09-10 06:10:49,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38866 states. [2019-09-10 06:10:49,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38866 states to 38866 states and 50895 transitions. [2019-09-10 06:10:49,542 INFO L78 Accepts]: Start accepts. Automaton has 38866 states and 50895 transitions. Word has length 169 [2019-09-10 06:10:49,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:49,542 INFO L475 AbstractCegarLoop]: Abstraction has 38866 states and 50895 transitions. [2019-09-10 06:10:49,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:10:49,542 INFO L276 IsEmpty]: Start isEmpty. Operand 38866 states and 50895 transitions. [2019-09-10 06:10:50,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-10 06:10:50,627 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:50,627 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] [2019-09-10 06:10:50,628 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:50,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:50,628 INFO L82 PathProgramCache]: Analyzing trace with hash 727382620, now seen corresponding path program 1 times [2019-09-10 06:10:50,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:50,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:50,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:50,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:50,630 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:50,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:50,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:10:50,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:50,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:10:50,693 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:50,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:10:50,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:10:50,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:10:50,694 INFO L87 Difference]: Start difference. First operand 38866 states and 50895 transitions. Second operand 3 states. [2019-09-10 06:10:50,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:50,908 INFO L93 Difference]: Finished difference Result 77527 states and 101547 transitions. [2019-09-10 06:10:50,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:10:50,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2019-09-10 06:10:50,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:51,009 INFO L225 Difference]: With dead ends: 77527 [2019-09-10 06:10:51,009 INFO L226 Difference]: Without dead ends: 77527 [2019-09-10 06:10:51,010 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:10:51,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77527 states. [2019-09-10 06:10:51,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77527 to 38876. [2019-09-10 06:10:51,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38876 states. [2019-09-10 06:10:52,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38876 states to 38876 states and 50905 transitions. [2019-09-10 06:10:52,071 INFO L78 Accepts]: Start accepts. Automaton has 38876 states and 50905 transitions. Word has length 170 [2019-09-10 06:10:52,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:52,072 INFO L475 AbstractCegarLoop]: Abstraction has 38876 states and 50905 transitions. [2019-09-10 06:10:52,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:10:52,072 INFO L276 IsEmpty]: Start isEmpty. Operand 38876 states and 50905 transitions. [2019-09-10 06:10:52,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-10 06:10:52,102 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:52,102 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] [2019-09-10 06:10:52,103 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:52,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:52,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1710954686, now seen corresponding path program 1 times [2019-09-10 06:10:52,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:52,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:52,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:52,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:52,107 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:52,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:52,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:10:52,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:52,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:10:52,220 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:52,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:10:52,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:10:52,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:10:52,221 INFO L87 Difference]: Start difference. First operand 38876 states and 50905 transitions. Second operand 3 states. [2019-09-10 06:10:52,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:52,654 INFO L93 Difference]: Finished difference Result 66224 states and 86484 transitions. [2019-09-10 06:10:52,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:10:52,655 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2019-09-10 06:10:52,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:52,719 INFO L225 Difference]: With dead ends: 66224 [2019-09-10 06:10:52,719 INFO L226 Difference]: Without dead ends: 66224 [2019-09-10 06:10:52,720 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:10:52,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66224 states. [2019-09-10 06:10:53,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66224 to 65248. [2019-09-10 06:10:53,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65248 states. [2019-09-10 06:10:53,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65248 states to 65248 states and 85179 transitions. [2019-09-10 06:10:53,499 INFO L78 Accepts]: Start accepts. Automaton has 65248 states and 85179 transitions. Word has length 171 [2019-09-10 06:10:53,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:53,499 INFO L475 AbstractCegarLoop]: Abstraction has 65248 states and 85179 transitions. [2019-09-10 06:10:53,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:10:53,499 INFO L276 IsEmpty]: Start isEmpty. Operand 65248 states and 85179 transitions. [2019-09-10 06:10:53,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-10 06:10:53,529 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:53,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] [2019-09-10 06:10:53,529 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:53,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:53,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1415908071, now seen corresponding path program 1 times [2019-09-10 06:10:53,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:53,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:53,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:53,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:53,531 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:53,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:53,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:10:53,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:53,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:10:53,647 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:53,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:10:53,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:10:53,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:10:53,648 INFO L87 Difference]: Start difference. First operand 65248 states and 85179 transitions. Second operand 5 states. [2019-09-10 06:10:53,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:53,959 INFO L93 Difference]: Finished difference Result 45105 states and 59992 transitions. [2019-09-10 06:10:53,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:10:53,960 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 171 [2019-09-10 06:10:53,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:53,999 INFO L225 Difference]: With dead ends: 45105 [2019-09-10 06:10:53,999 INFO L226 Difference]: Without dead ends: 45105 [2019-09-10 06:10:53,999 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 06:10:54,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45105 states. [2019-09-10 06:10:54,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45105 to 35358. [2019-09-10 06:10:54,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35358 states. [2019-09-10 06:10:54,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35358 states to 35358 states and 45666 transitions. [2019-09-10 06:10:54,386 INFO L78 Accepts]: Start accepts. Automaton has 35358 states and 45666 transitions. Word has length 171 [2019-09-10 06:10:54,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:54,387 INFO L475 AbstractCegarLoop]: Abstraction has 35358 states and 45666 transitions. [2019-09-10 06:10:54,387 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:10:54,387 INFO L276 IsEmpty]: Start isEmpty. Operand 35358 states and 45666 transitions. [2019-09-10 06:10:54,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-10 06:10:54,403 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:54,403 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] [2019-09-10 06:10:54,403 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:54,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:54,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1811002905, now seen corresponding path program 1 times [2019-09-10 06:10:54,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:54,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:54,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:54,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:54,405 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:54,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:54,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:10:54,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:54,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:10:54,573 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:54,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:10:54,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:10:54,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:10:54,576 INFO L87 Difference]: Start difference. First operand 35358 states and 45666 transitions. Second operand 4 states. [2019-09-10 06:10:54,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:54,751 INFO L93 Difference]: Finished difference Result 35782 states and 46125 transitions. [2019-09-10 06:10:54,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:10:54,752 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2019-09-10 06:10:54,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:54,794 INFO L225 Difference]: With dead ends: 35782 [2019-09-10 06:10:54,794 INFO L226 Difference]: Without dead ends: 35782 [2019-09-10 06:10:54,798 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:10:54,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35782 states. [2019-09-10 06:10:55,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35782 to 35590. [2019-09-10 06:10:55,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35590 states. [2019-09-10 06:10:55,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35590 states to 35590 states and 45900 transitions. [2019-09-10 06:10:55,245 INFO L78 Accepts]: Start accepts. Automaton has 35590 states and 45900 transitions. Word has length 171 [2019-09-10 06:10:55,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:55,245 INFO L475 AbstractCegarLoop]: Abstraction has 35590 states and 45900 transitions. [2019-09-10 06:10:55,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:10:55,245 INFO L276 IsEmpty]: Start isEmpty. Operand 35590 states and 45900 transitions. [2019-09-10 06:10:55,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-10 06:10:55,260 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:55,261 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] [2019-09-10 06:10:55,261 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:55,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:55,261 INFO L82 PathProgramCache]: Analyzing trace with hash 537625127, now seen corresponding path program 1 times [2019-09-10 06:10:55,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:55,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:55,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:55,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:55,263 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:55,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:55,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:10:55,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:55,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:10:55,377 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:55,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:10:55,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:10:55,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:10:55,378 INFO L87 Difference]: Start difference. First operand 35590 states and 45900 transitions. Second operand 4 states. [2019-09-10 06:10:55,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:55,465 INFO L93 Difference]: Finished difference Result 32737 states and 42197 transitions. [2019-09-10 06:10:55,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:10:55,466 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2019-09-10 06:10:55,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:55,500 INFO L225 Difference]: With dead ends: 32737 [2019-09-10 06:10:55,500 INFO L226 Difference]: Without dead ends: 32689 [2019-09-10 06:10:55,501 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 06:10:55,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32689 states. [2019-09-10 06:10:55,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32689 to 32686. [2019-09-10 06:10:55,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32686 states. [2019-09-10 06:10:55,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32686 states to 32686 states and 42146 transitions. [2019-09-10 06:10:55,778 INFO L78 Accepts]: Start accepts. Automaton has 32686 states and 42146 transitions. Word has length 171 [2019-09-10 06:10:55,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:55,779 INFO L475 AbstractCegarLoop]: Abstraction has 32686 states and 42146 transitions. [2019-09-10 06:10:55,779 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:10:55,779 INFO L276 IsEmpty]: Start isEmpty. Operand 32686 states and 42146 transitions. [2019-09-10 06:10:55,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-10 06:10:55,798 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:55,798 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:10:55,799 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:55,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:55,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1047066544, now seen corresponding path program 1 times [2019-09-10 06:10:55,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:55,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:55,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:55,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:55,800 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:55,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:57,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:10:57,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:57,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2019-09-10 06:10:57,593 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:57,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-10 06:10:57,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-10 06:10:57,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702 [2019-09-10 06:10:57,595 INFO L87 Difference]: Start difference. First operand 32686 states and 42146 transitions. Second operand 27 states. [2019-09-10 06:10:58,282 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 25 [2019-09-10 06:10:58,573 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-09-10 06:10:58,863 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-10 06:10:59,053 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-10 06:10:59,416 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-09-10 06:10:59,686 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-09-10 06:10:59,906 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 39 [2019-09-10 06:11:00,533 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-09-10 06:11:00,898 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2019-09-10 06:11:01,314 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-09-10 06:11:01,584 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 06:11:01,981 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2019-09-10 06:11:02,368 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-09-10 06:11:02,675 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-10 06:11:02,922 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-09-10 06:11:03,262 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-10 06:11:03,575 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-09-10 06:11:03,981 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-09-10 06:11:04,186 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-09-10 06:11:04,565 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2019-09-10 06:11:04,764 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-10 06:11:04,933 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-10 06:11:05,109 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-10 06:11:05,845 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2019-09-10 06:11:06,051 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-10 06:11:06,312 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-09-10 06:11:06,753 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-09-10 06:11:07,094 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-10 06:11:08,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:08,559 INFO L93 Difference]: Finished difference Result 38983 states and 49582 transitions. [2019-09-10 06:11:08,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-10 06:11:08,559 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 173 [2019-09-10 06:11:08,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:08,587 INFO L225 Difference]: With dead ends: 38983 [2019-09-10 06:11:08,587 INFO L226 Difference]: Without dead ends: 38983 [2019-09-10 06:11:08,588 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 755 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=981, Invalid=3441, Unknown=0, NotChecked=0, Total=4422 [2019-09-10 06:11:08,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38983 states. [2019-09-10 06:11:08,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38983 to 34639. [2019-09-10 06:11:08,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34639 states. [2019-09-10 06:11:08,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34639 states to 34639 states and 44444 transitions. [2019-09-10 06:11:08,886 INFO L78 Accepts]: Start accepts. Automaton has 34639 states and 44444 transitions. Word has length 173 [2019-09-10 06:11:08,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:11:08,886 INFO L475 AbstractCegarLoop]: Abstraction has 34639 states and 44444 transitions. [2019-09-10 06:11:08,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-10 06:11:08,886 INFO L276 IsEmpty]: Start isEmpty. Operand 34639 states and 44444 transitions. [2019-09-10 06:11:08,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-10 06:11:08,902 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:08,902 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:11:08,903 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:08,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:08,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1447149304, now seen corresponding path program 1 times [2019-09-10 06:11:08,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:08,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:08,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:08,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:08,904 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:08,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:09,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 06:11:09,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:11:09,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 06:11:09,236 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:09,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 06:11:09,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 06:11:09,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-09-10 06:11:09,238 INFO L87 Difference]: Start difference. First operand 34639 states and 44444 transitions. Second operand 11 states. [2019-09-10 06:11:09,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:09,559 INFO L93 Difference]: Finished difference Result 24152 states and 31433 transitions. [2019-09-10 06:11:09,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:11:09,559 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 173 [2019-09-10 06:11:09,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:09,586 INFO L225 Difference]: With dead ends: 24152 [2019-09-10 06:11:09,586 INFO L226 Difference]: Without dead ends: 24152 [2019-09-10 06:11:09,586 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-09-10 06:11:09,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24152 states. [2019-09-10 06:11:09,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24152 to 20012. [2019-09-10 06:11:09,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20012 states. [2019-09-10 06:11:09,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20012 states to 20012 states and 25297 transitions. [2019-09-10 06:11:09,821 INFO L78 Accepts]: Start accepts. Automaton has 20012 states and 25297 transitions. Word has length 173 [2019-09-10 06:11:09,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:11:09,822 INFO L475 AbstractCegarLoop]: Abstraction has 20012 states and 25297 transitions. [2019-09-10 06:11:09,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 06:11:09,822 INFO L276 IsEmpty]: Start isEmpty. Operand 20012 states and 25297 transitions. [2019-09-10 06:11:09,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-10 06:11:09,832 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:09,832 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:11:09,832 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:09,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:09,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1679713453, now seen corresponding path program 1 times [2019-09-10 06:11:09,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:09,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:09,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:09,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:09,834 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:09,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:11,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:11:11,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:11:11,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-10 06:11:11,673 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:11,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 06:11:11,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 06:11:11,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=581, Unknown=0, NotChecked=0, Total=650 [2019-09-10 06:11:11,674 INFO L87 Difference]: Start difference. First operand 20012 states and 25297 transitions. Second operand 26 states. [2019-09-10 06:11:11,968 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-09-10 06:11:12,246 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-09-10 06:11:12,885 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2019-09-10 06:11:13,066 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-09-10 06:11:13,251 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-10 06:11:13,486 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2019-09-10 06:11:13,688 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2019-09-10 06:11:13,983 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-09-10 06:11:14,349 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-09-10 06:11:14,563 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2019-09-10 06:11:14,725 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2019-09-10 06:11:15,014 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2019-09-10 06:11:15,490 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-09-10 06:11:15,775 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-09-10 06:11:16,536 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-09-10 06:11:16,720 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 45 [2019-09-10 06:11:16,978 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 36 [2019-09-10 06:11:17,306 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2019-09-10 06:11:17,668 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2019-09-10 06:11:18,099 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2019-09-10 06:11:18,391 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-09-10 06:11:18,603 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 45 [2019-09-10 06:11:18,784 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 45 [2019-09-10 06:11:18,995 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 06:11:19,239 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-10 06:11:19,404 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 32 [2019-09-10 06:11:19,935 WARN L188 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2019-09-10 06:11:20,346 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2019-09-10 06:11:20,700 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-10 06:11:21,042 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-09-10 06:11:21,248 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2019-09-10 06:11:21,945 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 38 [2019-09-10 06:11:22,349 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-09-10 06:11:22,547 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2019-09-10 06:11:23,338 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 30 [2019-09-10 06:11:24,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:24,582 INFO L93 Difference]: Finished difference Result 33539 states and 44013 transitions. [2019-09-10 06:11:24,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-10 06:11:24,583 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 173 [2019-09-10 06:11:24,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:24,610 INFO L225 Difference]: With dead ends: 33539 [2019-09-10 06:11:24,611 INFO L226 Difference]: Without dead ends: 33539 [2019-09-10 06:11:24,612 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1340 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=847, Invalid=4409, Unknown=0, NotChecked=0, Total=5256 [2019-09-10 06:11:24,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33539 states. [2019-09-10 06:11:24,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33539 to 21685. [2019-09-10 06:11:24,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21685 states. [2019-09-10 06:11:24,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21685 states to 21685 states and 27229 transitions. [2019-09-10 06:11:24,968 INFO L78 Accepts]: Start accepts. Automaton has 21685 states and 27229 transitions. Word has length 173 [2019-09-10 06:11:24,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:11:24,968 INFO L475 AbstractCegarLoop]: Abstraction has 21685 states and 27229 transitions. [2019-09-10 06:11:24,969 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 06:11:24,969 INFO L276 IsEmpty]: Start isEmpty. Operand 21685 states and 27229 transitions. [2019-09-10 06:11:24,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-10 06:11:24,980 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:24,980 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:11:24,980 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:24,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:24,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1593773061, now seen corresponding path program 1 times [2019-09-10 06:11:24,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:24,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:24,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:24,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:24,982 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:25,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:26,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:11:26,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:11:26,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-09-10 06:11:26,194 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:26,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-10 06:11:26,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-10 06:11:26,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2019-09-10 06:11:26,196 INFO L87 Difference]: Start difference. First operand 21685 states and 27229 transitions. Second operand 24 states. [2019-09-10 06:11:27,665 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 06:11:28,011 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-09-10 06:11:28,240 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-09-10 06:11:28,556 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-09-10 06:11:29,263 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-09-10 06:11:31,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:31,699 INFO L93 Difference]: Finished difference Result 28966 states and 37431 transitions. [2019-09-10 06:11:31,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-10 06:11:31,699 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 173 [2019-09-10 06:11:31,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:31,725 INFO L225 Difference]: With dead ends: 28966 [2019-09-10 06:11:31,726 INFO L226 Difference]: Without dead ends: 28966 [2019-09-10 06:11:31,726 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=316, Invalid=1166, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 06:11:31,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28966 states. [2019-09-10 06:11:31,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28966 to 22912. [2019-09-10 06:11:31,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22912 states. [2019-09-10 06:11:31,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22912 states to 22912 states and 28672 transitions. [2019-09-10 06:11:31,936 INFO L78 Accepts]: Start accepts. Automaton has 22912 states and 28672 transitions. Word has length 173 [2019-09-10 06:11:31,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:11:31,936 INFO L475 AbstractCegarLoop]: Abstraction has 22912 states and 28672 transitions. [2019-09-10 06:11:31,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-10 06:11:31,936 INFO L276 IsEmpty]: Start isEmpty. Operand 22912 states and 28672 transitions. [2019-09-10 06:11:31,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-10 06:11:31,948 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:31,948 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:11:31,949 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:31,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:31,949 INFO L82 PathProgramCache]: Analyzing trace with hash 735237155, now seen corresponding path program 1 times [2019-09-10 06:11:31,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:31,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:31,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:31,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:31,950 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:31,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:32,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:11:32,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:11:32,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 06:11:32,527 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:32,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 06:11:32,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 06:11:32,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-09-10 06:11:32,528 INFO L87 Difference]: Start difference. First operand 22912 states and 28672 transitions. Second operand 16 states. [2019-09-10 06:11:32,722 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-09-10 06:11:36,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:36,921 INFO L93 Difference]: Finished difference Result 47184 states and 61758 transitions. [2019-09-10 06:11:36,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-10 06:11:36,921 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 173 [2019-09-10 06:11:36,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:36,965 INFO L225 Difference]: With dead ends: 47184 [2019-09-10 06:11:36,965 INFO L226 Difference]: Without dead ends: 47149 [2019-09-10 06:11:36,967 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 697 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=519, Invalid=2031, Unknown=0, NotChecked=0, Total=2550 [2019-09-10 06:11:36,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47149 states. [2019-09-10 06:11:37,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47149 to 29156. [2019-09-10 06:11:37,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29156 states. [2019-09-10 06:11:37,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29156 states to 29156 states and 35975 transitions. [2019-09-10 06:11:37,339 INFO L78 Accepts]: Start accepts. Automaton has 29156 states and 35975 transitions. Word has length 173 [2019-09-10 06:11:37,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:11:37,340 INFO L475 AbstractCegarLoop]: Abstraction has 29156 states and 35975 transitions. [2019-09-10 06:11:37,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 06:11:37,340 INFO L276 IsEmpty]: Start isEmpty. Operand 29156 states and 35975 transitions. [2019-09-10 06:11:37,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-10 06:11:37,356 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:37,356 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:11:37,356 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:37,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:37,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1330854134, now seen corresponding path program 1 times [2019-09-10 06:11:37,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:37,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:37,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:37,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:37,358 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:37,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:37,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:11:37,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:11:37,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 06:11:37,908 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:37,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 06:11:37,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 06:11:37,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-09-10 06:11:37,910 INFO L87 Difference]: Start difference. First operand 29156 states and 35975 transitions. Second operand 14 states. [2019-09-10 06:11:39,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:39,976 INFO L93 Difference]: Finished difference Result 50068 states and 62028 transitions. [2019-09-10 06:11:39,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 06:11:39,977 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 173 [2019-09-10 06:11:39,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:40,016 INFO L225 Difference]: With dead ends: 50068 [2019-09-10 06:11:40,016 INFO L226 Difference]: Without dead ends: 49988 [2019-09-10 06:11:40,016 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=221, Invalid=591, Unknown=0, NotChecked=0, Total=812 [2019-09-10 06:11:40,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49988 states. [2019-09-10 06:11:40,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49988 to 38200. [2019-09-10 06:11:40,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38200 states. [2019-09-10 06:11:40,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38200 states to 38200 states and 46264 transitions. [2019-09-10 06:11:40,407 INFO L78 Accepts]: Start accepts. Automaton has 38200 states and 46264 transitions. Word has length 173 [2019-09-10 06:11:40,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:11:40,407 INFO L475 AbstractCegarLoop]: Abstraction has 38200 states and 46264 transitions. [2019-09-10 06:11:40,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 06:11:40,407 INFO L276 IsEmpty]: Start isEmpty. Operand 38200 states and 46264 transitions. [2019-09-10 06:11:40,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-10 06:11:40,632 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:40,632 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:11:40,632 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:40,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:40,633 INFO L82 PathProgramCache]: Analyzing trace with hash -850431912, now seen corresponding path program 1 times [2019-09-10 06:11:40,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:40,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:40,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:40,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:40,634 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:40,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:40,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:11:40,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:11:40,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:11:40,842 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:40,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:11:40,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:11:40,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:11:40,843 INFO L87 Difference]: Start difference. First operand 38200 states and 46264 transitions. Second operand 10 states. [2019-09-10 06:11:41,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:41,089 INFO L93 Difference]: Finished difference Result 38200 states and 46046 transitions. [2019-09-10 06:11:41,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:11:41,090 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 173 [2019-09-10 06:11:41,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:41,117 INFO L225 Difference]: With dead ends: 38200 [2019-09-10 06:11:41,117 INFO L226 Difference]: Without dead ends: 38200 [2019-09-10 06:11:41,117 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-09-10 06:11:41,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38200 states. [2019-09-10 06:11:41,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38200 to 38200. [2019-09-10 06:11:41,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38200 states. [2019-09-10 06:11:41,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38200 states to 38200 states and 46046 transitions. [2019-09-10 06:11:41,416 INFO L78 Accepts]: Start accepts. Automaton has 38200 states and 46046 transitions. Word has length 173 [2019-09-10 06:11:41,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:11:41,416 INFO L475 AbstractCegarLoop]: Abstraction has 38200 states and 46046 transitions. [2019-09-10 06:11:41,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:11:41,417 INFO L276 IsEmpty]: Start isEmpty. Operand 38200 states and 46046 transitions. [2019-09-10 06:11:41,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-10 06:11:41,438 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:41,438 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:11:41,438 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:41,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:41,438 INFO L82 PathProgramCache]: Analyzing trace with hash -276349507, now seen corresponding path program 1 times [2019-09-10 06:11:41,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:41,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:41,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:41,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:41,439 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:41,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:42,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:11:42,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:11:42,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 06:11:42,373 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:42,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 06:11:42,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 06:11:42,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=417, Unknown=0, NotChecked=0, Total=462 [2019-09-10 06:11:42,375 INFO L87 Difference]: Start difference. First operand 38200 states and 46046 transitions. Second operand 22 states. [2019-09-10 06:11:42,924 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 35 [2019-09-10 06:11:43,277 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-09-10 06:11:43,442 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-09-10 06:11:43,661 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2019-09-10 06:11:43,893 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2019-09-10 06:11:44,137 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2019-09-10 06:11:44,365 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2019-09-10 06:11:44,576 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 06:11:45,020 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-09-10 06:11:45,269 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-10 06:11:45,566 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2019-09-10 06:11:45,812 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2019-09-10 06:11:46,418 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2019-09-10 06:11:46,627 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2019-09-10 06:11:46,885 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2019-09-10 06:11:47,090 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2019-09-10 06:11:47,383 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2019-09-10 06:11:47,598 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-09-10 06:11:47,837 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 57 [2019-09-10 06:11:48,125 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-09-10 06:11:48,321 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2019-09-10 06:11:48,534 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 49 [2019-09-10 06:11:48,767 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-10 06:11:49,099 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2019-09-10 06:11:49,566 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-09-10 06:11:49,800 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-10 06:11:52,208 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2019-09-10 06:11:52,426 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 35 [2019-09-10 06:11:52,750 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 40 [2019-09-10 06:11:52,930 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 40 [2019-09-10 06:11:53,156 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 39 [2019-09-10 06:11:53,722 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2019-09-10 06:11:53,905 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2019-09-10 06:11:54,632 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2019-09-10 06:11:54,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:54,698 INFO L93 Difference]: Finished difference Result 57197 states and 72831 transitions. [2019-09-10 06:11:54,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-09-10 06:11:54,699 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 173 [2019-09-10 06:11:54,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:54,743 INFO L225 Difference]: With dead ends: 57197 [2019-09-10 06:11:54,744 INFO L226 Difference]: Without dead ends: 57197 [2019-09-10 06:11:54,745 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1250 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=1047, Invalid=4355, Unknown=0, NotChecked=0, Total=5402 [2019-09-10 06:11:54,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57197 states. [2019-09-10 06:11:55,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57197 to 39160. [2019-09-10 06:11:55,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39160 states. [2019-09-10 06:11:55,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39160 states to 39160 states and 47149 transitions. [2019-09-10 06:11:55,183 INFO L78 Accepts]: Start accepts. Automaton has 39160 states and 47149 transitions. Word has length 173 [2019-09-10 06:11:55,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:11:55,184 INFO L475 AbstractCegarLoop]: Abstraction has 39160 states and 47149 transitions. [2019-09-10 06:11:55,184 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 06:11:55,184 INFO L276 IsEmpty]: Start isEmpty. Operand 39160 states and 47149 transitions. [2019-09-10 06:11:55,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-10 06:11:55,209 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:55,209 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:11:55,210 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:55,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:55,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1603629849, now seen corresponding path program 1 times [2019-09-10 06:11:55,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:55,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:55,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:55,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:55,211 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:55,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:55,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:11:55,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:11:55,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 06:11:55,496 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:55,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 06:11:55,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 06:11:55,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-09-10 06:11:55,497 INFO L87 Difference]: Start difference. First operand 39160 states and 47149 transitions. Second operand 13 states. [2019-09-10 06:11:57,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:57,555 INFO L93 Difference]: Finished difference Result 57193 states and 69067 transitions. [2019-09-10 06:11:57,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 06:11:57,555 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 173 [2019-09-10 06:11:57,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:57,603 INFO L225 Difference]: With dead ends: 57193 [2019-09-10 06:11:57,603 INFO L226 Difference]: Without dead ends: 57193 [2019-09-10 06:11:57,604 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=222, Invalid=648, Unknown=0, NotChecked=0, Total=870 [2019-09-10 06:11:57,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57193 states. [2019-09-10 06:11:58,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57193 to 43366. [2019-09-10 06:11:58,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43366 states. [2019-09-10 06:11:58,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43366 states to 43366 states and 52068 transitions. [2019-09-10 06:11:58,342 INFO L78 Accepts]: Start accepts. Automaton has 43366 states and 52068 transitions. Word has length 173 [2019-09-10 06:11:58,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:11:58,343 INFO L475 AbstractCegarLoop]: Abstraction has 43366 states and 52068 transitions. [2019-09-10 06:11:58,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 06:11:58,343 INFO L276 IsEmpty]: Start isEmpty. Operand 43366 states and 52068 transitions. [2019-09-10 06:11:58,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-10 06:11:58,369 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:58,369 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:11:58,370 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:58,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:58,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1204149033, now seen corresponding path program 1 times [2019-09-10 06:11:58,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:58,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:58,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:58,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:58,371 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:58,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:59,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:11:59,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:11:59,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-09-10 06:11:59,692 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:59,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 06:11:59,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 06:11:59,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2019-09-10 06:11:59,693 INFO L87 Difference]: Start difference. First operand 43366 states and 52068 transitions. Second operand 23 states. [2019-09-10 06:12:00,901 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 42 [2019-09-10 06:12:01,647 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 36 [2019-09-10 06:12:07,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:07,569 INFO L93 Difference]: Finished difference Result 58220 states and 69631 transitions. [2019-09-10 06:12:07,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-10 06:12:07,570 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 173 [2019-09-10 06:12:07,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:07,624 INFO L225 Difference]: With dead ends: 58220 [2019-09-10 06:12:07,624 INFO L226 Difference]: Without dead ends: 58220 [2019-09-10 06:12:07,625 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=541, Invalid=2215, Unknown=0, NotChecked=0, Total=2756 [2019-09-10 06:12:07,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58220 states. [2019-09-10 06:12:08,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58220 to 46536. [2019-09-10 06:12:08,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46536 states. [2019-09-10 06:12:08,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46536 states to 46536 states and 55698 transitions. [2019-09-10 06:12:08,515 INFO L78 Accepts]: Start accepts. Automaton has 46536 states and 55698 transitions. Word has length 173 [2019-09-10 06:12:08,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:08,515 INFO L475 AbstractCegarLoop]: Abstraction has 46536 states and 55698 transitions. [2019-09-10 06:12:08,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 06:12:08,515 INFO L276 IsEmpty]: Start isEmpty. Operand 46536 states and 55698 transitions. [2019-09-10 06:12:08,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-10 06:12:08,544 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:08,544 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:12:08,544 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:08,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:08,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1861921895, now seen corresponding path program 1 times [2019-09-10 06:12:08,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:08,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:08,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:08,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:08,546 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:08,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:08,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:12:08,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:08,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 06:12:08,874 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:08,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 06:12:08,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 06:12:08,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2019-09-10 06:12:08,875 INFO L87 Difference]: Start difference. First operand 46536 states and 55698 transitions. Second operand 16 states. [2019-09-10 06:12:11,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:11,842 INFO L93 Difference]: Finished difference Result 93221 states and 114703 transitions. [2019-09-10 06:12:11,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 06:12:11,842 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 173 [2019-09-10 06:12:11,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:11,952 INFO L225 Difference]: With dead ends: 93221 [2019-09-10 06:12:11,953 INFO L226 Difference]: Without dead ends: 93221 [2019-09-10 06:12:11,953 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=363, Invalid=969, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 06:12:12,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93221 states. [2019-09-10 06:12:12,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93221 to 60995. [2019-09-10 06:12:12,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60995 states. [2019-09-10 06:12:12,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60995 states to 60995 states and 72151 transitions. [2019-09-10 06:12:12,760 INFO L78 Accepts]: Start accepts. Automaton has 60995 states and 72151 transitions. Word has length 173 [2019-09-10 06:12:12,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:12,761 INFO L475 AbstractCegarLoop]: Abstraction has 60995 states and 72151 transitions. [2019-09-10 06:12:12,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 06:12:12,761 INFO L276 IsEmpty]: Start isEmpty. Operand 60995 states and 72151 transitions. [2019-09-10 06:12:12,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-10 06:12:12,817 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:12,817 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:12:12,818 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:12,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:12,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1389461213, now seen corresponding path program 1 times [2019-09-10 06:12:12,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:12,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:12,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:12,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:12,819 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:12,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:13,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:12:13,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:13,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 06:12:13,874 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:13,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 06:12:13,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 06:12:13,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2019-09-10 06:12:13,875 INFO L87 Difference]: Start difference. First operand 60995 states and 72151 transitions. Second operand 21 states. [2019-09-10 06:12:14,130 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 84 [2019-09-10 06:12:14,377 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 76 [2019-09-10 06:12:19,045 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2019-09-10 06:12:19,206 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-10 06:12:19,382 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2019-09-10 06:12:19,567 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-09-10 06:12:20,297 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 63 [2019-09-10 06:12:20,517 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2019-09-10 06:12:20,736 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 66 [2019-09-10 06:12:20,968 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2019-09-10 06:12:21,164 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2019-09-10 06:12:21,341 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-09-10 06:12:22,535 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-09-10 06:12:22,705 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2019-09-10 06:12:22,842 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-10 06:12:23,595 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2019-09-10 06:12:23,797 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-10 06:12:24,452 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2019-09-10 06:12:26,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:26,872 INFO L93 Difference]: Finished difference Result 77313 states and 90890 transitions. [2019-09-10 06:12:26,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-10 06:12:26,873 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 173 [2019-09-10 06:12:26,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:26,944 INFO L225 Difference]: With dead ends: 77313 [2019-09-10 06:12:26,944 INFO L226 Difference]: Without dead ends: 77313 [2019-09-10 06:12:26,945 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1013 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=764, Invalid=3396, Unknown=0, NotChecked=0, Total=4160 [2019-09-10 06:12:26,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77313 states. [2019-09-10 06:12:27,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77313 to 66172. [2019-09-10 06:12:27,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66172 states. [2019-09-10 06:12:27,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66172 states to 66172 states and 78103 transitions. [2019-09-10 06:12:27,740 INFO L78 Accepts]: Start accepts. Automaton has 66172 states and 78103 transitions. Word has length 173 [2019-09-10 06:12:27,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:27,740 INFO L475 AbstractCegarLoop]: Abstraction has 66172 states and 78103 transitions. [2019-09-10 06:12:27,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 06:12:27,740 INFO L276 IsEmpty]: Start isEmpty. Operand 66172 states and 78103 transitions. [2019-09-10 06:12:27,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-10 06:12:27,789 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:27,790 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:12:27,790 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:27,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:27,790 INFO L82 PathProgramCache]: Analyzing trace with hash 356207466, now seen corresponding path program 1 times [2019-09-10 06:12:27,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:27,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:27,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:27,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:27,791 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:27,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:28,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:12:28,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:28,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 06:12:28,306 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:28,309 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 06:12:28,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 06:12:28,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2019-09-10 06:12:28,310 INFO L87 Difference]: Start difference. First operand 66172 states and 78103 transitions. Second operand 17 states. [2019-09-10 06:12:29,361 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 20 [2019-09-10 06:12:30,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:30,973 INFO L93 Difference]: Finished difference Result 116486 states and 136839 transitions. [2019-09-10 06:12:30,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 06:12:30,973 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 173 [2019-09-10 06:12:30,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:31,091 INFO L225 Difference]: With dead ends: 116486 [2019-09-10 06:12:31,091 INFO L226 Difference]: Without dead ends: 116055 [2019-09-10 06:12:31,092 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=266, Invalid=790, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 06:12:31,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116055 states. [2019-09-10 06:12:32,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116055 to 91955. [2019-09-10 06:12:32,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91955 states. [2019-09-10 06:12:32,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91955 states to 91955 states and 107585 transitions. [2019-09-10 06:12:32,127 INFO L78 Accepts]: Start accepts. Automaton has 91955 states and 107585 transitions. Word has length 173 [2019-09-10 06:12:32,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:32,127 INFO L475 AbstractCegarLoop]: Abstraction has 91955 states and 107585 transitions. [2019-09-10 06:12:32,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 06:12:32,127 INFO L276 IsEmpty]: Start isEmpty. Operand 91955 states and 107585 transitions. [2019-09-10 06:12:32,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-10 06:12:32,192 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:32,192 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:12:32,193 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:32,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:32,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1911185901, now seen corresponding path program 1 times [2019-09-10 06:12:32,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:32,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:32,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:32,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:32,195 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:32,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:34,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:12:34,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:34,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-10 06:12:34,150 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:34,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 06:12:34,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 06:12:34,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=569, Unknown=0, NotChecked=0, Total=650 [2019-09-10 06:12:34,152 INFO L87 Difference]: Start difference. First operand 91955 states and 107585 transitions. Second operand 26 states. [2019-09-10 06:12:34,923 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-10 06:12:35,123 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 06:12:35,551 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 06:12:35,802 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 06:12:36,325 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 06:12:41,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:41,240 INFO L93 Difference]: Finished difference Result 103682 states and 120659 transitions. [2019-09-10 06:12:41,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 06:12:41,240 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 173 [2019-09-10 06:12:41,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:41,314 INFO L225 Difference]: With dead ends: 103682 [2019-09-10 06:12:41,314 INFO L226 Difference]: Without dead ends: 101947 [2019-09-10 06:12:41,315 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=411, Invalid=1481, Unknown=0, NotChecked=0, Total=1892 [2019-09-10 06:12:41,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101947 states. [2019-09-10 06:12:42,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101947 to 91023. [2019-09-10 06:12:42,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91023 states. [2019-09-10 06:12:42,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91023 states to 91023 states and 106430 transitions. [2019-09-10 06:12:42,155 INFO L78 Accepts]: Start accepts. Automaton has 91023 states and 106430 transitions. Word has length 173 [2019-09-10 06:12:42,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:42,155 INFO L475 AbstractCegarLoop]: Abstraction has 91023 states and 106430 transitions. [2019-09-10 06:12:42,155 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 06:12:42,155 INFO L276 IsEmpty]: Start isEmpty. Operand 91023 states and 106430 transitions. [2019-09-10 06:12:42,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-10 06:12:42,217 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:42,217 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:12:42,217 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:42,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:42,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1827630506, now seen corresponding path program 1 times [2019-09-10 06:12:42,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:42,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:42,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:42,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:42,218 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:42,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:42,971 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 37 [2019-09-10 06:12:43,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:12:43,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:43,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-10 06:12:43,709 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:43,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 06:12:43,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 06:12:43,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=573, Unknown=0, NotChecked=0, Total=650 [2019-09-10 06:12:43,710 INFO L87 Difference]: Start difference. First operand 91023 states and 106430 transitions. Second operand 26 states. [2019-09-10 06:12:44,515 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-09-10 06:12:44,784 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2019-09-10 06:12:45,278 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2019-09-10 06:12:45,698 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 06:12:46,581 WARN L188 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2019-09-10 06:12:47,488 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 43 [2019-09-10 06:12:48,049 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2019-09-10 06:12:48,443 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 36 [2019-09-10 06:12:48,916 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 43 [2019-09-10 06:12:49,162 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2019-09-10 06:12:49,426 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2019-09-10 06:12:50,296 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 52 [2019-09-10 06:12:51,674 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-10 06:12:53,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:53,586 INFO L93 Difference]: Finished difference Result 106407 states and 126112 transitions. [2019-09-10 06:12:53,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-10 06:12:53,587 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 173 [2019-09-10 06:12:53,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:53,670 INFO L225 Difference]: With dead ends: 106407 [2019-09-10 06:12:53,670 INFO L226 Difference]: Without dead ends: 106407 [2019-09-10 06:12:53,671 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=470, Invalid=1980, Unknown=0, NotChecked=0, Total=2450 [2019-09-10 06:12:53,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106407 states. [2019-09-10 06:12:54,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106407 to 93367. [2019-09-10 06:12:54,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93367 states. [2019-09-10 06:12:54,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93367 states to 93367 states and 109109 transitions. [2019-09-10 06:12:54,554 INFO L78 Accepts]: Start accepts. Automaton has 93367 states and 109109 transitions. Word has length 173 [2019-09-10 06:12:54,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:54,555 INFO L475 AbstractCegarLoop]: Abstraction has 93367 states and 109109 transitions. [2019-09-10 06:12:54,555 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 06:12:54,555 INFO L276 IsEmpty]: Start isEmpty. Operand 93367 states and 109109 transitions. [2019-09-10 06:12:54,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-10 06:12:54,619 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:54,619 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:12:54,619 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:54,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:54,619 INFO L82 PathProgramCache]: Analyzing trace with hash -895749768, now seen corresponding path program 1 times [2019-09-10 06:12:54,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:54,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:54,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:54,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:54,620 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:54,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:55,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:12:55,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:55,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 06:12:55,257 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:55,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 06:12:55,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 06:12:55,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2019-09-10 06:12:55,258 INFO L87 Difference]: Start difference. First operand 93367 states and 109109 transitions. Second operand 21 states. [2019-09-10 06:12:56,413 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 29 [2019-09-10 06:12:58,111 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 41 [2019-09-10 06:12:58,295 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 47 [2019-09-10 06:12:58,481 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 44 [2019-09-10 06:12:59,769 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 42 [2019-09-10 06:13:01,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:01,745 INFO L93 Difference]: Finished difference Result 105792 states and 123416 transitions. [2019-09-10 06:13:01,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-10 06:13:01,746 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 173 [2019-09-10 06:13:01,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:01,845 INFO L225 Difference]: With dead ends: 105792 [2019-09-10 06:13:01,845 INFO L226 Difference]: Without dead ends: 105792 [2019-09-10 06:13:01,846 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=609, Invalid=1841, Unknown=0, NotChecked=0, Total=2450 [2019-09-10 06:13:01,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105792 states. [2019-09-10 06:13:02,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105792 to 94911. [2019-09-10 06:13:02,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94911 states. [2019-09-10 06:13:02,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94911 states to 94911 states and 110900 transitions. [2019-09-10 06:13:02,844 INFO L78 Accepts]: Start accepts. Automaton has 94911 states and 110900 transitions. Word has length 173 [2019-09-10 06:13:02,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:02,844 INFO L475 AbstractCegarLoop]: Abstraction has 94911 states and 110900 transitions. [2019-09-10 06:13:02,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 06:13:02,845 INFO L276 IsEmpty]: Start isEmpty. Operand 94911 states and 110900 transitions. [2019-09-10 06:13:02,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-10 06:13:02,909 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:13:02,910 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:13:02,910 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:13:02,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:02,910 INFO L82 PathProgramCache]: Analyzing trace with hash -907941184, now seen corresponding path program 1 times [2019-09-10 06:13:02,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:13:02,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:02,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:02,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:02,911 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:02,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:02,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:13:02,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:13:02,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:13:02,978 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:02,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:13:02,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:13:02,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:13:02,979 INFO L87 Difference]: Start difference. First operand 94911 states and 110900 transitions. Second operand 3 states. [2019-09-10 06:13:03,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:03,261 INFO L93 Difference]: Finished difference Result 81727 states and 95026 transitions. [2019-09-10 06:13:03,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:13:03,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-09-10 06:13:03,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:03,326 INFO L225 Difference]: With dead ends: 81727 [2019-09-10 06:13:03,326 INFO L226 Difference]: Without dead ends: 81638 [2019-09-10 06:13:03,326 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:13:03,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81638 states. [2019-09-10 06:13:04,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81638 to 80513. [2019-09-10 06:13:04,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80513 states. [2019-09-10 06:13:04,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80513 states to 80513 states and 93424 transitions. [2019-09-10 06:13:04,495 INFO L78 Accepts]: Start accepts. Automaton has 80513 states and 93424 transitions. Word has length 174 [2019-09-10 06:13:04,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:04,495 INFO L475 AbstractCegarLoop]: Abstraction has 80513 states and 93424 transitions. [2019-09-10 06:13:04,495 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:13:04,495 INFO L276 IsEmpty]: Start isEmpty. Operand 80513 states and 93424 transitions. [2019-09-10 06:13:04,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-10 06:13:04,550 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:13:04,550 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] [2019-09-10 06:13:04,550 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:13:04,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:04,551 INFO L82 PathProgramCache]: Analyzing trace with hash 917558432, now seen corresponding path program 1 times [2019-09-10 06:13:04,551 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:13:04,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:04,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:04,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:04,552 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:04,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:04,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:13:04,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:13:04,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:13:04,612 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:04,613 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:13:04,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:13:04,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:13:04,613 INFO L87 Difference]: Start difference. First operand 80513 states and 93424 transitions. Second operand 3 states. [2019-09-10 06:13:04,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:04,872 INFO L93 Difference]: Finished difference Result 73672 states and 85082 transitions. [2019-09-10 06:13:04,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:13:04,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-09-10 06:13:04,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:04,933 INFO L225 Difference]: With dead ends: 73672 [2019-09-10 06:13:04,933 INFO L226 Difference]: Without dead ends: 73672 [2019-09-10 06:13:04,934 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:13:04,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73672 states. [2019-09-10 06:13:05,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73672 to 73568. [2019-09-10 06:13:05,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73568 states. [2019-09-10 06:13:05,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73568 states to 73568 states and 84978 transitions. [2019-09-10 06:13:05,629 INFO L78 Accepts]: Start accepts. Automaton has 73568 states and 84978 transitions. Word has length 174 [2019-09-10 06:13:05,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:05,629 INFO L475 AbstractCegarLoop]: Abstraction has 73568 states and 84978 transitions. [2019-09-10 06:13:05,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:13:05,630 INFO L276 IsEmpty]: Start isEmpty. Operand 73568 states and 84978 transitions. [2019-09-10 06:13:05,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-10 06:13:05,676 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:13:05,676 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] [2019-09-10 06:13:05,677 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:13:05,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:05,677 INFO L82 PathProgramCache]: Analyzing trace with hash -2117960819, now seen corresponding path program 1 times [2019-09-10 06:13:05,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:13:05,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:05,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:05,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:05,678 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:05,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:05,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:13:05,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:13:05,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:13:05,741 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:05,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:13:05,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:13:05,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:13:05,742 INFO L87 Difference]: Start difference. First operand 73568 states and 84978 transitions. Second operand 3 states. [2019-09-10 06:13:06,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:06,028 INFO L93 Difference]: Finished difference Result 64741 states and 74898 transitions. [2019-09-10 06:13:06,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:13:06,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-09-10 06:13:06,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:06,089 INFO L225 Difference]: With dead ends: 64741 [2019-09-10 06:13:06,089 INFO L226 Difference]: Without dead ends: 64741 [2019-09-10 06:13:06,090 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:13:06,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64741 states. [2019-09-10 06:13:06,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64741 to 62740. [2019-09-10 06:13:06,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62740 states. [2019-09-10 06:13:06,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62740 states to 62740 states and 72220 transitions. [2019-09-10 06:13:06,716 INFO L78 Accepts]: Start accepts. Automaton has 62740 states and 72220 transitions. Word has length 174 [2019-09-10 06:13:06,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:06,716 INFO L475 AbstractCegarLoop]: Abstraction has 62740 states and 72220 transitions. [2019-09-10 06:13:06,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:13:06,716 INFO L276 IsEmpty]: Start isEmpty. Operand 62740 states and 72220 transitions. [2019-09-10 06:13:06,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-10 06:13:06,760 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:13:06,761 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] [2019-09-10 06:13:06,761 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:13:06,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:06,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1751435957, now seen corresponding path program 1 times [2019-09-10 06:13:06,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:13:06,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:06,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:06,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:06,763 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:06,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:06,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:13:06,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:13:06,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:13:06,843 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:06,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:13:06,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:13:06,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:13:06,843 INFO L87 Difference]: Start difference. First operand 62740 states and 72220 transitions. Second operand 3 states. [2019-09-10 06:13:06,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:06,986 INFO L93 Difference]: Finished difference Result 63090 states and 72380 transitions. [2019-09-10 06:13:06,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:13:06,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-09-10 06:13:06,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:07,039 INFO L225 Difference]: With dead ends: 63090 [2019-09-10 06:13:07,040 INFO L226 Difference]: Without dead ends: 62654 [2019-09-10 06:13:07,040 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:13:07,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62654 states. [2019-09-10 06:13:07,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62654 to 62464. [2019-09-10 06:13:07,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62464 states. [2019-09-10 06:13:07,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62464 states to 62464 states and 71722 transitions. [2019-09-10 06:13:07,813 INFO L78 Accepts]: Start accepts. Automaton has 62464 states and 71722 transitions. Word has length 174 [2019-09-10 06:13:07,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:07,814 INFO L475 AbstractCegarLoop]: Abstraction has 62464 states and 71722 transitions. [2019-09-10 06:13:07,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:13:07,814 INFO L276 IsEmpty]: Start isEmpty. Operand 62464 states and 71722 transitions. [2019-09-10 06:13:07,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-10 06:13:07,865 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:13:07,865 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] [2019-09-10 06:13:07,865 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:13:07,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:07,866 INFO L82 PathProgramCache]: Analyzing trace with hash 805067023, now seen corresponding path program 1 times [2019-09-10 06:13:07,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:13:07,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:07,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:07,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:07,867 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:07,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:07,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:13:07,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:13:07,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:13:07,928 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:07,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:13:07,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:13:07,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:13:07,929 INFO L87 Difference]: Start difference. First operand 62464 states and 71722 transitions. Second operand 3 states. [2019-09-10 06:13:08,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:08,139 INFO L93 Difference]: Finished difference Result 49472 states and 56808 transitions. [2019-09-10 06:13:08,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:13:08,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-09-10 06:13:08,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:08,176 INFO L225 Difference]: With dead ends: 49472 [2019-09-10 06:13:08,176 INFO L226 Difference]: Without dead ends: 48561 [2019-09-10 06:13:08,176 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:13:08,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48561 states. [2019-09-10 06:13:08,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48561 to 47575. [2019-09-10 06:13:08,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47575 states. [2019-09-10 06:13:08,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47575 states to 47575 states and 54568 transitions. [2019-09-10 06:13:08,603 INFO L78 Accepts]: Start accepts. Automaton has 47575 states and 54568 transitions. Word has length 174 [2019-09-10 06:13:08,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:08,603 INFO L475 AbstractCegarLoop]: Abstraction has 47575 states and 54568 transitions. [2019-09-10 06:13:08,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:13:08,603 INFO L276 IsEmpty]: Start isEmpty. Operand 47575 states and 54568 transitions. [2019-09-10 06:13:08,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-10 06:13:08,633 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:13:08,633 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] [2019-09-10 06:13:08,634 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:13:08,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:08,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1327640188, now seen corresponding path program 1 times [2019-09-10 06:13:08,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:13:08,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:08,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:08,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:08,635 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:08,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:08,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:13:08,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:13:08,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:13:08,691 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:08,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:13:08,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:13:08,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:13:08,692 INFO L87 Difference]: Start difference. First operand 47575 states and 54568 transitions. Second operand 3 states. [2019-09-10 06:13:08,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:08,853 INFO L93 Difference]: Finished difference Result 41950 states and 47749 transitions. [2019-09-10 06:13:08,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:13:08,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-09-10 06:13:08,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:08,888 INFO L225 Difference]: With dead ends: 41950 [2019-09-10 06:13:08,888 INFO L226 Difference]: Without dead ends: 41950 [2019-09-10 06:13:08,889 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:13:08,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41950 states. [2019-09-10 06:13:09,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41950 to 41846. [2019-09-10 06:13:09,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41846 states. [2019-09-10 06:13:09,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41846 states to 41846 states and 47645 transitions. [2019-09-10 06:13:09,242 INFO L78 Accepts]: Start accepts. Automaton has 41846 states and 47645 transitions. Word has length 174 [2019-09-10 06:13:09,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:09,242 INFO L475 AbstractCegarLoop]: Abstraction has 41846 states and 47645 transitions. [2019-09-10 06:13:09,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:13:09,242 INFO L276 IsEmpty]: Start isEmpty. Operand 41846 states and 47645 transitions. [2019-09-10 06:13:09,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-10 06:13:09,269 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:13:09,269 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] [2019-09-10 06:13:09,269 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:13:09,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:09,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1070119604, now seen corresponding path program 1 times [2019-09-10 06:13:09,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:13:09,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:09,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:09,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:09,271 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:09,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:09,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:13:09,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:13:09,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:13:09,318 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:09,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:13:09,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:13:09,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:13:09,318 INFO L87 Difference]: Start difference. First operand 41846 states and 47645 transitions. Second operand 3 states. [2019-09-10 06:13:09,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:09,482 INFO L93 Difference]: Finished difference Result 29690 states and 34564 transitions. [2019-09-10 06:13:09,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:13:09,482 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-09-10 06:13:09,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:09,505 INFO L225 Difference]: With dead ends: 29690 [2019-09-10 06:13:09,506 INFO L226 Difference]: Without dead ends: 29558 [2019-09-10 06:13:09,506 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:13:09,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29558 states. [2019-09-10 06:13:09,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29558 to 27808. [2019-09-10 06:13:09,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27808 states. [2019-09-10 06:13:09,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27808 states to 27808 states and 32088 transitions. [2019-09-10 06:13:09,724 INFO L78 Accepts]: Start accepts. Automaton has 27808 states and 32088 transitions. Word has length 174 [2019-09-10 06:13:09,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:09,724 INFO L475 AbstractCegarLoop]: Abstraction has 27808 states and 32088 transitions. [2019-09-10 06:13:09,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:13:09,724 INFO L276 IsEmpty]: Start isEmpty. Operand 27808 states and 32088 transitions. [2019-09-10 06:13:09,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-10 06:13:09,739 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:13:09,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] [2019-09-10 06:13:09,739 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:13:09,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:09,739 INFO L82 PathProgramCache]: Analyzing trace with hash 919617869, now seen corresponding path program 1 times [2019-09-10 06:13:09,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:13:09,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:09,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:09,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:09,740 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:09,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:09,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:13:09,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:13:09,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:13:09,801 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:09,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:13:09,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:13:09,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:13:09,803 INFO L87 Difference]: Start difference. First operand 27808 states and 32088 transitions. Second operand 3 states. [2019-09-10 06:13:09,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:09,866 INFO L93 Difference]: Finished difference Result 25647 states and 29603 transitions. [2019-09-10 06:13:09,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:13:09,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2019-09-10 06:13:09,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:09,888 INFO L225 Difference]: With dead ends: 25647 [2019-09-10 06:13:09,888 INFO L226 Difference]: Without dead ends: 25647 [2019-09-10 06:13:09,889 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:13:09,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25647 states. [2019-09-10 06:13:10,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25647 to 25523. [2019-09-10 06:13:10,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25523 states. [2019-09-10 06:13:10,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25523 states to 25523 states and 29482 transitions. [2019-09-10 06:13:10,091 INFO L78 Accepts]: Start accepts. Automaton has 25523 states and 29482 transitions. Word has length 178 [2019-09-10 06:13:10,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:10,091 INFO L475 AbstractCegarLoop]: Abstraction has 25523 states and 29482 transitions. [2019-09-10 06:13:10,091 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:13:10,091 INFO L276 IsEmpty]: Start isEmpty. Operand 25523 states and 29482 transitions. [2019-09-10 06:13:10,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-10 06:13:10,105 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:13:10,106 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] [2019-09-10 06:13:10,106 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:13:10,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:10,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1506331714, now seen corresponding path program 1 times [2019-09-10 06:13:10,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:13:10,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:10,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:10,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:10,107 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:10,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:10,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:13:10,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:13:10,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:13:10,180 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:10,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:13:10,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:13:10,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:13:10,181 INFO L87 Difference]: Start difference. First operand 25523 states and 29482 transitions. Second operand 3 states. [2019-09-10 06:13:10,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:10,327 INFO L93 Difference]: Finished difference Result 25116 states and 28853 transitions. [2019-09-10 06:13:10,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:13:10,327 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2019-09-10 06:13:10,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:10,343 INFO L225 Difference]: With dead ends: 25116 [2019-09-10 06:13:10,344 INFO L226 Difference]: Without dead ends: 25116 [2019-09-10 06:13:10,344 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:13:10,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25116 states. [2019-09-10 06:13:10,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25116 to 24979. [2019-09-10 06:13:10,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24979 states. [2019-09-10 06:13:10,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24979 states to 24979 states and 28715 transitions. [2019-09-10 06:13:10,523 INFO L78 Accepts]: Start accepts. Automaton has 24979 states and 28715 transitions. Word has length 178 [2019-09-10 06:13:10,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:10,523 INFO L475 AbstractCegarLoop]: Abstraction has 24979 states and 28715 transitions. [2019-09-10 06:13:10,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:13:10,523 INFO L276 IsEmpty]: Start isEmpty. Operand 24979 states and 28715 transitions. [2019-09-10 06:13:10,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-10 06:13:10,535 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:13:10,535 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:13:10,536 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:13:10,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:10,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1596162818, now seen corresponding path program 1 times [2019-09-10 06:13:10,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:13:10,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:10,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:10,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:10,538 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:10,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:10,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:13:10,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:13:10,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:13:10,591 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:10,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:13:10,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:13:10,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:13:10,592 INFO L87 Difference]: Start difference. First operand 24979 states and 28715 transitions. Second operand 3 states. [2019-09-10 06:13:10,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:10,649 INFO L93 Difference]: Finished difference Result 22606 states and 25985 transitions. [2019-09-10 06:13:10,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:13:10,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2019-09-10 06:13:10,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:10,665 INFO L225 Difference]: With dead ends: 22606 [2019-09-10 06:13:10,666 INFO L226 Difference]: Without dead ends: 22606 [2019-09-10 06:13:10,666 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:13:10,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22606 states. [2019-09-10 06:13:10,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22606 to 22484. [2019-09-10 06:13:10,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22484 states. [2019-09-10 06:13:10,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22484 states to 22484 states and 25863 transitions. [2019-09-10 06:13:10,826 INFO L78 Accepts]: Start accepts. Automaton has 22484 states and 25863 transitions. Word has length 178 [2019-09-10 06:13:10,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:10,826 INFO L475 AbstractCegarLoop]: Abstraction has 22484 states and 25863 transitions. [2019-09-10 06:13:10,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:13:10,826 INFO L276 IsEmpty]: Start isEmpty. Operand 22484 states and 25863 transitions. [2019-09-10 06:13:10,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-10 06:13:10,837 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:13:10,837 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:13:10,837 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:13:10,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:10,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1113812116, now seen corresponding path program 1 times [2019-09-10 06:13:10,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:13:10,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:10,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:10,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:10,839 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:10,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:10,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:13:10,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:13:10,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:13:10,889 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:10,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:13:10,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:13:10,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:13:10,890 INFO L87 Difference]: Start difference. First operand 22484 states and 25863 transitions. Second operand 3 states. [2019-09-10 06:13:10,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:10,952 INFO L93 Difference]: Finished difference Result 21461 states and 24625 transitions. [2019-09-10 06:13:10,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:13:10,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2019-09-10 06:13:10,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:10,968 INFO L225 Difference]: With dead ends: 21461 [2019-09-10 06:13:10,968 INFO L226 Difference]: Without dead ends: 21457 [2019-09-10 06:13:10,968 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:13:10,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21457 states. [2019-09-10 06:13:11,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21457 to 21410. [2019-09-10 06:13:11,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21410 states. [2019-09-10 06:13:11,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21410 states to 21410 states and 24578 transitions. [2019-09-10 06:13:11,110 INFO L78 Accepts]: Start accepts. Automaton has 21410 states and 24578 transitions. Word has length 178 [2019-09-10 06:13:11,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:11,111 INFO L475 AbstractCegarLoop]: Abstraction has 21410 states and 24578 transitions. [2019-09-10 06:13:11,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:13:11,111 INFO L276 IsEmpty]: Start isEmpty. Operand 21410 states and 24578 transitions. [2019-09-10 06:13:11,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-10 06:13:11,121 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:13:11,121 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:13:11,121 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:13:11,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:11,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1213512267, now seen corresponding path program 1 times [2019-09-10 06:13:11,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:13:11,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:11,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:11,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:11,123 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:11,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:11,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:13:11,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:13:11,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:13:11,165 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:11,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:13:11,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:13:11,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:13:11,166 INFO L87 Difference]: Start difference. First operand 21410 states and 24578 transitions. Second operand 3 states. [2019-09-10 06:13:11,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:11,230 INFO L93 Difference]: Finished difference Result 20963 states and 23932 transitions. [2019-09-10 06:13:11,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:13:11,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2019-09-10 06:13:11,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:11,247 INFO L225 Difference]: With dead ends: 20963 [2019-09-10 06:13:11,247 INFO L226 Difference]: Without dead ends: 20963 [2019-09-10 06:13:11,247 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:13:11,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20963 states. [2019-09-10 06:13:11,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20963 to 20904. [2019-09-10 06:13:11,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20904 states. [2019-09-10 06:13:11,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20904 states to 20904 states and 23876 transitions. [2019-09-10 06:13:11,399 INFO L78 Accepts]: Start accepts. Automaton has 20904 states and 23876 transitions. Word has length 178 [2019-09-10 06:13:11,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:11,399 INFO L475 AbstractCegarLoop]: Abstraction has 20904 states and 23876 transitions. [2019-09-10 06:13:11,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:13:11,400 INFO L276 IsEmpty]: Start isEmpty. Operand 20904 states and 23876 transitions. [2019-09-10 06:13:11,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-10 06:13:11,410 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:13:11,410 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:13:11,410 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:13:11,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:11,411 INFO L82 PathProgramCache]: Analyzing trace with hash -898697782, now seen corresponding path program 1 times [2019-09-10 06:13:11,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:13:11,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:11,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:11,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:11,412 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:11,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:12,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:13:12,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:13:12,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 06:13:12,069 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:12,069 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 06:13:12,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 06:13:12,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2019-09-10 06:13:12,070 INFO L87 Difference]: Start difference. First operand 20904 states and 23876 transitions. Second operand 21 states. [2019-09-10 06:13:12,274 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2019-09-10 06:13:13,230 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 06:13:13,416 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2019-09-10 06:13:13,664 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-09-10 06:13:13,960 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 69 [2019-09-10 06:13:17,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:17,531 INFO L93 Difference]: Finished difference Result 22004 states and 25193 transitions. [2019-09-10 06:13:17,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 06:13:17,532 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 179 [2019-09-10 06:13:17,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:17,549 INFO L225 Difference]: With dead ends: 22004 [2019-09-10 06:13:17,549 INFO L226 Difference]: Without dead ends: 22004 [2019-09-10 06:13:17,550 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=355, Invalid=1625, Unknown=0, NotChecked=0, Total=1980 [2019-09-10 06:13:17,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22004 states. [2019-09-10 06:13:17,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22004 to 20926. [2019-09-10 06:13:17,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20926 states. [2019-09-10 06:13:17,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20926 states to 20926 states and 23900 transitions. [2019-09-10 06:13:17,702 INFO L78 Accepts]: Start accepts. Automaton has 20926 states and 23900 transitions. Word has length 179 [2019-09-10 06:13:17,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:17,702 INFO L475 AbstractCegarLoop]: Abstraction has 20926 states and 23900 transitions. [2019-09-10 06:13:17,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 06:13:17,702 INFO L276 IsEmpty]: Start isEmpty. Operand 20926 states and 23900 transitions. [2019-09-10 06:13:17,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-10 06:13:17,713 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:13:17,713 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:13:17,713 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:13:17,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:17,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1797481385, now seen corresponding path program 1 times [2019-09-10 06:13:17,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:13:17,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:17,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:17,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:17,714 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:17,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:18,197 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 19 [2019-09-10 06:13:18,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:13:18,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:13:18,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-09-10 06:13:18,723 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:18,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-10 06:13:18,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-10 06:13:18,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2019-09-10 06:13:18,723 INFO L87 Difference]: Start difference. First operand 20926 states and 23900 transitions. Second operand 24 states. [2019-09-10 06:13:23,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:23,958 INFO L93 Difference]: Finished difference Result 26700 states and 32053 transitions. [2019-09-10 06:13:23,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 06:13:23,959 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 179 [2019-09-10 06:13:23,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:23,981 INFO L225 Difference]: With dead ends: 26700 [2019-09-10 06:13:23,981 INFO L226 Difference]: Without dead ends: 26700 [2019-09-10 06:13:23,981 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=374, Invalid=1696, Unknown=0, NotChecked=0, Total=2070 [2019-09-10 06:13:23,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26700 states. [2019-09-10 06:13:24,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26700 to 20886. [2019-09-10 06:13:24,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20886 states. [2019-09-10 06:13:24,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20886 states to 20886 states and 23854 transitions. [2019-09-10 06:13:24,161 INFO L78 Accepts]: Start accepts. Automaton has 20886 states and 23854 transitions. Word has length 179 [2019-09-10 06:13:24,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:24,161 INFO L475 AbstractCegarLoop]: Abstraction has 20886 states and 23854 transitions. [2019-09-10 06:13:24,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-10 06:13:24,162 INFO L276 IsEmpty]: Start isEmpty. Operand 20886 states and 23854 transitions. [2019-09-10 06:13:24,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-10 06:13:24,171 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:13:24,172 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:13:24,172 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:13:24,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:24,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1629966298, now seen corresponding path program 1 times [2019-09-10 06:13:24,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:13:24,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:24,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:24,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:24,174 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:24,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:25,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 06:13:25,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:13:25,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-10 06:13:25,762 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:25,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 06:13:25,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 06:13:25,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=593, Unknown=0, NotChecked=0, Total=650 [2019-09-10 06:13:25,765 INFO L87 Difference]: Start difference. First operand 20886 states and 23854 transitions. Second operand 26 states. [2019-09-10 06:13:26,877 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2019-09-10 06:13:27,168 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2019-09-10 06:13:27,458 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 73 [2019-09-10 06:13:27,834 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 06:13:28,010 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 06:13:28,284 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2019-09-10 06:13:28,424 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-09-10 06:13:29,150 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-09-10 06:13:29,385 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2019-09-10 06:13:29,766 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2019-09-10 06:13:29,989 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2019-09-10 06:13:30,730 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-09-10 06:13:30,984 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2019-09-10 06:13:31,207 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-09-10 06:13:31,821 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-09-10 06:13:32,055 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2019-09-10 06:13:32,497 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2019-09-10 06:13:33,407 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-09-10 06:13:34,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:34,258 INFO L93 Difference]: Finished difference Result 24421 states and 28826 transitions. [2019-09-10 06:13:34,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-10 06:13:34,259 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 179 [2019-09-10 06:13:34,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:34,274 INFO L225 Difference]: With dead ends: 24421 [2019-09-10 06:13:34,274 INFO L226 Difference]: Without dead ends: 24421 [2019-09-10 06:13:34,275 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=532, Invalid=2120, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 06:13:34,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24421 states. [2019-09-10 06:13:34,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24421 to 20886. [2019-09-10 06:13:34,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20886 states. [2019-09-10 06:13:34,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20886 states to 20886 states and 23854 transitions. [2019-09-10 06:13:34,422 INFO L78 Accepts]: Start accepts. Automaton has 20886 states and 23854 transitions. Word has length 179 [2019-09-10 06:13:34,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:34,423 INFO L475 AbstractCegarLoop]: Abstraction has 20886 states and 23854 transitions. [2019-09-10 06:13:34,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 06:13:34,423 INFO L276 IsEmpty]: Start isEmpty. Operand 20886 states and 23854 transitions. [2019-09-10 06:13:34,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-10 06:13:34,431 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:13:34,431 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:13:34,432 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:13:34,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:34,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1266926593, now seen corresponding path program 1 times [2019-09-10 06:13:34,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:13:34,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:34,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:34,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:34,433 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:34,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:34,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 06:13:34,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:13:34,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 06:13:34,858 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:34,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 06:13:34,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 06:13:34,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-10 06:13:34,859 INFO L87 Difference]: Start difference. First operand 20886 states and 23854 transitions. Second operand 16 states. [2019-09-10 06:13:37,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:37,687 INFO L93 Difference]: Finished difference Result 23577 states and 27056 transitions. [2019-09-10 06:13:37,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 06:13:37,687 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 179 [2019-09-10 06:13:37,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:37,709 INFO L225 Difference]: With dead ends: 23577 [2019-09-10 06:13:37,709 INFO L226 Difference]: Without dead ends: 23577 [2019-09-10 06:13:37,710 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=314, Invalid=876, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 06:13:37,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23577 states. [2019-09-10 06:13:37,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23577 to 21851. [2019-09-10 06:13:37,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21851 states. [2019-09-10 06:13:37,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21851 states to 21851 states and 24844 transitions. [2019-09-10 06:13:37,873 INFO L78 Accepts]: Start accepts. Automaton has 21851 states and 24844 transitions. Word has length 179 [2019-09-10 06:13:37,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:37,874 INFO L475 AbstractCegarLoop]: Abstraction has 21851 states and 24844 transitions. [2019-09-10 06:13:37,874 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 06:13:37,874 INFO L276 IsEmpty]: Start isEmpty. Operand 21851 states and 24844 transitions. [2019-09-10 06:13:37,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-10 06:13:37,884 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:13:37,884 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:13:37,884 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:13:37,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:37,885 INFO L82 PathProgramCache]: Analyzing trace with hash 2052486042, now seen corresponding path program 1 times [2019-09-10 06:13:37,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:13:37,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:37,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:37,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:37,885 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:37,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:38,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:13:38,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:13:38,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 06:13:38,601 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:38,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 06:13:38,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 06:13:38,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2019-09-10 06:13:38,602 INFO L87 Difference]: Start difference. First operand 21851 states and 24844 transitions. Second operand 18 states. [2019-09-10 06:13:42,949 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2019-09-10 06:13:43,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:43,024 INFO L93 Difference]: Finished difference Result 24029 states and 27326 transitions. [2019-09-10 06:13:43,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 06:13:43,025 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 179 [2019-09-10 06:13:43,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:43,045 INFO L225 Difference]: With dead ends: 24029 [2019-09-10 06:13:43,045 INFO L226 Difference]: Without dead ends: 24029 [2019-09-10 06:13:43,046 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=496, Invalid=1396, Unknown=0, NotChecked=0, Total=1892 [2019-09-10 06:13:43,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24029 states. [2019-09-10 06:13:43,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24029 to 22155. [2019-09-10 06:13:43,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22155 states. [2019-09-10 06:13:43,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22155 states to 22155 states and 25154 transitions. [2019-09-10 06:13:43,215 INFO L78 Accepts]: Start accepts. Automaton has 22155 states and 25154 transitions. Word has length 179 [2019-09-10 06:13:43,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:43,215 INFO L475 AbstractCegarLoop]: Abstraction has 22155 states and 25154 transitions. [2019-09-10 06:13:43,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 06:13:43,216 INFO L276 IsEmpty]: Start isEmpty. Operand 22155 states and 25154 transitions. [2019-09-10 06:13:43,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-10 06:13:43,226 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:13:43,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] [2019-09-10 06:13:43,227 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:13:43,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:43,227 INFO L82 PathProgramCache]: Analyzing trace with hash 823461012, now seen corresponding path program 1 times [2019-09-10 06:13:43,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:13:43,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:43,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:43,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:43,228 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:43,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:43,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:13:43,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:13:43,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 06:13:43,879 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:43,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 06:13:43,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 06:13:43,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2019-09-10 06:13:43,880 INFO L87 Difference]: Start difference. First operand 22155 states and 25154 transitions. Second operand 17 states. [2019-09-10 06:13:46,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:46,964 INFO L93 Difference]: Finished difference Result 28076 states and 33026 transitions. [2019-09-10 06:13:46,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 06:13:46,964 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 179 [2019-09-10 06:13:46,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:46,987 INFO L225 Difference]: With dead ends: 28076 [2019-09-10 06:13:46,987 INFO L226 Difference]: Without dead ends: 28076 [2019-09-10 06:13:46,987 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=385, Invalid=1021, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 06:13:46,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28076 states. [2019-09-10 06:13:47,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28076 to 21265. [2019-09-10 06:13:47,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21265 states. [2019-09-10 06:13:47,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21265 states to 21265 states and 24204 transitions. [2019-09-10 06:13:47,163 INFO L78 Accepts]: Start accepts. Automaton has 21265 states and 24204 transitions. Word has length 179 [2019-09-10 06:13:47,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:47,163 INFO L475 AbstractCegarLoop]: Abstraction has 21265 states and 24204 transitions. [2019-09-10 06:13:47,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 06:13:47,164 INFO L276 IsEmpty]: Start isEmpty. Operand 21265 states and 24204 transitions. [2019-09-10 06:13:47,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-10 06:13:47,173 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:13:47,173 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:13:47,174 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:13:47,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:47,174 INFO L82 PathProgramCache]: Analyzing trace with hash 423980196, now seen corresponding path program 1 times [2019-09-10 06:13:47,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:13:47,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:47,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:47,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:47,175 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:47,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:48,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:13:48,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:13:48,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-09-10 06:13:48,647 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:48,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 06:13:48,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 06:13:48,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2019-09-10 06:13:48,648 INFO L87 Difference]: Start difference. First operand 21265 states and 24204 transitions. Second operand 23 states. [2019-09-10 06:13:49,228 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-09-10 06:13:49,567 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 06:13:49,789 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 06:13:49,932 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 06:13:50,265 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-09-10 06:13:50,436 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-09-10 06:13:50,606 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-09-10 06:13:50,796 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 41 [2019-09-10 06:13:51,306 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 43 [2019-09-10 06:13:51,709 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 46 [2019-09-10 06:13:51,950 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 48 [2019-09-10 06:13:52,348 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 48 [2019-09-10 06:13:52,540 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 43 [2019-09-10 06:13:53,196 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-09-10 06:13:53,390 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2019-09-10 06:13:54,177 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-09-10 06:13:55,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:55,281 INFO L93 Difference]: Finished difference Result 27052 states and 31982 transitions. [2019-09-10 06:13:55,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 06:13:55,282 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 179 [2019-09-10 06:13:55,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:55,305 INFO L225 Difference]: With dead ends: 27052 [2019-09-10 06:13:55,305 INFO L226 Difference]: Without dead ends: 27052 [2019-09-10 06:13:55,305 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=442, Invalid=1364, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 06:13:55,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27052 states. [2019-09-10 06:13:55,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27052 to 21426. [2019-09-10 06:13:55,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21426 states. [2019-09-10 06:13:55,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21426 states to 21426 states and 24368 transitions. [2019-09-10 06:13:55,624 INFO L78 Accepts]: Start accepts. Automaton has 21426 states and 24368 transitions. Word has length 179 [2019-09-10 06:13:55,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:55,624 INFO L475 AbstractCegarLoop]: Abstraction has 21426 states and 24368 transitions. [2019-09-10 06:13:55,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 06:13:55,624 INFO L276 IsEmpty]: Start isEmpty. Operand 21426 states and 24368 transitions. [2019-09-10 06:13:55,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-10 06:13:55,633 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:13:55,634 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:13:55,634 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:13:55,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:55,634 INFO L82 PathProgramCache]: Analyzing trace with hash 453697913, now seen corresponding path program 1 times [2019-09-10 06:13:55,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:13:55,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:55,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:55,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:55,635 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:55,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:57,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:13:57,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:13:57,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-10 06:13:57,234 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:57,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 06:13:57,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 06:13:57,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650 [2019-09-10 06:13:57,235 INFO L87 Difference]: Start difference. First operand 21426 states and 24368 transitions. Second operand 26 states. [2019-09-10 06:13:57,420 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 06:14:00,556 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-10 06:14:00,902 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-09-10 06:14:01,836 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2019-09-10 06:14:04,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:14:04,402 INFO L93 Difference]: Finished difference Result 25754 states and 30251 transitions. [2019-09-10 06:14:04,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-10 06:14:04,403 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 179 [2019-09-10 06:14:04,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:14:04,427 INFO L225 Difference]: With dead ends: 25754 [2019-09-10 06:14:04,427 INFO L226 Difference]: Without dead ends: 25687 [2019-09-10 06:14:04,427 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 621 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=547, Invalid=2759, Unknown=0, NotChecked=0, Total=3306 [2019-09-10 06:14:04,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25687 states. [2019-09-10 06:14:04,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25687 to 21338. [2019-09-10 06:14:04,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21338 states. [2019-09-10 06:14:04,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21338 states to 21338 states and 24273 transitions. [2019-09-10 06:14:04,603 INFO L78 Accepts]: Start accepts. Automaton has 21338 states and 24273 transitions. Word has length 179 [2019-09-10 06:14:04,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:14:04,603 INFO L475 AbstractCegarLoop]: Abstraction has 21338 states and 24273 transitions. [2019-09-10 06:14:04,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 06:14:04,603 INFO L276 IsEmpty]: Start isEmpty. Operand 21338 states and 24273 transitions. [2019-09-10 06:14:04,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-10 06:14:04,613 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:14:04,613 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:14:04,614 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:14:04,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:04,614 INFO L82 PathProgramCache]: Analyzing trace with hash -617746241, now seen corresponding path program 1 times [2019-09-10 06:14:04,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:14:04,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:04,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:04,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:04,616 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:14:04,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:14:06,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:14:06,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:14:06,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-10 06:14:06,308 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:14:06,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 06:14:06,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 06:14:06,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=518, Unknown=0, NotChecked=0, Total=600 [2019-09-10 06:14:06,309 INFO L87 Difference]: Start difference. First operand 21338 states and 24273 transitions. Second operand 25 states. [2019-09-10 06:14:07,124 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2019-09-10 06:14:07,433 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2019-09-10 06:14:07,661 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2019-09-10 06:14:08,051 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2019-09-10 06:14:08,247 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-09-10 06:14:08,532 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2019-09-10 06:14:12,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:14:12,427 INFO L93 Difference]: Finished difference Result 24388 states and 28747 transitions. [2019-09-10 06:14:12,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-10 06:14:12,427 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 179 [2019-09-10 06:14:12,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:14:12,447 INFO L225 Difference]: With dead ends: 24388 [2019-09-10 06:14:12,447 INFO L226 Difference]: Without dead ends: 24379 [2019-09-10 06:14:12,447 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=463, Invalid=1793, Unknown=0, NotChecked=0, Total=2256 [2019-09-10 06:14:12,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24379 states. [2019-09-10 06:14:12,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24379 to 20895. [2019-09-10 06:14:12,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20895 states. [2019-09-10 06:14:12,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20895 states to 20895 states and 23816 transitions. [2019-09-10 06:14:12,599 INFO L78 Accepts]: Start accepts. Automaton has 20895 states and 23816 transitions. Word has length 179 [2019-09-10 06:14:12,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:14:12,599 INFO L475 AbstractCegarLoop]: Abstraction has 20895 states and 23816 transitions. [2019-09-10 06:14:12,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 06:14:12,599 INFO L276 IsEmpty]: Start isEmpty. Operand 20895 states and 23816 transitions. [2019-09-10 06:14:12,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-10 06:14:12,608 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:14:12,608 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:14:12,608 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:14:12,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:12,609 INFO L82 PathProgramCache]: Analyzing trace with hash -775327117, now seen corresponding path program 1 times [2019-09-10 06:14:12,609 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:14:12,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:12,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:12,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:12,610 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:14:12,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:14:14,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:14:14,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:14:14,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-10 06:14:14,468 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:14:14,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 06:14:14,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 06:14:14,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=591, Unknown=0, NotChecked=0, Total=650 [2019-09-10 06:14:14,469 INFO L87 Difference]: Start difference. First operand 20895 states and 23816 transitions. Second operand 26 states. [2019-09-10 06:14:15,173 WARN L188 SmtUtils]: Spent 665.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 129 [2019-09-10 06:14:16,391 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 06:14:16,576 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 06:14:17,370 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2019-09-10 06:14:17,551 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 51 [2019-09-10 06:14:17,874 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 74 [2019-09-10 06:14:18,390 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 06:14:18,744 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 06:14:19,004 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2019-09-10 06:14:19,276 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-10 06:14:21,314 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-10 06:14:23,708 WARN L188 SmtUtils]: Spent 2.26 s on a formula simplification. DAG size of input: 85 DAG size of output: 80 [2019-09-10 06:14:25,976 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2019-09-10 06:14:26,352 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-09-10 06:14:27,070 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 72 [2019-09-10 06:14:27,218 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-09-10 06:14:28,064 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 89 [2019-09-10 06:14:28,541 WARN L188 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 97 [2019-09-10 06:14:30,074 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 99 [2019-09-10 06:14:31,167 WARN L188 SmtUtils]: Spent 978.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 103 [2019-09-10 06:14:32,589 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 79 [2019-09-10 06:14:32,869 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 78 [2019-09-10 06:14:33,274 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 76 [2019-09-10 06:14:34,608 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 82 [2019-09-10 06:14:36,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:14:36,958 INFO L93 Difference]: Finished difference Result 27007 states and 32420 transitions. [2019-09-10 06:14:36,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-10 06:14:36,958 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 179 [2019-09-10 06:14:36,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:14:36,980 INFO L225 Difference]: With dead ends: 27007 [2019-09-10 06:14:36,981 INFO L226 Difference]: Without dead ends: 27007 [2019-09-10 06:14:36,981 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1196 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=1081, Invalid=4469, Unknown=0, NotChecked=0, Total=5550 [2019-09-10 06:14:36,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27007 states. [2019-09-10 06:14:37,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27007 to 20889. [2019-09-10 06:14:37,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20889 states. [2019-09-10 06:14:37,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20889 states to 20889 states and 23809 transitions. [2019-09-10 06:14:37,154 INFO L78 Accepts]: Start accepts. Automaton has 20889 states and 23809 transitions. Word has length 179 [2019-09-10 06:14:37,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:14:37,154 INFO L475 AbstractCegarLoop]: Abstraction has 20889 states and 23809 transitions. [2019-09-10 06:14:37,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 06:14:37,155 INFO L276 IsEmpty]: Start isEmpty. Operand 20889 states and 23809 transitions. [2019-09-10 06:14:37,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-10 06:14:37,163 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:14:37,164 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:14:37,164 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:14:37,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:37,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1814547479, now seen corresponding path program 1 times [2019-09-10 06:14:37,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:14:37,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:37,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:37,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:37,166 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:14:37,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:14:37,919 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 22 [2019-09-10 06:14:38,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:14:38,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:14:38,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 06:14:38,380 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:14:38,380 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 06:14:38,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 06:14:38,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2019-09-10 06:14:38,381 INFO L87 Difference]: Start difference. First operand 20889 states and 23809 transitions. Second operand 17 states. [2019-09-10 06:14:39,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:14:39,834 INFO L93 Difference]: Finished difference Result 20848 states and 23749 transitions. [2019-09-10 06:14:39,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 06:14:39,835 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 179 [2019-09-10 06:14:39,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:14:39,850 INFO L225 Difference]: With dead ends: 20848 [2019-09-10 06:14:39,850 INFO L226 Difference]: Without dead ends: 20079 [2019-09-10 06:14:39,851 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600 [2019-09-10 06:14:39,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20079 states. [2019-09-10 06:14:39,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20079 to 20064. [2019-09-10 06:14:39,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20064 states. [2019-09-10 06:14:39,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20064 states to 20064 states and 22964 transitions. [2019-09-10 06:14:39,996 INFO L78 Accepts]: Start accepts. Automaton has 20064 states and 22964 transitions. Word has length 179 [2019-09-10 06:14:39,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:14:39,997 INFO L475 AbstractCegarLoop]: Abstraction has 20064 states and 22964 transitions. [2019-09-10 06:14:39,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 06:14:39,997 INFO L276 IsEmpty]: Start isEmpty. Operand 20064 states and 22964 transitions. [2019-09-10 06:14:40,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-10 06:14:40,006 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:14:40,006 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:14:40,006 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:14:40,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:40,007 INFO L82 PathProgramCache]: Analyzing trace with hash 682165715, now seen corresponding path program 1 times [2019-09-10 06:14:40,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:14:40,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:40,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:40,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:40,008 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:14:40,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:14:41,441 WARN L188 SmtUtils]: Spent 667.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 39 [2019-09-10 06:14:42,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:14:42,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:14:42,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2019-09-10 06:14:42,545 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:14:42,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-10 06:14:42,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-10 06:14:42,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=794, Unknown=0, NotChecked=0, Total=870 [2019-09-10 06:14:42,546 INFO L87 Difference]: Start difference. First operand 20064 states and 22964 transitions. Second operand 30 states. [2019-09-10 06:14:44,243 WARN L188 SmtUtils]: Spent 1.63 s on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-09-10 06:14:44,925 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-09-10 06:14:46,441 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2019-09-10 06:14:46,758 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2019-09-10 06:14:46,914 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2019-09-10 06:14:47,220 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 06:14:47,522 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 64 [2019-09-10 06:14:48,117 WARN L188 SmtUtils]: Spent 468.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 83 [2019-09-10 06:14:48,866 WARN L188 SmtUtils]: Spent 632.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 92 [2019-09-10 06:14:49,484 WARN L188 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 94 [2019-09-10 06:14:50,018 WARN L188 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 99 [2019-09-10 06:14:50,235 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-09-10 06:14:50,431 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-09-10 06:14:50,609 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2019-09-10 06:14:50,928 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-10 06:14:51,133 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 06:14:51,524 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 06:14:53,818 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-09-10 06:14:54,017 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 44 [2019-09-10 06:14:54,195 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-10 06:14:55,230 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-10 06:14:56,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:14:56,844 INFO L93 Difference]: Finished difference Result 21836 states and 25093 transitions. [2019-09-10 06:14:56,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-10 06:14:56,844 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 179 [2019-09-10 06:14:56,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:14:56,860 INFO L225 Difference]: With dead ends: 21836 [2019-09-10 06:14:56,860 INFO L226 Difference]: Without dead ends: 21836 [2019-09-10 06:14:56,860 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 633 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=596, Invalid=3186, Unknown=0, NotChecked=0, Total=3782 [2019-09-10 06:14:56,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21836 states. [2019-09-10 06:14:56,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21836 to 20055. [2019-09-10 06:14:56,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20055 states. [2019-09-10 06:14:57,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20055 states to 20055 states and 22953 transitions. [2019-09-10 06:14:57,005 INFO L78 Accepts]: Start accepts. Automaton has 20055 states and 22953 transitions. Word has length 179 [2019-09-10 06:14:57,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:14:57,006 INFO L475 AbstractCegarLoop]: Abstraction has 20055 states and 22953 transitions. [2019-09-10 06:14:57,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-10 06:14:57,006 INFO L276 IsEmpty]: Start isEmpty. Operand 20055 states and 22953 transitions. [2019-09-10 06:14:57,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-10 06:14:57,015 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:14:57,015 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:14:57,016 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:14:57,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:57,016 INFO L82 PathProgramCache]: Analyzing trace with hash -539359104, now seen corresponding path program 1 times [2019-09-10 06:14:57,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:14:57,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:57,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:57,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:57,017 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:14:57,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:14:58,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:14:58,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:14:58,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-10 06:14:58,464 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:14:58,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 06:14:58,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 06:14:58,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2019-09-10 06:14:58,466 INFO L87 Difference]: Start difference. First operand 20055 states and 22953 transitions. Second operand 25 states. [2019-09-10 06:14:59,004 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-09-10 06:14:59,252 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-09-10 06:14:59,485 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-09-10 06:14:59,884 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-09-10 06:15:00,186 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2019-09-10 06:15:00,573 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2019-09-10 06:15:00,925 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 79 [2019-09-10 06:15:01,216 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-09-10 06:15:01,492 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-09-10 06:15:01,649 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-09-10 06:15:01,905 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-09-10 06:15:02,082 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-09-10 06:15:02,367 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-09-10 06:15:05,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:05,053 INFO L93 Difference]: Finished difference Result 24563 states and 29368 transitions. [2019-09-10 06:15:05,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 06:15:05,054 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 179 [2019-09-10 06:15:05,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:05,071 INFO L225 Difference]: With dead ends: 24563 [2019-09-10 06:15:05,072 INFO L226 Difference]: Without dead ends: 24563 [2019-09-10 06:15:05,072 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=299, Invalid=1261, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 06:15:05,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24563 states. [2019-09-10 06:15:05,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24563 to 22225. [2019-09-10 06:15:05,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22225 states. [2019-09-10 06:15:05,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22225 states to 22225 states and 26084 transitions. [2019-09-10 06:15:05,216 INFO L78 Accepts]: Start accepts. Automaton has 22225 states and 26084 transitions. Word has length 179 [2019-09-10 06:15:05,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:05,216 INFO L475 AbstractCegarLoop]: Abstraction has 22225 states and 26084 transitions. [2019-09-10 06:15:05,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 06:15:05,216 INFO L276 IsEmpty]: Start isEmpty. Operand 22225 states and 26084 transitions. [2019-09-10 06:15:05,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-10 06:15:05,225 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:05,225 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:15:05,226 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:05,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:05,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1276520594, now seen corresponding path program 1 times [2019-09-10 06:15:05,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:05,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:05,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:05,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:05,227 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:05,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:06,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:15:06,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:15:06,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-10 06:15:06,242 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:15:06,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 06:15:06,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 06:15:06,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2019-09-10 06:15:06,242 INFO L87 Difference]: Start difference. First operand 22225 states and 26084 transitions. Second operand 20 states. [2019-09-10 06:15:08,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:08,534 INFO L93 Difference]: Finished difference Result 25261 states and 30087 transitions. [2019-09-10 06:15:08,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 06:15:08,535 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 179 [2019-09-10 06:15:08,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:08,554 INFO L225 Difference]: With dead ends: 25261 [2019-09-10 06:15:08,554 INFO L226 Difference]: Without dead ends: 25261 [2019-09-10 06:15:08,555 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=230, Invalid=640, Unknown=0, NotChecked=0, Total=870 [2019-09-10 06:15:08,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25261 states. [2019-09-10 06:15:08,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25261 to 22133. [2019-09-10 06:15:08,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22133 states. [2019-09-10 06:15:08,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22133 states to 22133 states and 25984 transitions. [2019-09-10 06:15:08,717 INFO L78 Accepts]: Start accepts. Automaton has 22133 states and 25984 transitions. Word has length 179 [2019-09-10 06:15:08,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:08,717 INFO L475 AbstractCegarLoop]: Abstraction has 22133 states and 25984 transitions. [2019-09-10 06:15:08,717 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 06:15:08,717 INFO L276 IsEmpty]: Start isEmpty. Operand 22133 states and 25984 transitions. [2019-09-10 06:15:08,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-10 06:15:08,726 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:08,726 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:15:08,726 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:08,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:08,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1174552155, now seen corresponding path program 1 times [2019-09-10 06:15:08,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:08,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:08,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:08,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:08,727 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:08,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:09,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:15:09,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:15:09,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 06:15:09,206 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:15:09,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 06:15:09,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 06:15:09,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2019-09-10 06:15:09,207 INFO L87 Difference]: Start difference. First operand 22133 states and 25984 transitions. Second operand 19 states. [2019-09-10 06:15:12,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:12,475 INFO L93 Difference]: Finished difference Result 25420 states and 30036 transitions. [2019-09-10 06:15:12,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 06:15:12,475 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 179 [2019-09-10 06:15:12,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:12,495 INFO L225 Difference]: With dead ends: 25420 [2019-09-10 06:15:12,495 INFO L226 Difference]: Without dead ends: 25420 [2019-09-10 06:15:12,495 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=300, Invalid=1106, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 06:15:12,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25420 states. [2019-09-10 06:15:12,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25420 to 22768. [2019-09-10 06:15:12,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22768 states. [2019-09-10 06:15:12,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22768 states to 22768 states and 26640 transitions. [2019-09-10 06:15:12,661 INFO L78 Accepts]: Start accepts. Automaton has 22768 states and 26640 transitions. Word has length 179 [2019-09-10 06:15:12,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:12,661 INFO L475 AbstractCegarLoop]: Abstraction has 22768 states and 26640 transitions. [2019-09-10 06:15:12,661 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 06:15:12,661 INFO L276 IsEmpty]: Start isEmpty. Operand 22768 states and 26640 transitions. [2019-09-10 06:15:12,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-10 06:15:12,670 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:12,670 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:15:12,671 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:12,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:12,671 INFO L82 PathProgramCache]: Analyzing trace with hash 820495760, now seen corresponding path program 1 times [2019-09-10 06:15:12,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:12,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:12,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:12,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:12,672 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:12,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:14,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:15:14,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:15:14,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2019-09-10 06:15:14,082 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:15:14,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-10 06:15:14,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-10 06:15:14,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=747, Unknown=0, NotChecked=0, Total=812 [2019-09-10 06:15:14,083 INFO L87 Difference]: Start difference. First operand 22768 states and 26640 transitions. Second operand 29 states. [2019-09-10 06:15:15,068 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2019-09-10 06:15:15,277 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 61 [2019-09-10 06:15:15,996 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-09-10 06:15:16,895 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-09-10 06:15:17,576 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-09-10 06:15:17,774 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-10 06:15:18,046 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-09-10 06:15:18,282 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-09-10 06:15:18,532 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 61 [2019-09-10 06:15:18,787 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-09-10 06:15:19,092 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-09-10 06:15:19,830 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-09-10 06:15:20,171 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-09-10 06:15:20,398 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-10 06:15:20,556 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-09-10 06:15:20,795 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-09-10 06:15:21,072 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-09-10 06:15:21,251 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-10 06:15:21,404 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-09-10 06:15:21,866 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-09-10 06:15:22,089 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-10 06:15:22,411 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-10 06:15:22,673 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-09-10 06:15:23,130 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-09-10 06:15:23,322 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-09-10 06:15:23,531 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-10 06:15:23,766 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-09-10 06:15:24,039 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2019-09-10 06:15:24,290 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-09-10 06:15:24,848 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2019-09-10 06:15:25,021 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2019-09-10 06:15:25,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:25,872 INFO L93 Difference]: Finished difference Result 22906 states and 26777 transitions. [2019-09-10 06:15:25,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-10 06:15:25,873 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 179 [2019-09-10 06:15:25,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:25,889 INFO L225 Difference]: With dead ends: 22906 [2019-09-10 06:15:25,889 INFO L226 Difference]: Without dead ends: 22906 [2019-09-10 06:15:25,890 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 819 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=1094, Invalid=4162, Unknown=0, NotChecked=0, Total=5256 [2019-09-10 06:15:25,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22906 states. [2019-09-10 06:15:26,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22906 to 22773. [2019-09-10 06:15:26,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22773 states. [2019-09-10 06:15:26,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22773 states to 22773 states and 26644 transitions. [2019-09-10 06:15:26,042 INFO L78 Accepts]: Start accepts. Automaton has 22773 states and 26644 transitions. Word has length 179 [2019-09-10 06:15:26,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:26,042 INFO L475 AbstractCegarLoop]: Abstraction has 22773 states and 26644 transitions. [2019-09-10 06:15:26,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-10 06:15:26,042 INFO L276 IsEmpty]: Start isEmpty. Operand 22773 states and 26644 transitions. [2019-09-10 06:15:26,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-10 06:15:26,051 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:26,051 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:15:26,051 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:26,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:26,051 INFO L82 PathProgramCache]: Analyzing trace with hash -5717254, now seen corresponding path program 1 times [2019-09-10 06:15:26,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:26,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:26,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:26,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:26,052 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:26,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:27,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:15:27,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:15:27,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-09-10 06:15:27,175 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:15:27,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 06:15:27,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 06:15:27,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2019-09-10 06:15:27,175 INFO L87 Difference]: Start difference. First operand 22773 states and 26644 transitions. Second operand 23 states. [2019-09-10 06:15:27,894 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 31 [2019-09-10 06:15:30,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:30,931 INFO L93 Difference]: Finished difference Result 22785 states and 26651 transitions. [2019-09-10 06:15:30,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 06:15:30,932 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 179 [2019-09-10 06:15:30,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:30,947 INFO L225 Difference]: With dead ends: 22785 [2019-09-10 06:15:30,948 INFO L226 Difference]: Without dead ends: 22396 [2019-09-10 06:15:30,948 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=336, Invalid=1070, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 06:15:30,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22396 states. [2019-09-10 06:15:31,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22396 to 22390. [2019-09-10 06:15:31,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22390 states. [2019-09-10 06:15:31,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22390 states to 22390 states and 26251 transitions. [2019-09-10 06:15:31,095 INFO L78 Accepts]: Start accepts. Automaton has 22390 states and 26251 transitions. Word has length 179 [2019-09-10 06:15:31,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:31,096 INFO L475 AbstractCegarLoop]: Abstraction has 22390 states and 26251 transitions. [2019-09-10 06:15:31,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 06:15:31,096 INFO L276 IsEmpty]: Start isEmpty. Operand 22390 states and 26251 transitions. [2019-09-10 06:15:31,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-10 06:15:31,104 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:31,104 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:15:31,104 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:31,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:31,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1231244729, now seen corresponding path program 1 times [2019-09-10 06:15:31,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:31,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:31,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:31,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:31,105 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:31,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:32,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:15:32,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:15:32,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-10 06:15:32,199 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:15:32,199 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 06:15:32,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 06:15:32,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2019-09-10 06:15:32,200 INFO L87 Difference]: Start difference. First operand 22390 states and 26251 transitions. Second operand 26 states. [2019-09-10 06:15:38,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:38,661 INFO L93 Difference]: Finished difference Result 28102 states and 33979 transitions. [2019-09-10 06:15:38,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-10 06:15:38,661 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 179 [2019-09-10 06:15:38,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:38,683 INFO L225 Difference]: With dead ends: 28102 [2019-09-10 06:15:38,683 INFO L226 Difference]: Without dead ends: 27990 [2019-09-10 06:15:38,684 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 642 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=511, Invalid=2681, Unknown=0, NotChecked=0, Total=3192 [2019-09-10 06:15:38,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27990 states. [2019-09-10 06:15:38,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27990 to 22768. [2019-09-10 06:15:38,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22768 states. [2019-09-10 06:15:38,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22768 states to 22768 states and 26626 transitions. [2019-09-10 06:15:38,866 INFO L78 Accepts]: Start accepts. Automaton has 22768 states and 26626 transitions. Word has length 179 [2019-09-10 06:15:38,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:38,866 INFO L475 AbstractCegarLoop]: Abstraction has 22768 states and 26626 transitions. [2019-09-10 06:15:38,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 06:15:38,866 INFO L276 IsEmpty]: Start isEmpty. Operand 22768 states and 26626 transitions. [2019-09-10 06:15:38,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-10 06:15:38,874 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:38,875 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:15:38,875 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:38,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:38,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1387307609, now seen corresponding path program 1 times [2019-09-10 06:15:38,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:38,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:38,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:38,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:38,876 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:38,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:39,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:15:39,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:15:39,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-10 06:15:39,634 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:15:39,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 06:15:39,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 06:15:39,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2019-09-10 06:15:39,635 INFO L87 Difference]: Start difference. First operand 22768 states and 26626 transitions. Second operand 20 states. [2019-09-10 06:15:39,906 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 79 [2019-09-10 06:15:40,172 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 73 [2019-09-10 06:15:41,102 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-09-10 06:15:42,537 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-10 06:15:42,717 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-10 06:15:43,311 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-09-10 06:15:43,660 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2019-09-10 06:15:43,894 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-09-10 06:15:44,615 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2019-09-10 06:15:47,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:47,828 INFO L93 Difference]: Finished difference Result 27368 states and 32448 transitions. [2019-09-10 06:15:47,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-10 06:15:47,828 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 179 [2019-09-10 06:15:47,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:47,849 INFO L225 Difference]: With dead ends: 27368 [2019-09-10 06:15:47,849 INFO L226 Difference]: Without dead ends: 27235 [2019-09-10 06:15:47,850 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 838 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=644, Invalid=2896, Unknown=0, NotChecked=0, Total=3540 [2019-09-10 06:15:47,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27235 states. [2019-09-10 06:15:47,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27235 to 22646. [2019-09-10 06:15:47,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22646 states. [2019-09-10 06:15:48,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22646 states to 22646 states and 26501 transitions. [2019-09-10 06:15:48,018 INFO L78 Accepts]: Start accepts. Automaton has 22646 states and 26501 transitions. Word has length 179 [2019-09-10 06:15:48,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:48,018 INFO L475 AbstractCegarLoop]: Abstraction has 22646 states and 26501 transitions. [2019-09-10 06:15:48,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 06:15:48,018 INFO L276 IsEmpty]: Start isEmpty. Operand 22646 states and 26501 transitions. [2019-09-10 06:15:48,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-10 06:15:48,027 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:48,027 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:15:48,027 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:48,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:48,028 INFO L82 PathProgramCache]: Analyzing trace with hash -244946756, now seen corresponding path program 1 times [2019-09-10 06:15:48,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:48,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:48,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:48,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:48,029 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:48,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:49,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:15:49,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:15:49,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2019-09-10 06:15:49,895 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:15:49,896 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-10 06:15:49,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-10 06:15:49,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=722, Unknown=0, NotChecked=0, Total=812 [2019-09-10 06:15:49,896 INFO L87 Difference]: Start difference. First operand 22646 states and 26501 transitions. Second operand 29 states. [2019-09-10 06:15:51,751 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2019-09-10 06:15:51,944 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 45 [2019-09-10 06:15:52,339 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-09-10 06:15:52,562 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 57 [2019-09-10 06:15:53,103 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 66 [2019-09-10 06:15:53,382 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2019-09-10 06:15:53,558 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2019-09-10 06:15:54,119 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2019-09-10 06:15:54,393 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-09-10 06:15:55,118 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 43 [2019-09-10 06:15:55,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:55,988 INFO L93 Difference]: Finished difference Result 25002 states and 29805 transitions. [2019-09-10 06:15:55,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-10 06:15:55,989 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 179 [2019-09-10 06:15:55,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:56,004 INFO L225 Difference]: With dead ends: 25002 [2019-09-10 06:15:56,004 INFO L226 Difference]: Without dead ends: 25002 [2019-09-10 06:15:56,004 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=442, Invalid=1814, Unknown=0, NotChecked=0, Total=2256 [2019-09-10 06:15:56,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25002 states. [2019-09-10 06:15:56,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25002 to 22666. [2019-09-10 06:15:56,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22666 states. [2019-09-10 06:15:56,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22666 states to 22666 states and 26522 transitions. [2019-09-10 06:15:56,154 INFO L78 Accepts]: Start accepts. Automaton has 22666 states and 26522 transitions. Word has length 179 [2019-09-10 06:15:56,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:56,154 INFO L475 AbstractCegarLoop]: Abstraction has 22666 states and 26522 transitions. [2019-09-10 06:15:56,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-10 06:15:56,154 INFO L276 IsEmpty]: Start isEmpty. Operand 22666 states and 26522 transitions. [2019-09-10 06:15:56,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-10 06:15:56,163 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:56,163 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:15:56,163 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:56,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:56,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1103821286, now seen corresponding path program 1 times [2019-09-10 06:15:56,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:56,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:56,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:56,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:56,164 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:56,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:56,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:15:56,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:15:56,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 06:15:56,685 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:15:56,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 06:15:56,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 06:15:56,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 06:15:56,685 INFO L87 Difference]: Start difference. First operand 22666 states and 26522 transitions. Second operand 17 states. [2019-09-10 06:16:00,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:16:00,418 INFO L93 Difference]: Finished difference Result 29837 states and 36412 transitions. [2019-09-10 06:16:00,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 06:16:00,418 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 179 [2019-09-10 06:16:00,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:16:00,442 INFO L225 Difference]: With dead ends: 29837 [2019-09-10 06:16:00,442 INFO L226 Difference]: Without dead ends: 29823 [2019-09-10 06:16:00,442 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=351, Invalid=1209, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 06:16:00,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29823 states. [2019-09-10 06:16:00,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29823 to 19307. [2019-09-10 06:16:00,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19307 states. [2019-09-10 06:16:00,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19307 states to 19307 states and 22103 transitions. [2019-09-10 06:16:00,615 INFO L78 Accepts]: Start accepts. Automaton has 19307 states and 22103 transitions. Word has length 179 [2019-09-10 06:16:00,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:16:00,615 INFO L475 AbstractCegarLoop]: Abstraction has 19307 states and 22103 transitions. [2019-09-10 06:16:00,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 06:16:00,615 INFO L276 IsEmpty]: Start isEmpty. Operand 19307 states and 22103 transitions. [2019-09-10 06:16:00,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-10 06:16:00,623 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:16:00,623 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:16:00,624 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:16:00,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:16:00,624 INFO L82 PathProgramCache]: Analyzing trace with hash -299305790, now seen corresponding path program 1 times [2019-09-10 06:16:00,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:16:00,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:00,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:16:00,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:00,625 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:16:00,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:16:01,303 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 32 [2019-09-10 06:16:01,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 06:16:01,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:16:01,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 06:16:01,858 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:16:01,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 06:16:01,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 06:16:01,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2019-09-10 06:16:01,859 INFO L87 Difference]: Start difference. First operand 19307 states and 22103 transitions. Second operand 22 states. [2019-09-10 06:16:02,693 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 36 [2019-09-10 06:16:02,837 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-09-10 06:16:03,036 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 44 [2019-09-10 06:16:03,304 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 50 [2019-09-10 06:16:03,475 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 44 [2019-09-10 06:16:03,735 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2019-09-10 06:16:03,944 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2019-09-10 06:16:04,111 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-10 06:16:04,348 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-10 06:16:04,599 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2019-09-10 06:16:04,864 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-09-10 06:16:05,071 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2019-09-10 06:16:05,396 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2019-09-10 06:16:06,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:16:06,847 INFO L93 Difference]: Finished difference Result 18848 states and 21620 transitions. [2019-09-10 06:16:06,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 06:16:06,847 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 179 [2019-09-10 06:16:06,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:16:06,860 INFO L225 Difference]: With dead ends: 18848 [2019-09-10 06:16:06,860 INFO L226 Difference]: Without dead ends: 18848 [2019-09-10 06:16:06,861 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=394, Invalid=1246, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 06:16:06,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18848 states. [2019-09-10 06:16:07,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18848 to 18832. [2019-09-10 06:16:07,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18832 states. [2019-09-10 06:16:07,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18832 states to 18832 states and 21602 transitions. [2019-09-10 06:16:07,081 INFO L78 Accepts]: Start accepts. Automaton has 18832 states and 21602 transitions. Word has length 179 [2019-09-10 06:16:07,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:16:07,081 INFO L475 AbstractCegarLoop]: Abstraction has 18832 states and 21602 transitions. [2019-09-10 06:16:07,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 06:16:07,081 INFO L276 IsEmpty]: Start isEmpty. Operand 18832 states and 21602 transitions. [2019-09-10 06:16:07,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-10 06:16:07,090 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:16:07,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] [2019-09-10 06:16:07,090 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:16:07,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:16:07,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1719939095, now seen corresponding path program 1 times [2019-09-10 06:16:07,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:16:07,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:07,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:16:07,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:07,092 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:16:07,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:16:07,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:16:07,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:16:07,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 06:16:07,927 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:16:07,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 06:16:07,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 06:16:07,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2019-09-10 06:16:07,928 INFO L87 Difference]: Start difference. First operand 18832 states and 21602 transitions. Second operand 19 states. [2019-09-10 06:16:10,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:16:10,807 INFO L93 Difference]: Finished difference Result 18688 states and 21452 transitions. [2019-09-10 06:16:10,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 06:16:10,807 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 179 [2019-09-10 06:16:10,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:16:10,825 INFO L225 Difference]: With dead ends: 18688 [2019-09-10 06:16:10,825 INFO L226 Difference]: Without dead ends: 18684 [2019-09-10 06:16:10,825 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=238, Invalid=884, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 06:16:10,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18684 states. [2019-09-10 06:16:10,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18684 to 18682. [2019-09-10 06:16:10,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18682 states. [2019-09-10 06:16:10,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18682 states to 18682 states and 21447 transitions. [2019-09-10 06:16:10,949 INFO L78 Accepts]: Start accepts. Automaton has 18682 states and 21447 transitions. Word has length 179 [2019-09-10 06:16:10,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:16:10,949 INFO L475 AbstractCegarLoop]: Abstraction has 18682 states and 21447 transitions. [2019-09-10 06:16:10,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 06:16:10,949 INFO L276 IsEmpty]: Start isEmpty. Operand 18682 states and 21447 transitions. [2019-09-10 06:16:10,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-10 06:16:10,957 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:16:10,957 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:16:10,957 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:16:10,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:16:10,957 INFO L82 PathProgramCache]: Analyzing trace with hash -465315407, now seen corresponding path program 1 times [2019-09-10 06:16:10,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:16:10,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:10,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:16:10,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:10,959 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:16:10,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:16:11,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:16:11,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:16:11,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 06:16:11,334 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:16:11,335 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 06:16:11,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 06:16:11,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2019-09-10 06:16:11,335 INFO L87 Difference]: Start difference. First operand 18682 states and 21447 transitions. Second operand 19 states. [2019-09-10 06:16:13,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:16:13,504 INFO L93 Difference]: Finished difference Result 21667 states and 25830 transitions. [2019-09-10 06:16:13,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 06:16:13,504 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 179 [2019-09-10 06:16:13,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:16:13,519 INFO L225 Difference]: With dead ends: 21667 [2019-09-10 06:16:13,519 INFO L226 Difference]: Without dead ends: 21667 [2019-09-10 06:16:13,519 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=240, Invalid=882, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 06:16:13,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21667 states. [2019-09-10 06:16:13,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21667 to 18187. [2019-09-10 06:16:13,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18187 states. [2019-09-10 06:16:13,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18187 states to 18187 states and 20929 transitions. [2019-09-10 06:16:13,653 INFO L78 Accepts]: Start accepts. Automaton has 18187 states and 20929 transitions. Word has length 179 [2019-09-10 06:16:13,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:16:13,654 INFO L475 AbstractCegarLoop]: Abstraction has 18187 states and 20929 transitions. [2019-09-10 06:16:13,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 06:16:13,654 INFO L276 IsEmpty]: Start isEmpty. Operand 18187 states and 20929 transitions. [2019-09-10 06:16:13,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 06:16:13,661 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:16:13,661 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:16:13,661 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:16:13,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:16:13,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1622685642, now seen corresponding path program 1 times [2019-09-10 06:16:13,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:16:13,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:13,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:16:13,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:13,663 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:16:13,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:16:14,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:16:14,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:16:14,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 06:16:14,160 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:16:14,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 06:16:14,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 06:16:14,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2019-09-10 06:16:14,161 INFO L87 Difference]: Start difference. First operand 18187 states and 20929 transitions. Second operand 21 states. [2019-09-10 06:16:14,299 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-09-10 06:16:20,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:16:20,875 INFO L93 Difference]: Finished difference Result 28964 states and 35156 transitions. [2019-09-10 06:16:20,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-10 06:16:20,875 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 180 [2019-09-10 06:16:20,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:16:20,897 INFO L225 Difference]: With dead ends: 28964 [2019-09-10 06:16:20,897 INFO L226 Difference]: Without dead ends: 28843 [2019-09-10 06:16:20,897 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=591, Invalid=2489, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 06:16:20,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28843 states. [2019-09-10 06:16:21,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28843 to 18633. [2019-09-10 06:16:21,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18633 states. [2019-09-10 06:16:21,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18633 states to 18633 states and 21379 transitions. [2019-09-10 06:16:21,053 INFO L78 Accepts]: Start accepts. Automaton has 18633 states and 21379 transitions. Word has length 180 [2019-09-10 06:16:21,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:16:21,053 INFO L475 AbstractCegarLoop]: Abstraction has 18633 states and 21379 transitions. [2019-09-10 06:16:21,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 06:16:21,054 INFO L276 IsEmpty]: Start isEmpty. Operand 18633 states and 21379 transitions. [2019-09-10 06:16:21,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 06:16:21,061 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:16:21,061 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:16:21,062 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:16:21,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:16:21,062 INFO L82 PathProgramCache]: Analyzing trace with hash -55710946, now seen corresponding path program 1 times [2019-09-10 06:16:21,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:16:21,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:21,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:16:21,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:21,063 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:16:21,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:16:21,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:16:21,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:16:21,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 06:16:21,593 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:16:21,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 06:16:21,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 06:16:21,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2019-09-10 06:16:21,594 INFO L87 Difference]: Start difference. First operand 18633 states and 21379 transitions. Second operand 22 states. [2019-09-10 06:16:26,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:16:26,697 INFO L93 Difference]: Finished difference Result 24356 states and 29441 transitions. [2019-09-10 06:16:26,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-10 06:16:26,697 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 180 [2019-09-10 06:16:26,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:16:26,714 INFO L225 Difference]: With dead ends: 24356 [2019-09-10 06:16:26,715 INFO L226 Difference]: Without dead ends: 24125 [2019-09-10 06:16:26,715 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 558 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=633, Invalid=2229, Unknown=0, NotChecked=0, Total=2862 [2019-09-10 06:16:26,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24125 states. [2019-09-10 06:16:26,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24125 to 17886. [2019-09-10 06:16:26,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17886 states. [2019-09-10 06:16:26,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17886 states to 17886 states and 20581 transitions. [2019-09-10 06:16:26,858 INFO L78 Accepts]: Start accepts. Automaton has 17886 states and 20581 transitions. Word has length 180 [2019-09-10 06:16:26,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:16:26,858 INFO L475 AbstractCegarLoop]: Abstraction has 17886 states and 20581 transitions. [2019-09-10 06:16:26,858 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 06:16:26,858 INFO L276 IsEmpty]: Start isEmpty. Operand 17886 states and 20581 transitions. [2019-09-10 06:16:26,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 06:16:26,866 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:16:26,866 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:16:26,866 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:16:26,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:16:26,866 INFO L82 PathProgramCache]: Analyzing trace with hash 815244025, now seen corresponding path program 1 times [2019-09-10 06:16:26,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:16:26,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:26,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:16:26,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:26,867 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:16:26,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:16:27,517 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-09-10 06:16:28,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:16:28,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:16:28,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2019-09-10 06:16:28,456 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:16:28,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-10 06:16:28,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-10 06:16:28,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=692, Unknown=0, NotChecked=0, Total=756 [2019-09-10 06:16:28,456 INFO L87 Difference]: Start difference. First operand 17886 states and 20581 transitions. Second operand 28 states. [2019-09-10 06:16:29,062 WARN L188 SmtUtils]: Spent 556.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 106 [2019-09-10 06:16:29,820 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 06:16:30,168 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-09-10 06:16:30,438 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 76 [2019-09-10 06:16:30,779 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 81 [2019-09-10 06:16:31,143 WARN L188 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 86 [2019-09-10 06:16:31,404 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-09-10 06:16:31,592 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-09-10 06:16:31,941 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-09-10 06:16:32,168 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-10 06:16:32,430 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-09-10 06:16:36,069 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-10 06:16:36,327 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-10 06:16:38,828 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-10 06:16:38,980 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-10 06:16:39,287 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-10 06:16:39,514 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-09-10 06:16:40,880 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-10 06:16:42,223 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-10 06:16:42,383 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-09-10 06:16:43,862 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 06:16:44,068 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-09-10 06:16:44,256 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-10 06:16:45,869 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2019-09-10 06:16:46,037 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-09-10 06:16:46,249 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-09-10 06:16:46,383 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-09-10 06:16:46,574 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 06:16:46,805 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-10 06:16:47,033 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 06:16:47,642 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 06:16:48,263 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-09-10 06:16:48,425 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-09-10 06:16:48,661 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 06:16:49,485 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 06:16:49,755 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-09-10 06:16:50,034 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 06:16:50,872 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-10 06:16:51,816 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-09-10 06:16:52,047 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-09-10 06:16:52,755 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-09-10 06:16:53,053 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-09-10 06:16:53,349 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-09-10 06:16:53,818 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-09-10 06:16:54,104 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-09-10 06:16:54,964 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2019-09-10 06:16:55,775 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-10 06:16:55,956 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-10 06:16:58,308 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 06:16:58,491 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-10 06:16:58,647 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-09-10 06:16:59,709 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-09-10 06:17:00,018 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-09-10 06:17:00,286 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-09-10 06:17:00,545 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-10 06:17:01,792 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 06:17:01,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:17:01,954 INFO L93 Difference]: Finished difference Result 47067 states and 58394 transitions. [2019-09-10 06:17:01,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2019-09-10 06:17:01,955 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 180 [2019-09-10 06:17:01,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:17:01,992 INFO L225 Difference]: With dead ends: 47067 [2019-09-10 06:17:01,993 INFO L226 Difference]: Without dead ends: 47067 [2019-09-10 06:17:01,994 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9551 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=2614, Invalid=24776, Unknown=0, NotChecked=0, Total=27390 [2019-09-10 06:17:02,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47067 states. [2019-09-10 06:17:02,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47067 to 19494. [2019-09-10 06:17:02,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19494 states. [2019-09-10 06:17:02,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19494 states to 19494 states and 22685 transitions. [2019-09-10 06:17:02,244 INFO L78 Accepts]: Start accepts. Automaton has 19494 states and 22685 transitions. Word has length 180 [2019-09-10 06:17:02,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:17:02,244 INFO L475 AbstractCegarLoop]: Abstraction has 19494 states and 22685 transitions. [2019-09-10 06:17:02,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-10 06:17:02,244 INFO L276 IsEmpty]: Start isEmpty. Operand 19494 states and 22685 transitions. [2019-09-10 06:17:02,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 06:17:02,252 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:17:02,252 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:17:02,252 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:17:02,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:17:02,252 INFO L82 PathProgramCache]: Analyzing trace with hash -114625836, now seen corresponding path program 1 times [2019-09-10 06:17:02,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:17:02,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:02,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:17:02,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:02,253 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:17:02,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:17:02,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:17:02,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:17:02,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-09-10 06:17:02,902 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:17:02,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 06:17:02,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 06:17:02,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2019-09-10 06:17:02,903 INFO L87 Difference]: Start difference. First operand 19494 states and 22685 transitions. Second operand 23 states. [2019-09-10 06:17:03,061 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-09-10 06:17:03,720 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-09-10 06:17:03,881 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 44 [2019-09-10 06:17:04,049 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2019-09-10 06:17:08,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:17:08,843 INFO L93 Difference]: Finished difference Result 23924 states and 28184 transitions. [2019-09-10 06:17:08,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 06:17:08,844 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 180 [2019-09-10 06:17:08,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:17:08,861 INFO L225 Difference]: With dead ends: 23924 [2019-09-10 06:17:08,861 INFO L226 Difference]: Without dead ends: 23924 [2019-09-10 06:17:08,861 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=631, Invalid=1819, Unknown=0, NotChecked=0, Total=2450 [2019-09-10 06:17:08,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23924 states. [2019-09-10 06:17:08,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23924 to 19426. [2019-09-10 06:17:08,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19426 states. [2019-09-10 06:17:09,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19426 states to 19426 states and 22589 transitions. [2019-09-10 06:17:09,010 INFO L78 Accepts]: Start accepts. Automaton has 19426 states and 22589 transitions. Word has length 180 [2019-09-10 06:17:09,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:17:09,011 INFO L475 AbstractCegarLoop]: Abstraction has 19426 states and 22589 transitions. [2019-09-10 06:17:09,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 06:17:09,011 INFO L276 IsEmpty]: Start isEmpty. Operand 19426 states and 22589 transitions. [2019-09-10 06:17:09,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 06:17:09,018 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:17:09,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] [2019-09-10 06:17:09,019 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:17:09,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:17:09,019 INFO L82 PathProgramCache]: Analyzing trace with hash 457304337, now seen corresponding path program 1 times [2019-09-10 06:17:09,019 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:17:09,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:09,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:17:09,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:09,020 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:17:09,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:17:09,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:17:09,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:17:09,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 06:17:09,306 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:17:09,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 06:17:09,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 06:17:09,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-09-10 06:17:09,307 INFO L87 Difference]: Start difference. First operand 19426 states and 22589 transitions. Second operand 17 states. [2019-09-10 06:17:11,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:17:11,454 INFO L93 Difference]: Finished difference Result 22463 states and 25959 transitions. [2019-09-10 06:17:11,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 06:17:11,454 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 180 [2019-09-10 06:17:11,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:17:11,470 INFO L225 Difference]: With dead ends: 22463 [2019-09-10 06:17:11,470 INFO L226 Difference]: Without dead ends: 21931 [2019-09-10 06:17:11,470 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=272, Invalid=1210, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 06:17:11,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21931 states. [2019-09-10 06:17:11,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21931 to 19504. [2019-09-10 06:17:11,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19504 states. [2019-09-10 06:17:11,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19504 states to 19504 states and 22455 transitions. [2019-09-10 06:17:11,609 INFO L78 Accepts]: Start accepts. Automaton has 19504 states and 22455 transitions. Word has length 180 [2019-09-10 06:17:11,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:17:11,609 INFO L475 AbstractCegarLoop]: Abstraction has 19504 states and 22455 transitions. [2019-09-10 06:17:11,609 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 06:17:11,609 INFO L276 IsEmpty]: Start isEmpty. Operand 19504 states and 22455 transitions. [2019-09-10 06:17:11,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 06:17:11,618 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:17:11,618 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:17:11,618 INFO L418 AbstractCegarLoop]: === Iteration 83 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:17:11,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:17:11,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1912748575, now seen corresponding path program 1 times [2019-09-10 06:17:11,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:17:11,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:11,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:17:11,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:11,619 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:17:11,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:17:12,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:17:12,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:17:12,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-09-10 06:17:12,410 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:17:12,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-10 06:17:12,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-10 06:17:12,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=498, Unknown=0, NotChecked=0, Total=552 [2019-09-10 06:17:12,411 INFO L87 Difference]: Start difference. First operand 19504 states and 22455 transitions. Second operand 24 states. [2019-09-10 06:17:12,565 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-09-10 06:17:14,620 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2019-09-10 06:17:16,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:17:16,621 INFO L93 Difference]: Finished difference Result 20598 states and 23875 transitions. [2019-09-10 06:17:16,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 06:17:16,622 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 180 [2019-09-10 06:17:16,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:17:16,636 INFO L225 Difference]: With dead ends: 20598 [2019-09-10 06:17:16,636 INFO L226 Difference]: Without dead ends: 20598 [2019-09-10 06:17:16,637 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=370, Invalid=1610, Unknown=0, NotChecked=0, Total=1980 [2019-09-10 06:17:16,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20598 states. [2019-09-10 06:17:16,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20598 to 19364. [2019-09-10 06:17:16,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19364 states. [2019-09-10 06:17:16,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19364 states to 19364 states and 22311 transitions. [2019-09-10 06:17:16,768 INFO L78 Accepts]: Start accepts. Automaton has 19364 states and 22311 transitions. Word has length 180 [2019-09-10 06:17:16,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:17:16,768 INFO L475 AbstractCegarLoop]: Abstraction has 19364 states and 22311 transitions. [2019-09-10 06:17:16,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-10 06:17:16,768 INFO L276 IsEmpty]: Start isEmpty. Operand 19364 states and 22311 transitions. [2019-09-10 06:17:16,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 06:17:16,777 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:17:16,777 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:17:16,777 INFO L418 AbstractCegarLoop]: === Iteration 84 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:17:16,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:17:16,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1048274163, now seen corresponding path program 1 times [2019-09-10 06:17:16,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:17:16,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:16,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:17:16,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:16,778 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:17:16,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:17:17,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:17:17,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:17:17,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 06:17:17,271 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:17:17,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 06:17:17,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 06:17:17,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2019-09-10 06:17:17,272 INFO L87 Difference]: Start difference. First operand 19364 states and 22311 transitions. Second operand 21 states. [2019-09-10 06:17:17,430 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-09-10 06:17:25,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:17:25,699 INFO L93 Difference]: Finished difference Result 47004 states and 60527 transitions. [2019-09-10 06:17:25,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-10 06:17:25,699 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 180 [2019-09-10 06:17:25,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:17:25,739 INFO L225 Difference]: With dead ends: 47004 [2019-09-10 06:17:25,739 INFO L226 Difference]: Without dead ends: 46867 [2019-09-10 06:17:25,740 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1823 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1095, Invalid=5385, Unknown=0, NotChecked=0, Total=6480 [2019-09-10 06:17:25,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46867 states. [2019-09-10 06:17:25,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46867 to 19597. [2019-09-10 06:17:25,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19597 states. [2019-09-10 06:17:25,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19597 states to 19597 states and 22546 transitions. [2019-09-10 06:17:25,986 INFO L78 Accepts]: Start accepts. Automaton has 19597 states and 22546 transitions. Word has length 180 [2019-09-10 06:17:25,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:17:25,986 INFO L475 AbstractCegarLoop]: Abstraction has 19597 states and 22546 transitions. [2019-09-10 06:17:25,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 06:17:25,986 INFO L276 IsEmpty]: Start isEmpty. Operand 19597 states and 22546 transitions. [2019-09-10 06:17:25,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 06:17:25,994 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:17:25,994 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:17:25,994 INFO L418 AbstractCegarLoop]: === Iteration 85 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:17:25,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:17:25,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1125030506, now seen corresponding path program 1 times [2019-09-10 06:17:25,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:17:25,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:25,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:17:25,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:25,996 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:17:26,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:17:26,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:17:26,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:17:26,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-09-10 06:17:26,846 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:17:26,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 06:17:26,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 06:17:26,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2019-09-10 06:17:26,847 INFO L87 Difference]: Start difference. First operand 19597 states and 22546 transitions. Second operand 23 states. [2019-09-10 06:17:26,984 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2019-09-10 06:17:33,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:17:33,822 INFO L93 Difference]: Finished difference Result 24650 states and 29259 transitions. [2019-09-10 06:17:33,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-10 06:17:33,823 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 180 [2019-09-10 06:17:33,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:17:33,842 INFO L225 Difference]: With dead ends: 24650 [2019-09-10 06:17:33,842 INFO L226 Difference]: Without dead ends: 24650 [2019-09-10 06:17:33,843 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 822 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=585, Invalid=2955, Unknown=0, NotChecked=0, Total=3540 [2019-09-10 06:17:33,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24650 states. [2019-09-10 06:17:34,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24650 to 20371. [2019-09-10 06:17:34,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20371 states. [2019-09-10 06:17:34,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20371 states to 20371 states and 23336 transitions. [2019-09-10 06:17:34,068 INFO L78 Accepts]: Start accepts. Automaton has 20371 states and 23336 transitions. Word has length 180 [2019-09-10 06:17:34,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:17:34,069 INFO L475 AbstractCegarLoop]: Abstraction has 20371 states and 23336 transitions. [2019-09-10 06:17:34,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 06:17:34,069 INFO L276 IsEmpty]: Start isEmpty. Operand 20371 states and 23336 transitions. [2019-09-10 06:17:34,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 06:17:34,078 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:17:34,078 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:17:34,078 INFO L418 AbstractCegarLoop]: === Iteration 86 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:17:34,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:17:34,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1225247027, now seen corresponding path program 1 times [2019-09-10 06:17:34,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:17:34,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:34,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:17:34,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:34,080 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:17:34,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:17:34,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 06:17:34,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:17:34,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-10 06:17:34,526 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:17:34,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 06:17:34,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 06:17:34,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2019-09-10 06:17:34,526 INFO L87 Difference]: Start difference. First operand 20371 states and 23336 transitions. Second operand 20 states. [2019-09-10 06:17:39,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:17:39,562 INFO L93 Difference]: Finished difference Result 24058 states and 27961 transitions. [2019-09-10 06:17:39,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 06:17:39,563 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 180 [2019-09-10 06:17:39,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:17:39,580 INFO L225 Difference]: With dead ends: 24058 [2019-09-10 06:17:39,580 INFO L226 Difference]: Without dead ends: 23638 [2019-09-10 06:17:39,581 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=344, Invalid=1296, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 06:17:39,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23638 states. [2019-09-10 06:17:39,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23638 to 20380. [2019-09-10 06:17:39,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20380 states. [2019-09-10 06:17:39,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20380 states to 20380 states and 23319 transitions. [2019-09-10 06:17:39,729 INFO L78 Accepts]: Start accepts. Automaton has 20380 states and 23319 transitions. Word has length 180 [2019-09-10 06:17:39,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:17:39,730 INFO L475 AbstractCegarLoop]: Abstraction has 20380 states and 23319 transitions. [2019-09-10 06:17:39,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 06:17:39,730 INFO L276 IsEmpty]: Start isEmpty. Operand 20380 states and 23319 transitions. [2019-09-10 06:17:39,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 06:17:39,738 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:17:39,738 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:17:39,738 INFO L418 AbstractCegarLoop]: === Iteration 87 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:17:39,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:17:39,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1239029908, now seen corresponding path program 1 times [2019-09-10 06:17:39,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:17:39,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:39,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:17:39,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:39,740 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:17:39,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:17:40,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:17:40,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:17:40,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 06:17:40,317 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:17:40,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 06:17:40,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 06:17:40,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-09-10 06:17:40,318 INFO L87 Difference]: Start difference. First operand 20380 states and 23319 transitions. Second operand 22 states. [2019-09-10 06:17:40,518 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 85 [2019-09-10 06:17:45,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:17:45,356 INFO L93 Difference]: Finished difference Result 25013 states and 29061 transitions. [2019-09-10 06:17:45,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-10 06:17:45,357 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 180 [2019-09-10 06:17:45,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:17:45,376 INFO L225 Difference]: With dead ends: 25013 [2019-09-10 06:17:45,376 INFO L226 Difference]: Without dead ends: 25013 [2019-09-10 06:17:45,377 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=571, Invalid=1879, Unknown=0, NotChecked=0, Total=2450 [2019-09-10 06:17:45,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25013 states. [2019-09-10 06:17:45,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25013 to 21317. [2019-09-10 06:17:45,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21317 states. [2019-09-10 06:17:45,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21317 states to 21317 states and 24283 transitions. [2019-09-10 06:17:45,537 INFO L78 Accepts]: Start accepts. Automaton has 21317 states and 24283 transitions. Word has length 180 [2019-09-10 06:17:45,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:17:45,537 INFO L475 AbstractCegarLoop]: Abstraction has 21317 states and 24283 transitions. [2019-09-10 06:17:45,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 06:17:45,537 INFO L276 IsEmpty]: Start isEmpty. Operand 21317 states and 24283 transitions. [2019-09-10 06:17:45,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 06:17:45,547 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:17:45,547 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:17:45,547 INFO L418 AbstractCegarLoop]: === Iteration 88 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:17:45,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:17:45,548 INFO L82 PathProgramCache]: Analyzing trace with hash -884781924, now seen corresponding path program 1 times [2019-09-10 06:17:45,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:17:45,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:45,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:17:45,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:45,549 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:17:45,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:17:45,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:17:45,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:17:45,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 06:17:45,941 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:17:45,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 06:17:45,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 06:17:45,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-09-10 06:17:45,942 INFO L87 Difference]: Start difference. First operand 21317 states and 24283 transitions. Second operand 17 states. [2019-09-10 06:17:50,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:17:50,808 INFO L93 Difference]: Finished difference Result 47696 states and 59241 transitions. [2019-09-10 06:17:50,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-10 06:17:50,808 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 180 [2019-09-10 06:17:50,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:17:50,845 INFO L225 Difference]: With dead ends: 47696 [2019-09-10 06:17:50,845 INFO L226 Difference]: Without dead ends: 47420 [2019-09-10 06:17:50,846 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1181 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1058, Invalid=3634, Unknown=0, NotChecked=0, Total=4692 [2019-09-10 06:17:50,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47420 states. [2019-09-10 06:17:51,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47420 to 27076. [2019-09-10 06:17:51,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27076 states. [2019-09-10 06:17:51,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27076 states to 27076 states and 32132 transitions. [2019-09-10 06:17:51,173 INFO L78 Accepts]: Start accepts. Automaton has 27076 states and 32132 transitions. Word has length 180 [2019-09-10 06:17:51,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:17:51,173 INFO L475 AbstractCegarLoop]: Abstraction has 27076 states and 32132 transitions. [2019-09-10 06:17:51,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 06:17:51,173 INFO L276 IsEmpty]: Start isEmpty. Operand 27076 states and 32132 transitions. [2019-09-10 06:17:51,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 06:17:51,182 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:17:51,183 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:17:51,183 INFO L418 AbstractCegarLoop]: === Iteration 89 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:17:51,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:17:51,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1366565669, now seen corresponding path program 1 times [2019-09-10 06:17:51,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:17:51,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:51,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:17:51,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:51,184 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:17:51,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:17:51,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:17:51,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:17:51,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 06:17:51,515 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:17:51,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 06:17:51,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 06:17:51,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-09-10 06:17:51,516 INFO L87 Difference]: Start difference. First operand 27076 states and 32132 transitions. Second operand 16 states. [2019-09-10 06:17:53,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:17:53,449 INFO L93 Difference]: Finished difference Result 35964 states and 44723 transitions. [2019-09-10 06:17:53,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 06:17:53,450 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 180 [2019-09-10 06:17:53,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:17:53,477 INFO L225 Difference]: With dead ends: 35964 [2019-09-10 06:17:53,477 INFO L226 Difference]: Without dead ends: 35960 [2019-09-10 06:17:53,478 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=313, Invalid=809, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 06:17:53,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35960 states. [2019-09-10 06:17:53,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35960 to 26981. [2019-09-10 06:17:53,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26981 states. [2019-09-10 06:17:53,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26981 states to 26981 states and 32003 transitions. [2019-09-10 06:17:53,718 INFO L78 Accepts]: Start accepts. Automaton has 26981 states and 32003 transitions. Word has length 180 [2019-09-10 06:17:53,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:17:53,718 INFO L475 AbstractCegarLoop]: Abstraction has 26981 states and 32003 transitions. [2019-09-10 06:17:53,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 06:17:53,718 INFO L276 IsEmpty]: Start isEmpty. Operand 26981 states and 32003 transitions. [2019-09-10 06:17:53,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 06:17:53,727 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:17:53,727 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:17:53,727 INFO L418 AbstractCegarLoop]: === Iteration 90 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:17:53,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:17:53,728 INFO L82 PathProgramCache]: Analyzing trace with hash 248135506, now seen corresponding path program 1 times [2019-09-10 06:17:53,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:17:53,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:53,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:17:53,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:53,729 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:17:53,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:17:54,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 06:17:54,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:17:54,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 06:17:54,329 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:17:54,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 06:17:54,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 06:17:54,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2019-09-10 06:17:54,330 INFO L87 Difference]: Start difference. First operand 26981 states and 32003 transitions. Second operand 21 states. [2019-09-10 06:17:58,587 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 23 [2019-09-10 06:18:00,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:00,648 INFO L93 Difference]: Finished difference Result 49483 states and 63218 transitions. [2019-09-10 06:18:00,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-10 06:18:00,648 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 180 [2019-09-10 06:18:00,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:00,687 INFO L225 Difference]: With dead ends: 49483 [2019-09-10 06:18:00,687 INFO L226 Difference]: Without dead ends: 49349 [2019-09-10 06:18:00,687 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=550, Invalid=2206, Unknown=0, NotChecked=0, Total=2756 [2019-09-10 06:18:00,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49349 states. [2019-09-10 06:18:00,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49349 to 27599. [2019-09-10 06:18:00,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27599 states. [2019-09-10 06:18:01,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27599 states to 27599 states and 32627 transitions. [2019-09-10 06:18:01,003 INFO L78 Accepts]: Start accepts. Automaton has 27599 states and 32627 transitions. Word has length 180 [2019-09-10 06:18:01,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:01,004 INFO L475 AbstractCegarLoop]: Abstraction has 27599 states and 32627 transitions. [2019-09-10 06:18:01,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 06:18:01,004 INFO L276 IsEmpty]: Start isEmpty. Operand 27599 states and 32627 transitions. [2019-09-10 06:18:01,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-10 06:18:01,015 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:01,015 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] [2019-09-10 06:18:01,015 INFO L418 AbstractCegarLoop]: === Iteration 91 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:01,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:01,015 INFO L82 PathProgramCache]: Analyzing trace with hash 108611143, now seen corresponding path program 1 times [2019-09-10 06:18:01,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:01,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:01,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:01,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:01,016 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:01,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:01,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:18:01,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:01,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:18:01,067 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:01,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:18:01,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:18:01,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:18:01,068 INFO L87 Difference]: Start difference. First operand 27599 states and 32627 transitions. Second operand 3 states. [2019-09-10 06:18:01,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:01,199 INFO L93 Difference]: Finished difference Result 34469 states and 41425 transitions. [2019-09-10 06:18:01,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:18:01,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2019-09-10 06:18:01,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:01,225 INFO L225 Difference]: With dead ends: 34469 [2019-09-10 06:18:01,225 INFO L226 Difference]: Without dead ends: 34469 [2019-09-10 06:18:01,226 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:18:01,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34469 states. [2019-09-10 06:18:01,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34469 to 34467. [2019-09-10 06:18:01,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34467 states. [2019-09-10 06:18:01,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34467 states to 34467 states and 41424 transitions. [2019-09-10 06:18:01,484 INFO L78 Accepts]: Start accepts. Automaton has 34467 states and 41424 transitions. Word has length 183 [2019-09-10 06:18:01,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:01,484 INFO L475 AbstractCegarLoop]: Abstraction has 34467 states and 41424 transitions. [2019-09-10 06:18:01,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:18:01,484 INFO L276 IsEmpty]: Start isEmpty. Operand 34467 states and 41424 transitions. [2019-09-10 06:18:01,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 06:18:01,494 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:01,494 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:18:01,494 INFO L418 AbstractCegarLoop]: === Iteration 92 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:01,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:01,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1062107728, now seen corresponding path program 1 times [2019-09-10 06:18:01,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:01,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:01,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:01,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:01,496 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:01,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:01,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:18:01,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:01,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:18:01,574 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:01,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:18:01,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:18:01,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:18:01,575 INFO L87 Difference]: Start difference. First operand 34467 states and 41424 transitions. Second operand 6 states. [2019-09-10 06:18:01,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:01,704 INFO L93 Difference]: Finished difference Result 42094 states and 51838 transitions. [2019-09-10 06:18:01,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 06:18:01,704 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 184 [2019-09-10 06:18:01,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:01,737 INFO L225 Difference]: With dead ends: 42094 [2019-09-10 06:18:01,737 INFO L226 Difference]: Without dead ends: 42094 [2019-09-10 06:18:01,737 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:18:01,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42094 states. [2019-09-10 06:18:02,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42094 to 34521. [2019-09-10 06:18:02,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34521 states. [2019-09-10 06:18:02,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34521 states to 34521 states and 41478 transitions. [2019-09-10 06:18:02,035 INFO L78 Accepts]: Start accepts. Automaton has 34521 states and 41478 transitions. Word has length 184 [2019-09-10 06:18:02,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:02,035 INFO L475 AbstractCegarLoop]: Abstraction has 34521 states and 41478 transitions. [2019-09-10 06:18:02,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:18:02,035 INFO L276 IsEmpty]: Start isEmpty. Operand 34521 states and 41478 transitions. [2019-09-10 06:18:02,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 06:18:02,046 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:02,046 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:18:02,046 INFO L418 AbstractCegarLoop]: === Iteration 93 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:02,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:02,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1063954770, now seen corresponding path program 1 times [2019-09-10 06:18:02,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:02,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:02,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:02,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:02,047 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:02,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:02,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:18:02,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:02,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:18:02,163 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:02,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:18:02,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:18:02,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:18:02,164 INFO L87 Difference]: Start difference. First operand 34521 states and 41478 transitions. Second operand 5 states. [2019-09-10 06:18:02,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:02,339 INFO L93 Difference]: Finished difference Result 36483 states and 44055 transitions. [2019-09-10 06:18:02,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:18:02,339 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 184 [2019-09-10 06:18:02,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:02,367 INFO L225 Difference]: With dead ends: 36483 [2019-09-10 06:18:02,367 INFO L226 Difference]: Without dead ends: 36483 [2019-09-10 06:18:02,367 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:18:02,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36483 states. [2019-09-10 06:18:02,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36483 to 36463. [2019-09-10 06:18:02,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36463 states. [2019-09-10 06:18:02,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36463 states to 36463 states and 44036 transitions. [2019-09-10 06:18:02,631 INFO L78 Accepts]: Start accepts. Automaton has 36463 states and 44036 transitions. Word has length 184 [2019-09-10 06:18:02,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:02,631 INFO L475 AbstractCegarLoop]: Abstraction has 36463 states and 44036 transitions. [2019-09-10 06:18:02,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:18:02,631 INFO L276 IsEmpty]: Start isEmpty. Operand 36463 states and 44036 transitions. [2019-09-10 06:18:02,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 06:18:02,642 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:02,642 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:18:02,642 INFO L418 AbstractCegarLoop]: === Iteration 94 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:02,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:02,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1813138376, now seen corresponding path program 1 times [2019-09-10 06:18:02,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:02,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:02,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:02,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:02,643 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:02,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:02,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 06:18:02,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:02,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:18:02,728 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:02,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:18:02,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:18:02,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:18:02,729 INFO L87 Difference]: Start difference. First operand 36463 states and 44036 transitions. Second operand 6 states. [2019-09-10 06:18:02,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:02,873 INFO L93 Difference]: Finished difference Result 48378 states and 60477 transitions. [2019-09-10 06:18:02,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 06:18:02,873 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 184 [2019-09-10 06:18:02,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:02,913 INFO L225 Difference]: With dead ends: 48378 [2019-09-10 06:18:02,913 INFO L226 Difference]: Without dead ends: 48378 [2019-09-10 06:18:02,913 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:18:02,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48378 states. [2019-09-10 06:18:03,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48378 to 36532. [2019-09-10 06:18:03,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36532 states. [2019-09-10 06:18:03,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36532 states to 36532 states and 44105 transitions. [2019-09-10 06:18:03,458 INFO L78 Accepts]: Start accepts. Automaton has 36532 states and 44105 transitions. Word has length 184 [2019-09-10 06:18:03,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:03,458 INFO L475 AbstractCegarLoop]: Abstraction has 36532 states and 44105 transitions. [2019-09-10 06:18:03,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:18:03,458 INFO L276 IsEmpty]: Start isEmpty. Operand 36532 states and 44105 transitions. [2019-09-10 06:18:03,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 06:18:03,469 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:03,469 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:18:03,469 INFO L418 AbstractCegarLoop]: === Iteration 95 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:03,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:03,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1814985418, now seen corresponding path program 1 times [2019-09-10 06:18:03,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:03,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:03,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:03,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:03,471 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:03,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:03,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:18:03,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:03,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:18:03,596 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:03,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:18:03,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:18:03,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:18:03,596 INFO L87 Difference]: Start difference. First operand 36532 states and 44105 transitions. Second operand 5 states. [2019-09-10 06:18:03,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:03,776 INFO L93 Difference]: Finished difference Result 40465 states and 49371 transitions. [2019-09-10 06:18:03,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:18:03,777 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 184 [2019-09-10 06:18:03,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:03,808 INFO L225 Difference]: With dead ends: 40465 [2019-09-10 06:18:03,808 INFO L226 Difference]: Without dead ends: 40465 [2019-09-10 06:18:03,808 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:18:03,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40465 states. [2019-09-10 06:18:04,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40465 to 40387. [2019-09-10 06:18:04,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40387 states. [2019-09-10 06:18:04,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40387 states to 40387 states and 49294 transitions. [2019-09-10 06:18:04,095 INFO L78 Accepts]: Start accepts. Automaton has 40387 states and 49294 transitions. Word has length 184 [2019-09-10 06:18:04,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:04,095 INFO L475 AbstractCegarLoop]: Abstraction has 40387 states and 49294 transitions. [2019-09-10 06:18:04,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:18:04,095 INFO L276 IsEmpty]: Start isEmpty. Operand 40387 states and 49294 transitions. [2019-09-10 06:18:04,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 06:18:04,105 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:04,105 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:18:04,105 INFO L418 AbstractCegarLoop]: === Iteration 96 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:04,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:04,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1300868134, now seen corresponding path program 1 times [2019-09-10 06:18:04,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:04,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:04,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:04,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:04,107 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:04,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:04,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:18:04,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:04,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:18:04,184 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:04,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:18:04,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:18:04,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:18:04,185 INFO L87 Difference]: Start difference. First operand 40387 states and 49294 transitions. Second operand 6 states. [2019-09-10 06:18:04,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:04,337 INFO L93 Difference]: Finished difference Result 57100 states and 72616 transitions. [2019-09-10 06:18:04,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 06:18:04,337 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 184 [2019-09-10 06:18:04,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:04,388 INFO L225 Difference]: With dead ends: 57100 [2019-09-10 06:18:04,388 INFO L226 Difference]: Without dead ends: 57100 [2019-09-10 06:18:04,388 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:18:04,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57100 states. [2019-09-10 06:18:04,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57100 to 40519. [2019-09-10 06:18:04,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40519 states. [2019-09-10 06:18:04,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40519 states to 40519 states and 49426 transitions. [2019-09-10 06:18:04,766 INFO L78 Accepts]: Start accepts. Automaton has 40519 states and 49426 transitions. Word has length 184 [2019-09-10 06:18:04,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:04,766 INFO L475 AbstractCegarLoop]: Abstraction has 40519 states and 49426 transitions. [2019-09-10 06:18:04,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:18:04,767 INFO L276 IsEmpty]: Start isEmpty. Operand 40519 states and 49426 transitions. [2019-09-10 06:18:04,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 06:18:04,778 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:04,778 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:18:04,778 INFO L418 AbstractCegarLoop]: === Iteration 97 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:04,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:04,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1299021092, now seen corresponding path program 1 times [2019-09-10 06:18:04,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:04,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:04,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:04,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:04,780 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:04,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:04,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:18:04,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:04,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:18:04,894 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:04,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:18:04,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:18:04,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:18:04,895 INFO L87 Difference]: Start difference. First operand 40519 states and 49426 transitions. Second operand 5 states. [2019-09-10 06:18:05,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:05,025 INFO L93 Difference]: Finished difference Result 45544 states and 56088 transitions. [2019-09-10 06:18:05,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:18:05,026 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 184 [2019-09-10 06:18:05,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:05,061 INFO L225 Difference]: With dead ends: 45544 [2019-09-10 06:18:05,061 INFO L226 Difference]: Without dead ends: 45544 [2019-09-10 06:18:05,061 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:18:05,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45544 states. [2019-09-10 06:18:05,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45544 to 45446. [2019-09-10 06:18:05,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45446 states. [2019-09-10 06:18:05,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45446 states to 45446 states and 55991 transitions. [2019-09-10 06:18:05,366 INFO L78 Accepts]: Start accepts. Automaton has 45446 states and 55991 transitions. Word has length 184 [2019-09-10 06:18:05,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:05,367 INFO L475 AbstractCegarLoop]: Abstraction has 45446 states and 55991 transitions. [2019-09-10 06:18:05,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:18:05,367 INFO L276 IsEmpty]: Start isEmpty. Operand 45446 states and 55991 transitions. [2019-09-10 06:18:05,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 06:18:05,377 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:05,377 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] [2019-09-10 06:18:05,377 INFO L418 AbstractCegarLoop]: === Iteration 98 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:05,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:05,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1422711908, now seen corresponding path program 1 times [2019-09-10 06:18:05,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:05,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:05,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:05,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:05,378 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:05,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:05,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:18:05,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:05,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 06:18:05,855 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:05,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 06:18:05,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 06:18:05,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2019-09-10 06:18:05,856 INFO L87 Difference]: Start difference. First operand 45446 states and 55991 transitions. Second operand 19 states. [2019-09-10 06:18:08,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:08,433 INFO L93 Difference]: Finished difference Result 64964 states and 81497 transitions. [2019-09-10 06:18:08,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 06:18:08,433 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 186 [2019-09-10 06:18:08,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:08,492 INFO L225 Difference]: With dead ends: 64964 [2019-09-10 06:18:08,492 INFO L226 Difference]: Without dead ends: 64964 [2019-09-10 06:18:08,492 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=426, Invalid=980, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 06:18:08,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64964 states. [2019-09-10 06:18:09,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64964 to 54102. [2019-09-10 06:18:09,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54102 states. [2019-09-10 06:18:09,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54102 states to 54102 states and 67514 transitions. [2019-09-10 06:18:09,227 INFO L78 Accepts]: Start accepts. Automaton has 54102 states and 67514 transitions. Word has length 186 [2019-09-10 06:18:09,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:09,227 INFO L475 AbstractCegarLoop]: Abstraction has 54102 states and 67514 transitions. [2019-09-10 06:18:09,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 06:18:09,228 INFO L276 IsEmpty]: Start isEmpty. Operand 54102 states and 67514 transitions. [2019-09-10 06:18:09,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 06:18:09,239 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:09,239 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] [2019-09-10 06:18:09,239 INFO L418 AbstractCegarLoop]: === Iteration 99 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:09,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:09,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1942385527, now seen corresponding path program 1 times [2019-09-10 06:18:09,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:09,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:09,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:09,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:09,240 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:09,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:09,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:18:09,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:09,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 06:18:09,689 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:09,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 06:18:09,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 06:18:09,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2019-09-10 06:18:09,690 INFO L87 Difference]: Start difference. First operand 54102 states and 67514 transitions. Second operand 19 states. [2019-09-10 06:18:13,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:13,246 INFO L93 Difference]: Finished difference Result 65679 states and 83158 transitions. [2019-09-10 06:18:13,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 06:18:13,246 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 186 [2019-09-10 06:18:13,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:13,303 INFO L225 Difference]: With dead ends: 65679 [2019-09-10 06:18:13,303 INFO L226 Difference]: Without dead ends: 63272 [2019-09-10 06:18:13,303 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=320, Invalid=1486, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 06:18:13,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63272 states. [2019-09-10 06:18:13,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63272 to 44779. [2019-09-10 06:18:13,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44779 states. [2019-09-10 06:18:13,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44779 states to 44779 states and 55643 transitions. [2019-09-10 06:18:13,689 INFO L78 Accepts]: Start accepts. Automaton has 44779 states and 55643 transitions. Word has length 186 [2019-09-10 06:18:13,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:13,689 INFO L475 AbstractCegarLoop]: Abstraction has 44779 states and 55643 transitions. [2019-09-10 06:18:13,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 06:18:13,689 INFO L276 IsEmpty]: Start isEmpty. Operand 44779 states and 55643 transitions. [2019-09-10 06:18:13,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 06:18:13,698 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:13,698 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] [2019-09-10 06:18:13,699 INFO L418 AbstractCegarLoop]: === Iteration 100 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:13,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:13,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1416804240, now seen corresponding path program 1 times [2019-09-10 06:18:13,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:13,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:13,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:13,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:13,700 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:13,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:14,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:18:14,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:14,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 06:18:14,012 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:14,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 06:18:14,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 06:18:14,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:18:14,013 INFO L87 Difference]: Start difference. First operand 44779 states and 55643 transitions. Second operand 15 states. [2019-09-10 06:18:16,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:16,652 INFO L93 Difference]: Finished difference Result 61467 states and 77978 transitions. [2019-09-10 06:18:16,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 06:18:16,653 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 186 [2019-09-10 06:18:16,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:16,708 INFO L225 Difference]: With dead ends: 61467 [2019-09-10 06:18:16,708 INFO L226 Difference]: Without dead ends: 61467 [2019-09-10 06:18:16,708 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=356, Invalid=976, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 06:18:16,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61467 states. [2019-09-10 06:18:17,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61467 to 44516. [2019-09-10 06:18:17,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44516 states. [2019-09-10 06:18:17,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44516 states to 44516 states and 55335 transitions. [2019-09-10 06:18:17,091 INFO L78 Accepts]: Start accepts. Automaton has 44516 states and 55335 transitions. Word has length 186 [2019-09-10 06:18:17,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:17,091 INFO L475 AbstractCegarLoop]: Abstraction has 44516 states and 55335 transitions. [2019-09-10 06:18:17,091 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 06:18:17,091 INFO L276 IsEmpty]: Start isEmpty. Operand 44516 states and 55335 transitions. [2019-09-10 06:18:17,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 06:18:17,100 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:17,100 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] [2019-09-10 06:18:17,101 INFO L418 AbstractCegarLoop]: === Iteration 101 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:17,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:17,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1408216864, now seen corresponding path program 1 times [2019-09-10 06:18:17,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:17,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:17,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:17,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:17,102 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:17,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:18,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:18:18,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:18,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 06:18:18,753 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:18,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 06:18:18,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 06:18:18,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2019-09-10 06:18:18,754 INFO L87 Difference]: Start difference. First operand 44516 states and 55335 transitions. Second operand 21 states. [2019-09-10 06:18:22,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:22,810 INFO L93 Difference]: Finished difference Result 57935 states and 72952 transitions. [2019-09-10 06:18:22,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-10 06:18:22,811 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 186 [2019-09-10 06:18:22,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:22,861 INFO L225 Difference]: With dead ends: 57935 [2019-09-10 06:18:22,861 INFO L226 Difference]: Without dead ends: 57935 [2019-09-10 06:18:22,861 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=375, Invalid=1881, Unknown=0, NotChecked=0, Total=2256 [2019-09-10 06:18:22,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57935 states. [2019-09-10 06:18:23,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57935 to 45138. [2019-09-10 06:18:23,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45138 states. [2019-09-10 06:18:23,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45138 states to 45138 states and 55977 transitions. [2019-09-10 06:18:23,232 INFO L78 Accepts]: Start accepts. Automaton has 45138 states and 55977 transitions. Word has length 186 [2019-09-10 06:18:23,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:23,233 INFO L475 AbstractCegarLoop]: Abstraction has 45138 states and 55977 transitions. [2019-09-10 06:18:23,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 06:18:23,233 INFO L276 IsEmpty]: Start isEmpty. Operand 45138 states and 55977 transitions. [2019-09-10 06:18:23,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 06:18:23,242 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:23,242 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] [2019-09-10 06:18:23,242 INFO L418 AbstractCegarLoop]: === Iteration 102 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:23,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:23,242 INFO L82 PathProgramCache]: Analyzing trace with hash 380554696, now seen corresponding path program 1 times [2019-09-10 06:18:23,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:23,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:23,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:23,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:23,243 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:23,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:23,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:18:23,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:23,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-10 06:18:23,996 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:23,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 06:18:23,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 06:18:23,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=549, Unknown=0, NotChecked=0, Total=600 [2019-09-10 06:18:23,997 INFO L87 Difference]: Start difference. First operand 45138 states and 55977 transitions. Second operand 25 states. [2019-09-10 06:18:24,181 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2019-09-10 06:18:25,369 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 06:18:31,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:31,289 INFO L93 Difference]: Finished difference Result 49964 states and 62243 transitions. [2019-09-10 06:18:31,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-10 06:18:31,289 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 186 [2019-09-10 06:18:31,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:31,336 INFO L225 Difference]: With dead ends: 49964 [2019-09-10 06:18:31,336 INFO L226 Difference]: Without dead ends: 49964 [2019-09-10 06:18:31,337 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 535 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=732, Invalid=2928, Unknown=0, NotChecked=0, Total=3660 [2019-09-10 06:18:31,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49964 states. [2019-09-10 06:18:31,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49964 to 45335. [2019-09-10 06:18:31,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45335 states. [2019-09-10 06:18:31,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45335 states to 45335 states and 56178 transitions. [2019-09-10 06:18:31,847 INFO L78 Accepts]: Start accepts. Automaton has 45335 states and 56178 transitions. Word has length 186 [2019-09-10 06:18:31,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:31,847 INFO L475 AbstractCegarLoop]: Abstraction has 45335 states and 56178 transitions. [2019-09-10 06:18:31,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 06:18:31,847 INFO L276 IsEmpty]: Start isEmpty. Operand 45335 states and 56178 transitions. [2019-09-10 06:18:31,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 06:18:31,858 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:31,858 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] [2019-09-10 06:18:31,858 INFO L418 AbstractCegarLoop]: === Iteration 103 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:31,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:31,859 INFO L82 PathProgramCache]: Analyzing trace with hash -165848543, now seen corresponding path program 1 times [2019-09-10 06:18:31,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:31,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:31,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:31,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:31,860 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:31,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:32,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:18:32,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:32,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 06:18:32,962 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:32,962 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 06:18:32,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 06:18:32,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2019-09-10 06:18:32,963 INFO L87 Difference]: Start difference. First operand 45335 states and 56178 transitions. Second operand 22 states. [2019-09-10 06:18:33,191 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 86 [2019-09-10 06:18:34,091 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-10 06:18:35,274 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-09-10 06:18:36,156 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-09-10 06:18:37,469 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 06:18:38,111 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-09-10 06:18:38,342 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-09-10 06:18:38,602 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-10 06:18:38,859 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-09-10 06:18:39,414 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-09-10 06:18:40,141 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 06:18:40,658 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-10 06:18:41,261 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 06:18:41,493 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-10 06:18:42,583 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-09-10 06:18:43,902 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-10 06:18:44,871 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-09-10 06:18:45,304 WARN L188 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-09-10 06:18:45,565 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-09-10 06:18:45,705 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-09-10 06:18:45,912 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-09-10 06:18:46,419 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-10 06:18:46,983 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-09-10 06:18:47,185 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-09-10 06:18:47,357 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-09-10 06:18:47,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:47,397 INFO L93 Difference]: Finished difference Result 83871 states and 107562 transitions. [2019-09-10 06:18:47,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-09-10 06:18:47,398 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 186 [2019-09-10 06:18:47,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:47,474 INFO L225 Difference]: With dead ends: 83871 [2019-09-10 06:18:47,474 INFO L226 Difference]: Without dead ends: 83871 [2019-09-10 06:18:47,474 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2890 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=1298, Invalid=8208, Unknown=0, NotChecked=0, Total=9506 [2019-09-10 06:18:47,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83871 states. [2019-09-10 06:18:47,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83871 to 45154. [2019-09-10 06:18:47,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45154 states. [2019-09-10 06:18:47,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45154 states to 45154 states and 55989 transitions. [2019-09-10 06:18:47,930 INFO L78 Accepts]: Start accepts. Automaton has 45154 states and 55989 transitions. Word has length 186 [2019-09-10 06:18:47,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:47,930 INFO L475 AbstractCegarLoop]: Abstraction has 45154 states and 55989 transitions. [2019-09-10 06:18:47,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 06:18:47,930 INFO L276 IsEmpty]: Start isEmpty. Operand 45154 states and 55989 transitions. [2019-09-10 06:18:47,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 06:18:47,940 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:47,940 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] [2019-09-10 06:18:47,940 INFO L418 AbstractCegarLoop]: === Iteration 104 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:47,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:47,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1622923017, now seen corresponding path program 1 times [2019-09-10 06:18:47,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:47,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:47,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:47,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:47,941 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:47,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:48,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:18:48,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:48,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 06:18:48,199 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:48,199 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 06:18:48,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 06:18:48,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:18:48,200 INFO L87 Difference]: Start difference. First operand 45154 states and 55989 transitions. Second operand 15 states. [2019-09-10 06:18:52,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:52,487 INFO L93 Difference]: Finished difference Result 93708 states and 122011 transitions. [2019-09-10 06:18:52,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-10 06:18:52,488 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 186 [2019-09-10 06:18:52,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:52,580 INFO L225 Difference]: With dead ends: 93708 [2019-09-10 06:18:52,580 INFO L226 Difference]: Without dead ends: 93708 [2019-09-10 06:18:52,581 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1139 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=862, Invalid=3170, Unknown=0, NotChecked=0, Total=4032 [2019-09-10 06:18:52,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93708 states. [2019-09-10 06:18:53,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93708 to 44368. [2019-09-10 06:18:53,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44368 states. [2019-09-10 06:18:53,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44368 states to 44368 states and 55166 transitions. [2019-09-10 06:18:53,089 INFO L78 Accepts]: Start accepts. Automaton has 44368 states and 55166 transitions. Word has length 186 [2019-09-10 06:18:53,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:53,089 INFO L475 AbstractCegarLoop]: Abstraction has 44368 states and 55166 transitions. [2019-09-10 06:18:53,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 06:18:53,089 INFO L276 IsEmpty]: Start isEmpty. Operand 44368 states and 55166 transitions. [2019-09-10 06:18:53,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 06:18:53,098 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:53,098 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] [2019-09-10 06:18:53,098 INFO L418 AbstractCegarLoop]: === Iteration 105 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:53,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:53,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1685568323, now seen corresponding path program 1 times [2019-09-10 06:18:53,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:53,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:53,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:53,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:53,099 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:53,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:53,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:18:53,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:53,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 06:18:53,423 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:53,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 06:18:53,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 06:18:53,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:18:53,424 INFO L87 Difference]: Start difference. First operand 44368 states and 55166 transitions. Second operand 15 states. [2019-09-10 06:18:53,738 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-09-10 06:18:55,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:55,752 INFO L93 Difference]: Finished difference Result 47084 states and 58804 transitions. [2019-09-10 06:18:55,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 06:18:55,752 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 186 [2019-09-10 06:18:55,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:55,790 INFO L225 Difference]: With dead ends: 47084 [2019-09-10 06:18:55,790 INFO L226 Difference]: Without dead ends: 46903 [2019-09-10 06:18:55,791 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=368, Invalid=1038, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 06:18:55,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46903 states. [2019-09-10 06:18:56,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46903 to 44017. [2019-09-10 06:18:56,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44017 states. [2019-09-10 06:18:56,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44017 states to 44017 states and 54786 transitions. [2019-09-10 06:18:56,103 INFO L78 Accepts]: Start accepts. Automaton has 44017 states and 54786 transitions. Word has length 186 [2019-09-10 06:18:56,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:56,103 INFO L475 AbstractCegarLoop]: Abstraction has 44017 states and 54786 transitions. [2019-09-10 06:18:56,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 06:18:56,103 INFO L276 IsEmpty]: Start isEmpty. Operand 44017 states and 54786 transitions. [2019-09-10 06:18:56,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 06:18:56,112 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:56,112 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] [2019-09-10 06:18:56,112 INFO L418 AbstractCegarLoop]: === Iteration 106 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:56,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:56,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1621872938, now seen corresponding path program 1 times [2019-09-10 06:18:56,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:56,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:56,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:56,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:56,113 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:56,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:56,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:18:56,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:56,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2019-09-10 06:18:56,982 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:56,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-10 06:18:56,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-10 06:18:56,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=633, Unknown=0, NotChecked=0, Total=702 [2019-09-10 06:18:56,983 INFO L87 Difference]: Start difference. First operand 44017 states and 54786 transitions. Second operand 27 states. [2019-09-10 06:18:57,229 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 75 [2019-09-10 06:18:58,123 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-10 06:18:58,391 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2019-09-10 06:18:58,646 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 73 [2019-09-10 06:19:05,533 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 06:19:06,258 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2019-09-10 06:19:06,569 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-09-10 06:19:07,657 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 06:19:07,834 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 06:19:09,632 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 06:19:09,883 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-10 06:19:11,597 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 06:19:11,782 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 67 [2019-09-10 06:19:11,976 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-10 06:19:12,181 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 70 [2019-09-10 06:19:12,930 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-09-10 06:19:13,240 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-09-10 06:19:13,695 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-09-10 06:19:13,901 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2019-09-10 06:19:14,362 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-09-10 06:19:14,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:14,569 INFO L93 Difference]: Finished difference Result 94018 states and 121720 transitions. [2019-09-10 06:19:14,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-09-10 06:19:14,569 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 186 [2019-09-10 06:19:14,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:14,657 INFO L225 Difference]: With dead ends: 94018 [2019-09-10 06:19:14,657 INFO L226 Difference]: Without dead ends: 94018 [2019-09-10 06:19:14,658 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3661 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=1995, Invalid=10437, Unknown=0, NotChecked=0, Total=12432 [2019-09-10 06:19:14,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94018 states. [2019-09-10 06:19:15,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94018 to 47064. [2019-09-10 06:19:15,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47064 states. [2019-09-10 06:19:15,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47064 states to 47064 states and 58954 transitions. [2019-09-10 06:19:15,180 INFO L78 Accepts]: Start accepts. Automaton has 47064 states and 58954 transitions. Word has length 186 [2019-09-10 06:19:15,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:15,180 INFO L475 AbstractCegarLoop]: Abstraction has 47064 states and 58954 transitions. [2019-09-10 06:19:15,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-10 06:19:15,180 INFO L276 IsEmpty]: Start isEmpty. Operand 47064 states and 58954 transitions. [2019-09-10 06:19:15,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 06:19:15,189 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:15,189 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] [2019-09-10 06:19:15,189 INFO L418 AbstractCegarLoop]: === Iteration 107 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:15,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:15,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1263933250, now seen corresponding path program 1 times [2019-09-10 06:19:15,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:15,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:15,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:15,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:15,190 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:15,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:15,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:19:15,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:15,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 06:19:15,482 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:15,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 06:19:15,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 06:19:15,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-09-10 06:19:15,482 INFO L87 Difference]: Start difference. First operand 47064 states and 58954 transitions. Second operand 16 states. [2019-09-10 06:19:17,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:17,815 INFO L93 Difference]: Finished difference Result 63764 states and 81675 transitions. [2019-09-10 06:19:17,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 06:19:17,815 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 186 [2019-09-10 06:19:17,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:17,872 INFO L225 Difference]: With dead ends: 63764 [2019-09-10 06:19:17,872 INFO L226 Difference]: Without dead ends: 63764 [2019-09-10 06:19:17,873 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=270, Invalid=852, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 06:19:17,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63764 states. [2019-09-10 06:19:18,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63764 to 45485. [2019-09-10 06:19:18,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45485 states. [2019-09-10 06:19:18,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45485 states to 45485 states and 57015 transitions. [2019-09-10 06:19:18,437 INFO L78 Accepts]: Start accepts. Automaton has 45485 states and 57015 transitions. Word has length 186 [2019-09-10 06:19:18,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:18,437 INFO L475 AbstractCegarLoop]: Abstraction has 45485 states and 57015 transitions. [2019-09-10 06:19:18,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 06:19:18,437 INFO L276 IsEmpty]: Start isEmpty. Operand 45485 states and 57015 transitions. [2019-09-10 06:19:18,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 06:19:18,445 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:18,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] [2019-09-10 06:19:18,446 INFO L418 AbstractCegarLoop]: === Iteration 108 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:18,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:18,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1536246204, now seen corresponding path program 1 times [2019-09-10 06:19:18,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:18,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:18,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:18,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:18,447 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:18,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:18,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:19:18,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:18,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 06:19:18,879 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:18,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 06:19:18,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 06:19:18,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2019-09-10 06:19:18,880 INFO L87 Difference]: Start difference. First operand 45485 states and 57015 transitions. Second operand 19 states. [2019-09-10 06:19:19,032 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-09-10 06:19:32,370 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 42 [2019-09-10 06:19:32,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:32,402 INFO L93 Difference]: Finished difference Result 138712 states and 178294 transitions. [2019-09-10 06:19:32,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-09-10 06:19:32,402 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 186 [2019-09-10 06:19:32,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:32,544 INFO L225 Difference]: With dead ends: 138712 [2019-09-10 06:19:32,544 INFO L226 Difference]: Without dead ends: 138438 [2019-09-10 06:19:32,545 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4373 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=3215, Invalid=12037, Unknown=0, NotChecked=0, Total=15252 [2019-09-10 06:19:32,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138438 states. [2019-09-10 06:19:33,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138438 to 59278. [2019-09-10 06:19:33,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59278 states. [2019-09-10 06:19:33,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59278 states to 59278 states and 75539 transitions. [2019-09-10 06:19:33,276 INFO L78 Accepts]: Start accepts. Automaton has 59278 states and 75539 transitions. Word has length 186 [2019-09-10 06:19:33,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:33,276 INFO L475 AbstractCegarLoop]: Abstraction has 59278 states and 75539 transitions. [2019-09-10 06:19:33,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 06:19:33,276 INFO L276 IsEmpty]: Start isEmpty. Operand 59278 states and 75539 transitions. [2019-09-10 06:19:33,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 06:19:33,285 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:33,285 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] [2019-09-10 06:19:33,285 INFO L418 AbstractCegarLoop]: === Iteration 109 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:33,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:33,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1178306516, now seen corresponding path program 1 times [2019-09-10 06:19:33,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:33,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:33,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:33,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:33,287 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:33,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:33,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:19:33,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:33,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 06:19:33,490 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:33,491 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 06:19:33,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 06:19:33,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-10 06:19:33,491 INFO L87 Difference]: Start difference. First operand 59278 states and 75539 transitions. Second operand 14 states. [2019-09-10 06:19:34,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:34,943 INFO L93 Difference]: Finished difference Result 41937 states and 52544 transitions. [2019-09-10 06:19:34,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 06:19:34,944 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 186 [2019-09-10 06:19:34,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:34,980 INFO L225 Difference]: With dead ends: 41937 [2019-09-10 06:19:34,981 INFO L226 Difference]: Without dead ends: 41937 [2019-09-10 06:19:34,981 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=149, Invalid=451, Unknown=0, NotChecked=0, Total=600 [2019-09-10 06:19:35,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41937 states. [2019-09-10 06:19:35,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41937 to 41664. [2019-09-10 06:19:35,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41664 states. [2019-09-10 06:19:35,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41664 states to 41664 states and 52269 transitions. [2019-09-10 06:19:35,301 INFO L78 Accepts]: Start accepts. Automaton has 41664 states and 52269 transitions. Word has length 186 [2019-09-10 06:19:35,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:35,301 INFO L475 AbstractCegarLoop]: Abstraction has 41664 states and 52269 transitions. [2019-09-10 06:19:35,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 06:19:35,301 INFO L276 IsEmpty]: Start isEmpty. Operand 41664 states and 52269 transitions. [2019-09-10 06:19:35,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 06:19:35,309 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:35,310 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] [2019-09-10 06:19:35,310 INFO L418 AbstractCegarLoop]: === Iteration 110 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:35,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:35,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1985946570, now seen corresponding path program 1 times [2019-09-10 06:19:35,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:35,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:35,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:35,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:35,311 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:35,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:35,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:19:35,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:35,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 06:19:35,663 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:35,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 06:19:35,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 06:19:35,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:19:35,664 INFO L87 Difference]: Start difference. First operand 41664 states and 52269 transitions. Second operand 15 states. [2019-09-10 06:19:38,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:38,228 INFO L93 Difference]: Finished difference Result 44872 states and 56419 transitions. [2019-09-10 06:19:38,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 06:19:38,229 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 186 [2019-09-10 06:19:38,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:38,268 INFO L225 Difference]: With dead ends: 44872 [2019-09-10 06:19:38,268 INFO L226 Difference]: Without dead ends: 44487 [2019-09-10 06:19:38,269 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=417, Invalid=1143, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 06:19:38,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44487 states. [2019-09-10 06:19:38,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44487 to 41241. [2019-09-10 06:19:38,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41241 states. [2019-09-10 06:19:38,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41241 states to 41241 states and 51817 transitions. [2019-09-10 06:19:38,728 INFO L78 Accepts]: Start accepts. Automaton has 41241 states and 51817 transitions. Word has length 186 [2019-09-10 06:19:38,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:38,728 INFO L475 AbstractCegarLoop]: Abstraction has 41241 states and 51817 transitions. [2019-09-10 06:19:38,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 06:19:38,729 INFO L276 IsEmpty]: Start isEmpty. Operand 41241 states and 51817 transitions. [2019-09-10 06:19:38,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 06:19:38,736 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:38,736 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] [2019-09-10 06:19:38,736 INFO L418 AbstractCegarLoop]: === Iteration 111 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:38,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:38,737 INFO L82 PathProgramCache]: Analyzing trace with hash -636330139, now seen corresponding path program 1 times [2019-09-10 06:19:38,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:38,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:38,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:38,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:38,738 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:38,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:39,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:19:39,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:39,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 06:19:39,178 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:39,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 06:19:39,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 06:19:39,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2019-09-10 06:19:39,179 INFO L87 Difference]: Start difference. First operand 41241 states and 51817 transitions. Second operand 22 states. [2019-09-10 06:19:45,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:45,632 INFO L93 Difference]: Finished difference Result 103500 states and 135954 transitions. [2019-09-10 06:19:45,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-10 06:19:45,633 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 186 [2019-09-10 06:19:45,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:45,739 INFO L225 Difference]: With dead ends: 103500 [2019-09-10 06:19:45,739 INFO L226 Difference]: Without dead ends: 103500 [2019-09-10 06:19:45,740 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1207 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=845, Invalid=3985, Unknown=0, NotChecked=0, Total=4830 [2019-09-10 06:19:45,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103500 states. [2019-09-10 06:19:46,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103500 to 41223. [2019-09-10 06:19:46,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41223 states. [2019-09-10 06:19:46,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41223 states to 41223 states and 51795 transitions. [2019-09-10 06:19:46,262 INFO L78 Accepts]: Start accepts. Automaton has 41223 states and 51795 transitions. Word has length 186 [2019-09-10 06:19:46,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:46,262 INFO L475 AbstractCegarLoop]: Abstraction has 41223 states and 51795 transitions. [2019-09-10 06:19:46,262 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 06:19:46,262 INFO L276 IsEmpty]: Start isEmpty. Operand 41223 states and 51795 transitions. [2019-09-10 06:19:46,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 06:19:46,270 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:46,270 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] [2019-09-10 06:19:46,270 INFO L418 AbstractCegarLoop]: === Iteration 112 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:46,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:46,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1566200000, now seen corresponding path program 1 times [2019-09-10 06:19:46,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:46,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:46,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:46,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:46,271 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:46,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:46,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:19:46,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:46,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 06:19:46,567 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:46,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 06:19:46,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 06:19:46,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:19:46,568 INFO L87 Difference]: Start difference. First operand 41223 states and 51795 transitions. Second operand 15 states. [2019-09-10 06:19:49,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:49,165 INFO L93 Difference]: Finished difference Result 58480 states and 74954 transitions. [2019-09-10 06:19:49,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 06:19:49,165 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 186 [2019-09-10 06:19:49,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:49,391 INFO L225 Difference]: With dead ends: 58480 [2019-09-10 06:19:49,391 INFO L226 Difference]: Without dead ends: 58480 [2019-09-10 06:19:49,391 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=356, Invalid=976, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 06:19:49,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58480 states. [2019-09-10 06:19:49,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58480 to 41228. [2019-09-10 06:19:49,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41228 states. [2019-09-10 06:19:49,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41228 states to 41228 states and 51763 transitions. [2019-09-10 06:19:49,699 INFO L78 Accepts]: Start accepts. Automaton has 41228 states and 51763 transitions. Word has length 186 [2019-09-10 06:19:49,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:49,699 INFO L475 AbstractCegarLoop]: Abstraction has 41228 states and 51763 transitions. [2019-09-10 06:19:49,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 06:19:49,699 INFO L276 IsEmpty]: Start isEmpty. Operand 41228 states and 51763 transitions. [2019-09-10 06:19:49,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 06:19:49,706 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:49,706 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] [2019-09-10 06:19:49,706 INFO L418 AbstractCegarLoop]: === Iteration 113 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:49,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:49,707 INFO L82 PathProgramCache]: Analyzing trace with hash -818117644, now seen corresponding path program 1 times [2019-09-10 06:19:49,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:49,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:49,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:49,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:49,708 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:49,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:49,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:19:49,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:49,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 06:19:49,992 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:49,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 06:19:49,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 06:19:49,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:19:49,992 INFO L87 Difference]: Start difference. First operand 41228 states and 51763 transitions. Second operand 15 states. [2019-09-10 06:19:54,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:54,108 INFO L93 Difference]: Finished difference Result 68535 states and 88624 transitions. [2019-09-10 06:19:54,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-10 06:19:54,108 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 186 [2019-09-10 06:19:54,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:54,179 INFO L225 Difference]: With dead ends: 68535 [2019-09-10 06:19:54,179 INFO L226 Difference]: Without dead ends: 67859 [2019-09-10 06:19:54,179 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 934 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=786, Invalid=2754, Unknown=0, NotChecked=0, Total=3540 [2019-09-10 06:19:54,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67859 states. [2019-09-10 06:19:54,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67859 to 38504. [2019-09-10 06:19:54,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38504 states. [2019-09-10 06:19:54,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38504 states to 38504 states and 48294 transitions. [2019-09-10 06:19:54,583 INFO L78 Accepts]: Start accepts. Automaton has 38504 states and 48294 transitions. Word has length 186 [2019-09-10 06:19:54,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:54,583 INFO L475 AbstractCegarLoop]: Abstraction has 38504 states and 48294 transitions. [2019-09-10 06:19:54,584 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 06:19:54,584 INFO L276 IsEmpty]: Start isEmpty. Operand 38504 states and 48294 transitions. [2019-09-10 06:19:54,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 06:19:54,590 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:54,590 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] [2019-09-10 06:19:54,591 INFO L418 AbstractCegarLoop]: === Iteration 114 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:54,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:54,591 INFO L82 PathProgramCache]: Analyzing trace with hash -951748899, now seen corresponding path program 1 times [2019-09-10 06:19:54,591 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:54,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:54,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:54,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:54,592 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:54,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:55,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 06:19:55,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:55,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2019-09-10 06:19:55,512 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:55,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-10 06:19:55,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-10 06:19:55,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=691, Unknown=0, NotChecked=0, Total=756 [2019-09-10 06:19:55,512 INFO L87 Difference]: Start difference. First operand 38504 states and 48294 transitions. Second operand 28 states. [2019-09-10 06:19:55,660 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 41 [2019-09-10 06:19:59,038 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2019-09-10 06:19:59,254 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 40 [2019-09-10 06:19:59,737 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 32 [2019-09-10 06:20:00,045 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 33 [2019-09-10 06:20:00,243 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2019-09-10 06:20:00,521 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 47 [2019-09-10 06:20:00,669 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2019-09-10 06:20:00,977 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 50 [2019-09-10 06:20:01,159 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 38 [2019-09-10 06:20:01,347 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 34 [2019-09-10 06:20:01,746 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 34 [2019-09-10 06:20:01,929 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 40 [2019-09-10 06:20:02,160 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 38 [2019-09-10 06:20:02,523 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 38 [2019-09-10 06:20:02,697 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 34 [2019-09-10 06:20:03,404 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 31 [2019-09-10 06:20:05,384 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 31 [2019-09-10 06:20:06,190 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 31 [2019-09-10 06:20:07,076 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2019-09-10 06:20:07,352 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 33 [2019-09-10 06:20:08,187 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 31 [2019-09-10 06:20:08,355 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 33 [2019-09-10 06:20:10,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:20:10,227 INFO L93 Difference]: Finished difference Result 69056 states and 88824 transitions. [2019-09-10 06:20:10,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-09-10 06:20:10,227 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 186 [2019-09-10 06:20:10,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:20:10,299 INFO L225 Difference]: With dead ends: 69056 [2019-09-10 06:20:10,299 INFO L226 Difference]: Without dead ends: 68684 [2019-09-10 06:20:10,300 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2671 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=1459, Invalid=8441, Unknown=0, NotChecked=0, Total=9900 [2019-09-10 06:20:10,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68684 states. [2019-09-10 06:20:10,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68684 to 38236. [2019-09-10 06:20:10,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38236 states. [2019-09-10 06:20:10,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38236 states to 38236 states and 48019 transitions. [2019-09-10 06:20:10,705 INFO L78 Accepts]: Start accepts. Automaton has 38236 states and 48019 transitions. Word has length 186 [2019-09-10 06:20:10,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:20:10,705 INFO L475 AbstractCegarLoop]: Abstraction has 38236 states and 48019 transitions. [2019-09-10 06:20:10,705 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-10 06:20:10,705 INFO L276 IsEmpty]: Start isEmpty. Operand 38236 states and 48019 transitions. [2019-09-10 06:20:10,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 06:20:10,712 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:20:10,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] [2019-09-10 06:20:10,712 INFO L418 AbstractCegarLoop]: === Iteration 115 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:20:10,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:20:10,712 INFO L82 PathProgramCache]: Analyzing trace with hash 290619422, now seen corresponding path program 1 times [2019-09-10 06:20:10,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:20:10,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:10,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:20:10,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:10,713 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:20:10,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:20:11,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:20:11,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:20:11,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 06:20:11,027 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:20:11,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 06:20:11,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 06:20:11,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-09-10 06:20:11,028 INFO L87 Difference]: Start difference. First operand 38236 states and 48019 transitions. Second operand 17 states. [2019-09-10 06:20:13,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:20:13,318 INFO L93 Difference]: Finished difference Result 50293 states and 63144 transitions. [2019-09-10 06:20:13,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 06:20:13,319 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 186 [2019-09-10 06:20:13,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:20:13,546 INFO L225 Difference]: With dead ends: 50293 [2019-09-10 06:20:13,546 INFO L226 Difference]: Without dead ends: 49368 [2019-09-10 06:20:13,547 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=237, Invalid=1023, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 06:20:13,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49368 states. [2019-09-10 06:20:13,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49368 to 37207. [2019-09-10 06:20:13,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37207 states. [2019-09-10 06:20:13,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37207 states to 37207 states and 46969 transitions. [2019-09-10 06:20:13,834 INFO L78 Accepts]: Start accepts. Automaton has 37207 states and 46969 transitions. Word has length 186 [2019-09-10 06:20:13,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:20:13,834 INFO L475 AbstractCegarLoop]: Abstraction has 37207 states and 46969 transitions. [2019-09-10 06:20:13,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 06:20:13,834 INFO L276 IsEmpty]: Start isEmpty. Operand 37207 states and 46969 transitions. [2019-09-10 06:20:13,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 06:20:13,841 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:20:13,841 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] [2019-09-10 06:20:13,841 INFO L418 AbstractCegarLoop]: === Iteration 116 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:20:13,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:20:13,842 INFO L82 PathProgramCache]: Analyzing trace with hash -167716704, now seen corresponding path program 1 times [2019-09-10 06:20:13,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:20:13,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:13,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:20:13,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:13,843 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:20:13,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:20:14,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:20:14,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:20:14,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 06:20:14,169 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:20:14,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 06:20:14,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 06:20:14,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 06:20:14,170 INFO L87 Difference]: Start difference. First operand 37207 states and 46969 transitions. Second operand 17 states. [2019-09-10 06:20:17,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:20:17,938 INFO L93 Difference]: Finished difference Result 62762 states and 80388 transitions. [2019-09-10 06:20:17,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-10 06:20:17,939 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 186 [2019-09-10 06:20:17,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:20:18,001 INFO L225 Difference]: With dead ends: 62762 [2019-09-10 06:20:18,001 INFO L226 Difference]: Without dead ends: 62498 [2019-09-10 06:20:18,001 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=598, Invalid=2054, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 06:20:18,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62498 states. [2019-09-10 06:20:18,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62498 to 44884. [2019-09-10 06:20:18,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44884 states. [2019-09-10 06:20:18,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44884 states to 44884 states and 57811 transitions. [2019-09-10 06:20:18,418 INFO L78 Accepts]: Start accepts. Automaton has 44884 states and 57811 transitions. Word has length 186 [2019-09-10 06:20:18,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:20:18,418 INFO L475 AbstractCegarLoop]: Abstraction has 44884 states and 57811 transitions. [2019-09-10 06:20:18,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 06:20:18,418 INFO L276 IsEmpty]: Start isEmpty. Operand 44884 states and 57811 transitions. [2019-09-10 06:20:18,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-09-10 06:20:18,428 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:20:18,428 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:20:18,429 INFO L418 AbstractCegarLoop]: === Iteration 117 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:20:18,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:20:18,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1968159581, now seen corresponding path program 1 times [2019-09-10 06:20:18,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:20:18,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:18,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:20:18,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:18,430 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:20:18,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:20:18,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:20:18,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:20:18,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:20:18,485 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:20:18,485 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:20:18,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:20:18,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:20:18,486 INFO L87 Difference]: Start difference. First operand 44884 states and 57811 transitions. Second operand 3 states. [2019-09-10 06:20:18,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:20:18,688 INFO L93 Difference]: Finished difference Result 73199 states and 94140 transitions. [2019-09-10 06:20:18,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:20:18,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 199 [2019-09-10 06:20:18,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:20:18,769 INFO L225 Difference]: With dead ends: 73199 [2019-09-10 06:20:18,769 INFO L226 Difference]: Without dead ends: 73199 [2019-09-10 06:20:18,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 06:20:18,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73199 states. [2019-09-10 06:20:19,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73199 to 72991. [2019-09-10 06:20:19,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72991 states. [2019-09-10 06:20:19,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72991 states to 72991 states and 93933 transitions. [2019-09-10 06:20:19,326 INFO L78 Accepts]: Start accepts. Automaton has 72991 states and 93933 transitions. Word has length 199 [2019-09-10 06:20:19,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:20:19,326 INFO L475 AbstractCegarLoop]: Abstraction has 72991 states and 93933 transitions. [2019-09-10 06:20:19,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:20:19,326 INFO L276 IsEmpty]: Start isEmpty. Operand 72991 states and 93933 transitions. [2019-09-10 06:20:19,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-09-10 06:20:19,336 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:20:19,336 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:20:19,336 INFO L418 AbstractCegarLoop]: === Iteration 118 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:20:19,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:20:19,336 INFO L82 PathProgramCache]: Analyzing trace with hash -856719487, now seen corresponding path program 1 times [2019-09-10 06:20:19,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:20:19,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:19,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:20:19,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:19,338 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:20:19,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:20:19,392 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:20:19,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:20:19,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:20:19,392 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:20:19,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:20:19,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:20:19,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:20:19,393 INFO L87 Difference]: Start difference. First operand 72991 states and 93933 transitions. Second operand 3 states. [2019-09-10 06:20:19,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:20:19,690 INFO L93 Difference]: Finished difference Result 124781 states and 161006 transitions. [2019-09-10 06:20:19,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:20:19,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 200 [2019-09-10 06:20:19,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:20:19,832 INFO L225 Difference]: With dead ends: 124781 [2019-09-10 06:20:19,833 INFO L226 Difference]: Without dead ends: 124781 [2019-09-10 06:20:19,833 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:20:20,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124781 states. [2019-09-10 06:20:20,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124781 to 124043. [2019-09-10 06:20:20,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124043 states. [2019-09-10 06:20:21,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124043 states to 124043 states and 160269 transitions. [2019-09-10 06:20:21,119 INFO L78 Accepts]: Start accepts. Automaton has 124043 states and 160269 transitions. Word has length 200 [2019-09-10 06:20:21,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:20:21,120 INFO L475 AbstractCegarLoop]: Abstraction has 124043 states and 160269 transitions. [2019-09-10 06:20:21,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:20:21,120 INFO L276 IsEmpty]: Start isEmpty. Operand 124043 states and 160269 transitions. [2019-09-10 06:20:21,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-09-10 06:20:21,130 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:20:21,130 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:20:21,130 INFO L418 AbstractCegarLoop]: === Iteration 119 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:20:21,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:20:21,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1907641334, now seen corresponding path program 1 times [2019-09-10 06:20:21,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:20:21,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:21,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:20:21,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:21,132 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:20:21,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:20:21,182 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:20:21,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:20:21,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:20:21,183 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:20:21,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:20:21,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:20:21,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:20:21,183 INFO L87 Difference]: Start difference. First operand 124043 states and 160269 transitions. Second operand 3 states. [2019-09-10 06:20:21,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:20:21,672 INFO L93 Difference]: Finished difference Result 217716 states and 281895 transitions. [2019-09-10 06:20:21,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:20:21,672 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 201 [2019-09-10 06:20:21,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:20:21,961 INFO L225 Difference]: With dead ends: 217716 [2019-09-10 06:20:21,961 INFO L226 Difference]: Without dead ends: 217716 [2019-09-10 06:20:21,962 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:20:22,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217716 states. [2019-09-10 06:20:26,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217716 to 215958. [2019-09-10 06:20:26,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215958 states. [2019-09-10 06:20:27,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215958 states to 215958 states and 280138 transitions. [2019-09-10 06:20:27,274 INFO L78 Accepts]: Start accepts. Automaton has 215958 states and 280138 transitions. Word has length 201 [2019-09-10 06:20:27,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:20:27,275 INFO L475 AbstractCegarLoop]: Abstraction has 215958 states and 280138 transitions. [2019-09-10 06:20:27,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:20:27,275 INFO L276 IsEmpty]: Start isEmpty. Operand 215958 states and 280138 transitions. [2019-09-10 06:20:27,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-09-10 06:20:27,288 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:20:27,288 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:20:27,288 INFO L418 AbstractCegarLoop]: === Iteration 120 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:20:27,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:20:27,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1844779578, now seen corresponding path program 1 times [2019-09-10 06:20:27,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:20:27,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:27,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:20:27,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:27,290 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:20:27,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:20:27,353 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:20:27,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:20:27,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:20:27,353 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:20:27,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:20:27,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:20:27,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:20:27,354 INFO L87 Difference]: Start difference. First operand 215958 states and 280138 transitions. Second operand 3 states. [2019-09-10 06:20:28,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:20:28,148 INFO L93 Difference]: Finished difference Result 360980 states and 468231 transitions. [2019-09-10 06:20:28,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:20:28,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 202 [2019-09-10 06:20:28,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:20:28,631 INFO L225 Difference]: With dead ends: 360980 [2019-09-10 06:20:28,631 INFO L226 Difference]: Without dead ends: 360980 [2019-09-10 06:20:28,631 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:20:28,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360980 states. [2019-09-10 06:20:35,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360980 to 358330. [2019-09-10 06:20:35,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358330 states. [2019-09-10 06:20:35,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358330 states to 358330 states and 465582 transitions. [2019-09-10 06:20:35,968 INFO L78 Accepts]: Start accepts. Automaton has 358330 states and 465582 transitions. Word has length 202 [2019-09-10 06:20:35,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:20:35,969 INFO L475 AbstractCegarLoop]: Abstraction has 358330 states and 465582 transitions. [2019-09-10 06:20:35,969 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:20:35,969 INFO L276 IsEmpty]: Start isEmpty. Operand 358330 states and 465582 transitions. [2019-09-10 06:20:35,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-10 06:20:35,982 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:20:35,982 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:20:35,982 INFO L418 AbstractCegarLoop]: === Iteration 121 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:20:35,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:20:35,982 INFO L82 PathProgramCache]: Analyzing trace with hash 135056061, now seen corresponding path program 1 times [2019-09-10 06:20:35,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:20:35,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:35,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:20:35,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:35,983 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:20:35,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:20:36,073 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:20:36,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:20:36,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:20:36,074 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:20:36,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:20:36,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:20:36,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:20:36,075 INFO L87 Difference]: Start difference. First operand 358330 states and 465582 transitions. Second operand 7 states. [2019-09-10 06:20:37,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:20:37,159 INFO L93 Difference]: Finished difference Result 377830 states and 490047 transitions. [2019-09-10 06:20:37,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 06:20:37,159 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 203 [2019-09-10 06:20:37,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:20:43,225 INFO L225 Difference]: With dead ends: 377830 [2019-09-10 06:20:43,225 INFO L226 Difference]: Without dead ends: 377830 [2019-09-10 06:20:43,225 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2019-09-10 06:20:43,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377830 states. [2019-09-10 06:20:45,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377830 to 330230. [2019-09-10 06:20:45,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330230 states. [2019-09-10 06:20:46,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330230 states to 330230 states and 429152 transitions. [2019-09-10 06:20:46,062 INFO L78 Accepts]: Start accepts. Automaton has 330230 states and 429152 transitions. Word has length 203 [2019-09-10 06:20:46,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:20:46,062 INFO L475 AbstractCegarLoop]: Abstraction has 330230 states and 429152 transitions. [2019-09-10 06:20:46,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:20:46,062 INFO L276 IsEmpty]: Start isEmpty. Operand 330230 states and 429152 transitions. [2019-09-10 06:20:46,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-10 06:20:46,076 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:20:46,076 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:20:46,076 INFO L418 AbstractCegarLoop]: === Iteration 122 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:20:46,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:20:46,076 INFO L82 PathProgramCache]: Analyzing trace with hash -992069378, now seen corresponding path program 1 times [2019-09-10 06:20:46,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:20:46,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:46,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:20:46,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:46,077 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:20:46,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:20:46,131 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:20:46,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:20:46,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:20:46,132 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:20:46,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:20:46,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:20:46,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:20:46,133 INFO L87 Difference]: Start difference. First operand 330230 states and 429152 transitions. Second operand 3 states. [2019-09-10 06:20:48,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:20:48,488 INFO L93 Difference]: Finished difference Result 599098 states and 769488 transitions. [2019-09-10 06:20:48,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:20:48,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 203 [2019-09-10 06:20:48,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:20:49,307 INFO L225 Difference]: With dead ends: 599098 [2019-09-10 06:20:49,307 INFO L226 Difference]: Without dead ends: 599098 [2019-09-10 06:20:49,308 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:20:49,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599098 states. [2019-09-10 06:20:56,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599098 to 495298. [2019-09-10 06:20:56,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495298 states. [2019-09-10 06:21:08,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495298 states to 495298 states and 639418 transitions. [2019-09-10 06:21:08,793 INFO L78 Accepts]: Start accepts. Automaton has 495298 states and 639418 transitions. Word has length 203 [2019-09-10 06:21:08,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:21:08,794 INFO L475 AbstractCegarLoop]: Abstraction has 495298 states and 639418 transitions. [2019-09-10 06:21:08,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:21:08,794 INFO L276 IsEmpty]: Start isEmpty. Operand 495298 states and 639418 transitions. [2019-09-10 06:21:08,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-10 06:21:08,806 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:21:08,806 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:21:08,806 INFO L418 AbstractCegarLoop]: === Iteration 123 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:21:08,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:21:08,806 INFO L82 PathProgramCache]: Analyzing trace with hash 679504759, now seen corresponding path program 1 times [2019-09-10 06:21:08,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:21:08,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:08,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:21:08,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:08,807 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:21:08,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:21:08,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:21:08,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:21:08,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:21:08,965 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:21:08,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:21:08,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:21:08,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:21:08,966 INFO L87 Difference]: Start difference. First operand 495298 states and 639418 transitions. Second operand 6 states. [2019-09-10 06:21:15,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:21:15,134 INFO L93 Difference]: Finished difference Result 1570045 states and 2032752 transitions. [2019-09-10 06:21:15,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:21:15,135 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 203 [2019-09-10 06:21:15,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:21:17,551 INFO L225 Difference]: With dead ends: 1570045 [2019-09-10 06:21:17,551 INFO L226 Difference]: Without dead ends: 1570045 [2019-09-10 06:21:17,551 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:21:18,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570045 states. [2019-09-10 06:21:44,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570045 to 874824. [2019-09-10 06:21:44,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 874824 states. [2019-09-10 06:22:00,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874824 states to 874824 states and 1123877 transitions. [2019-09-10 06:22:00,027 INFO L78 Accepts]: Start accepts. Automaton has 874824 states and 1123877 transitions. Word has length 203 [2019-09-10 06:22:00,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:00,027 INFO L475 AbstractCegarLoop]: Abstraction has 874824 states and 1123877 transitions. [2019-09-10 06:22:00,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:22:00,027 INFO L276 IsEmpty]: Start isEmpty. Operand 874824 states and 1123877 transitions. [2019-09-10 06:22:00,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-10 06:22:00,040 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:00,040 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:22:00,040 INFO L418 AbstractCegarLoop]: === Iteration 124 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:00,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:00,040 INFO L82 PathProgramCache]: Analyzing trace with hash -728763690, now seen corresponding path program 1 times [2019-09-10 06:22:00,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:00,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:00,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:00,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:00,041 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:00,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:00,292 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:22:00,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:00,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:22:00,293 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:00,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:22:00,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:22:00,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:22:00,294 INFO L87 Difference]: Start difference. First operand 874824 states and 1123877 transitions. Second operand 9 states.