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/pals_floodmax.4.4.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 04:01:36,740 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 04:01:36,743 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 04:01:36,760 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 04:01:36,761 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 04:01:36,762 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 04:01:36,763 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 04:01:36,765 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 04:01:36,767 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 04:01:36,767 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 04:01:36,768 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 04:01:36,770 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 04:01:36,770 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 04:01:36,771 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 04:01:36,772 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 04:01:36,773 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 04:01:36,774 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 04:01:36,774 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 04:01:36,776 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 04:01:36,778 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 04:01:36,780 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 04:01:36,781 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 04:01:36,782 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 04:01:36,782 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 04:01:36,785 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 04:01:36,785 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 04:01:36,785 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 04:01:36,786 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 04:01:36,786 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 04:01:36,787 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 04:01:36,788 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 04:01:36,788 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 04:01:36,789 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 04:01:36,790 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 04:01:36,791 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 04:01:36,791 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 04:01:36,792 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 04:01:36,792 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 04:01:36,792 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 04:01:36,793 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 04:01:36,794 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 04:01:36,795 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 04:01:36,821 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 04:01:36,821 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 04:01:36,822 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 04:01:36,823 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 04:01:36,824 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 04:01:36,824 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 04:01:36,824 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 04:01:36,824 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 04:01:36,825 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 04:01:36,825 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 04:01:36,826 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 04:01:36,827 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 04:01:36,827 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 04:01:36,828 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 04:01:36,828 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 04:01:36,828 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 04:01:36,828 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 04:01:36,829 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 04:01:36,829 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 04:01:36,829 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 04:01:36,829 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 04:01:36,829 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 04:01:36,830 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 04:01:36,830 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 04:01:36,830 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 04:01:36,830 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 04:01:36,830 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 04:01:36,831 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 04:01:36,831 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 04:01:36,831 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 04:01:36,885 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 04:01:36,897 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 04:01:36,901 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 04:01:36,902 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 04:01:36,903 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 04:01:36,903 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_floodmax.4.4.ufo.UNBOUNDED.pals.c [2019-09-10 04:01:36,963 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16095b9a0/b07d23d8f9324a89a92776f020042f68/FLAG48fe5ef69 [2019-09-10 04:01:37,465 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 04:01:37,466 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_floodmax.4.4.ufo.UNBOUNDED.pals.c [2019-09-10 04:01:37,482 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16095b9a0/b07d23d8f9324a89a92776f020042f68/FLAG48fe5ef69 [2019-09-10 04:01:37,829 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16095b9a0/b07d23d8f9324a89a92776f020042f68 [2019-09-10 04:01:37,842 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 04:01:37,844 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 04:01:37,845 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 04:01:37,845 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 04:01:37,849 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 04:01:37,850 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:01:37" (1/1) ... [2019-09-10 04:01:37,853 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@270e4059 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:01:37, skipping insertion in model container [2019-09-10 04:01:37,853 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:01:37" (1/1) ... [2019-09-10 04:01:37,860 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 04:01:37,910 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 04:01:38,378 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:01:38,391 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 04:01:38,513 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:01:38,535 INFO L192 MainTranslator]: Completed translation [2019-09-10 04:01:38,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:01:38 WrapperNode [2019-09-10 04:01:38,536 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 04:01:38,536 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 04:01:38,536 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 04:01:38,537 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 04:01:38,549 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:01:38" (1/1) ... [2019-09-10 04:01:38,549 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:01:38" (1/1) ... [2019-09-10 04:01:38,566 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:01:38" (1/1) ... [2019-09-10 04:01:38,567 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:01:38" (1/1) ... [2019-09-10 04:01:38,594 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:01:38" (1/1) ... [2019-09-10 04:01:38,623 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:01:38" (1/1) ... [2019-09-10 04:01:38,628 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:01:38" (1/1) ... [2019-09-10 04:01:38,636 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 04:01:38,637 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 04:01:38,637 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 04:01:38,637 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 04:01:38,638 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:01:38" (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 04:01:38,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 04:01:38,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 04:01:38,709 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-10 04:01:38,709 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-10 04:01:38,710 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-10 04:01:38,710 INFO L138 BoogieDeclarations]: Found implementation of procedure node4 [2019-09-10 04:01:38,710 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-10 04:01:38,710 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-10 04:01:38,710 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 04:01:38,710 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-10 04:01:38,711 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 04:01:38,711 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 04:01:38,711 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 04:01:38,711 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 04:01:38,711 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 04:01:38,711 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 04:01:38,712 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 04:01:38,712 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 04:01:38,712 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 04:01:38,712 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 04:01:38,712 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 04:01:38,712 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 04:01:38,713 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 04:01:38,713 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 04:01:38,713 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 04:01:38,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 04:01:38,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 04:01:40,367 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 04:01:40,368 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-10 04:01:40,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:01:40 BoogieIcfgContainer [2019-09-10 04:01:40,371 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 04:01:40,372 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 04:01:40,372 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 04:01:40,375 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 04:01:40,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 04:01:37" (1/3) ... [2019-09-10 04:01:40,378 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@491e1f42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:01:40, skipping insertion in model container [2019-09-10 04:01:40,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:01:38" (2/3) ... [2019-09-10 04:01:40,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@491e1f42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:01:40, skipping insertion in model container [2019-09-10 04:01:40,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:01:40" (3/3) ... [2019-09-10 04:01:40,384 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.4.ufo.UNBOUNDED.pals.c [2019-09-10 04:01:40,398 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 04:01:40,409 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 04:01:40,431 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 04:01:40,472 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 04:01:40,472 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 04:01:40,472 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 04:01:40,472 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 04:01:40,473 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 04:01:40,473 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 04:01:40,473 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 04:01:40,473 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 04:01:40,519 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states. [2019-09-10 04:01:40,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 04:01:40,556 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:01:40,558 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:01:40,560 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:01:40,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:01:40,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1109206420, now seen corresponding path program 1 times [2019-09-10 04:01:40,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:01:40,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:01:40,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:01:40,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:01:40,637 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:01:40,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:01:41,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:01:41,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:01:41,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:01:41,193 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:01:41,199 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:01:41,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:01:41,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:01:41,218 INFO L87 Difference]: Start difference. First operand 335 states. Second operand 5 states. [2019-09-10 04:01:41,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:01:41,414 INFO L93 Difference]: Finished difference Result 334 states and 576 transitions. [2019-09-10 04:01:41,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 04:01:41,417 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-09-10 04:01:41,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:01:41,452 INFO L225 Difference]: With dead ends: 334 [2019-09-10 04:01:41,452 INFO L226 Difference]: Without dead ends: 330 [2019-09-10 04:01:41,457 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:01:41,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-09-10 04:01:41,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 330. [2019-09-10 04:01:41,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-09-10 04:01:41,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 531 transitions. [2019-09-10 04:01:41,578 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 531 transitions. Word has length 98 [2019-09-10 04:01:41,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:01:41,579 INFO L475 AbstractCegarLoop]: Abstraction has 330 states and 531 transitions. [2019-09-10 04:01:41,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:01:41,579 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 531 transitions. [2019-09-10 04:01:41,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-10 04:01:41,587 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:01:41,587 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:01:41,587 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:01:41,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:01:41,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1532145528, now seen corresponding path program 1 times [2019-09-10 04:01:41,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:01:41,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:01:41,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:01:41,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:01:41,590 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:01:41,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:01:42,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:01:42,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:01:42,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 04:01:42,068 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:01:42,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 04:01:42,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 04:01:42,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:01:42,071 INFO L87 Difference]: Start difference. First operand 330 states and 531 transitions. Second operand 11 states. [2019-09-10 04:01:48,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:01:48,517 INFO L93 Difference]: Finished difference Result 1185 states and 1990 transitions. [2019-09-10 04:01:48,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-10 04:01:48,517 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 139 [2019-09-10 04:01:48,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:01:48,532 INFO L225 Difference]: With dead ends: 1185 [2019-09-10 04:01:48,532 INFO L226 Difference]: Without dead ends: 1185 [2019-09-10 04:01:48,536 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 773 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=512, Invalid=1650, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 04:01:48,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2019-09-10 04:01:48,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 865. [2019-09-10 04:01:48,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 865 states. [2019-09-10 04:01:48,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1401 transitions. [2019-09-10 04:01:48,661 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1401 transitions. Word has length 139 [2019-09-10 04:01:48,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:01:48,664 INFO L475 AbstractCegarLoop]: Abstraction has 865 states and 1401 transitions. [2019-09-10 04:01:48,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 04:01:48,664 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1401 transitions. [2019-09-10 04:01:48,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-10 04:01:48,667 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:01:48,668 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:01:48,668 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:01:48,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:01:48,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1009788152, now seen corresponding path program 1 times [2019-09-10 04:01:48,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:01:48,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:01:48,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:01:48,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:01:48,671 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:01:48,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:01:48,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:01:48,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:01:48,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:01:48,883 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:01:48,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:01:48,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:01:48,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:01:48,885 INFO L87 Difference]: Start difference. First operand 865 states and 1401 transitions. Second operand 6 states. [2019-09-10 04:01:51,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:01:51,470 INFO L93 Difference]: Finished difference Result 2027 states and 3263 transitions. [2019-09-10 04:01:51,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 04:01:51,470 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 140 [2019-09-10 04:01:51,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:01:51,482 INFO L225 Difference]: With dead ends: 2027 [2019-09-10 04:01:51,482 INFO L226 Difference]: Without dead ends: 2027 [2019-09-10 04:01:51,483 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-10 04:01:51,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2027 states. [2019-09-10 04:01:51,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2027 to 2014. [2019-09-10 04:01:51,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2014 states. [2019-09-10 04:01:51,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2014 states to 2014 states and 3249 transitions. [2019-09-10 04:01:51,542 INFO L78 Accepts]: Start accepts. Automaton has 2014 states and 3249 transitions. Word has length 140 [2019-09-10 04:01:51,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:01:51,543 INFO L475 AbstractCegarLoop]: Abstraction has 2014 states and 3249 transitions. [2019-09-10 04:01:51,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:01:51,543 INFO L276 IsEmpty]: Start isEmpty. Operand 2014 states and 3249 transitions. [2019-09-10 04:01:51,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-10 04:01:51,546 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:01:51,546 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:01:51,547 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:01:51,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:01:51,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1742961455, now seen corresponding path program 1 times [2019-09-10 04:01:51,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:01:51,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:01:51,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:01:51,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:01:51,549 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:01:51,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:01:51,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:01:51,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:01:51,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:01:51,752 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:01:51,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:01:51,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:01:51,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:01:51,754 INFO L87 Difference]: Start difference. First operand 2014 states and 3249 transitions. Second operand 6 states. [2019-09-10 04:01:53,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:01:53,798 INFO L93 Difference]: Finished difference Result 5755 states and 9250 transitions. [2019-09-10 04:01:53,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 04:01:53,798 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-09-10 04:01:53,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:01:53,836 INFO L225 Difference]: With dead ends: 5755 [2019-09-10 04:01:53,836 INFO L226 Difference]: Without dead ends: 5755 [2019-09-10 04:01:53,837 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:01:53,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5755 states. [2019-09-10 04:01:53,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5755 to 5066. [2019-09-10 04:01:53,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5066 states. [2019-09-10 04:01:53,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5066 states to 5066 states and 8139 transitions. [2019-09-10 04:01:53,988 INFO L78 Accepts]: Start accepts. Automaton has 5066 states and 8139 transitions. Word has length 141 [2019-09-10 04:01:53,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:01:53,989 INFO L475 AbstractCegarLoop]: Abstraction has 5066 states and 8139 transitions. [2019-09-10 04:01:53,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:01:53,989 INFO L276 IsEmpty]: Start isEmpty. Operand 5066 states and 8139 transitions. [2019-09-10 04:01:53,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-10 04:01:53,994 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:01:53,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] [2019-09-10 04:01:53,995 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:01:53,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:01:53,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1127168415, now seen corresponding path program 1 times [2019-09-10 04:01:53,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:01:53,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:01:53,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:01:53,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:01:53,998 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:01:54,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:01:54,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:01:54,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:01:54,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:01:54,212 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:01:54,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:01:54,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:01:54,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:01:54,214 INFO L87 Difference]: Start difference. First operand 5066 states and 8139 transitions. Second operand 6 states. [2019-09-10 04:01:55,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:01:55,766 INFO L93 Difference]: Finished difference Result 10382 states and 16575 transitions. [2019-09-10 04:01:55,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 04:01:55,766 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2019-09-10 04:01:55,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:01:55,825 INFO L225 Difference]: With dead ends: 10382 [2019-09-10 04:01:55,825 INFO L226 Difference]: Without dead ends: 10382 [2019-09-10 04:01:55,826 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-09-10 04:01:55,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10382 states. [2019-09-10 04:01:56,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10382 to 10342. [2019-09-10 04:01:56,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10342 states. [2019-09-10 04:01:56,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10342 states to 10342 states and 16534 transitions. [2019-09-10 04:01:56,096 INFO L78 Accepts]: Start accepts. Automaton has 10342 states and 16534 transitions. Word has length 142 [2019-09-10 04:01:56,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:01:56,096 INFO L475 AbstractCegarLoop]: Abstraction has 10342 states and 16534 transitions. [2019-09-10 04:01:56,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:01:56,097 INFO L276 IsEmpty]: Start isEmpty. Operand 10342 states and 16534 transitions. [2019-09-10 04:01:56,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-10 04:01:56,101 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:01:56,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] [2019-09-10 04:01:56,102 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:01:56,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:01:56,102 INFO L82 PathProgramCache]: Analyzing trace with hash -834231578, now seen corresponding path program 1 times [2019-09-10 04:01:56,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:01:56,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:01:56,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:01:56,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:01:56,109 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:01:56,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:01:56,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:01:56,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:01:56,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:01:56,322 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:01:56,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:01:56,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:01:56,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:01:56,324 INFO L87 Difference]: Start difference. First operand 10342 states and 16534 transitions. Second operand 6 states. [2019-09-10 04:01:58,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:01:58,328 INFO L93 Difference]: Finished difference Result 39433 states and 63010 transitions. [2019-09-10 04:01:58,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 04:01:58,329 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-09-10 04:01:58,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:01:58,580 INFO L225 Difference]: With dead ends: 39433 [2019-09-10 04:01:58,580 INFO L226 Difference]: Without dead ends: 39433 [2019-09-10 04:01:58,581 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:01:58,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39433 states. [2019-09-10 04:01:59,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39433 to 31316. [2019-09-10 04:01:59,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31316 states. [2019-09-10 04:01:59,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31316 states to 31316 states and 49962 transitions. [2019-09-10 04:01:59,880 INFO L78 Accepts]: Start accepts. Automaton has 31316 states and 49962 transitions. Word has length 143 [2019-09-10 04:01:59,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:01:59,891 INFO L475 AbstractCegarLoop]: Abstraction has 31316 states and 49962 transitions. [2019-09-10 04:01:59,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:01:59,892 INFO L276 IsEmpty]: Start isEmpty. Operand 31316 states and 49962 transitions. [2019-09-10 04:01:59,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-10 04:01:59,905 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:01:59,905 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:01:59,906 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:01:59,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:01:59,906 INFO L82 PathProgramCache]: Analyzing trace with hash 311829015, now seen corresponding path program 1 times [2019-09-10 04:01:59,907 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:01:59,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:01:59,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:01:59,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:01:59,909 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:02:00,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:02:00,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 04:02:00,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:02:00,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 04:02:00,317 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:02:00,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 04:02:00,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 04:02:00,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:02:00,320 INFO L87 Difference]: Start difference. First operand 31316 states and 49962 transitions. Second operand 11 states. [2019-09-10 04:02:09,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:02:09,624 INFO L93 Difference]: Finished difference Result 37176 states and 59154 transitions. [2019-09-10 04:02:09,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-10 04:02:09,624 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 145 [2019-09-10 04:02:09,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:02:09,766 INFO L225 Difference]: With dead ends: 37176 [2019-09-10 04:02:09,766 INFO L226 Difference]: Without dead ends: 37176 [2019-09-10 04:02:09,768 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1033 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=585, Invalid=2277, Unknown=0, NotChecked=0, Total=2862 [2019-09-10 04:02:09,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37176 states. [2019-09-10 04:02:10,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37176 to 36784. [2019-09-10 04:02:10,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36784 states. [2019-09-10 04:02:10,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36784 states to 36784 states and 58754 transitions. [2019-09-10 04:02:10,495 INFO L78 Accepts]: Start accepts. Automaton has 36784 states and 58754 transitions. Word has length 145 [2019-09-10 04:02:10,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:02:10,495 INFO L475 AbstractCegarLoop]: Abstraction has 36784 states and 58754 transitions. [2019-09-10 04:02:10,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 04:02:10,496 INFO L276 IsEmpty]: Start isEmpty. Operand 36784 states and 58754 transitions. [2019-09-10 04:02:10,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-10 04:02:10,505 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:02:10,505 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:02:10,505 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:02:10,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:02:10,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1376899337, now seen corresponding path program 1 times [2019-09-10 04:02:10,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:02:10,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:02:10,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:02:10,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:02:10,507 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:02:10,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:02:10,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:02:10,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:02:10,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 04:02:10,776 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:02:10,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 04:02:10,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 04:02:10,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:02:10,778 INFO L87 Difference]: Start difference. First operand 36784 states and 58754 transitions. Second operand 11 states. [2019-09-10 04:02:18,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:02:18,194 INFO L93 Difference]: Finished difference Result 43748 states and 69893 transitions. [2019-09-10 04:02:18,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-10 04:02:18,194 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 145 [2019-09-10 04:02:18,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:02:18,310 INFO L225 Difference]: With dead ends: 43748 [2019-09-10 04:02:18,311 INFO L226 Difference]: Without dead ends: 43748 [2019-09-10 04:02:18,312 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1038 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=599, Invalid=2371, Unknown=0, NotChecked=0, Total=2970 [2019-09-10 04:02:18,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43748 states. [2019-09-10 04:02:19,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43748 to 43545. [2019-09-10 04:02:19,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43545 states. [2019-09-10 04:02:19,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43545 states to 43545 states and 69694 transitions. [2019-09-10 04:02:19,204 INFO L78 Accepts]: Start accepts. Automaton has 43545 states and 69694 transitions. Word has length 145 [2019-09-10 04:02:19,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:02:19,205 INFO L475 AbstractCegarLoop]: Abstraction has 43545 states and 69694 transitions. [2019-09-10 04:02:19,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 04:02:19,205 INFO L276 IsEmpty]: Start isEmpty. Operand 43545 states and 69694 transitions. [2019-09-10 04:02:19,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-10 04:02:19,215 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:02:19,215 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:02:19,215 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:02:19,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:02:19,216 INFO L82 PathProgramCache]: Analyzing trace with hash 146101726, now seen corresponding path program 1 times [2019-09-10 04:02:19,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:02:19,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:02:19,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:02:19,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:02:19,224 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:02:19,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:02:19,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:02:19,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:02:19,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:02:19,423 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:02:19,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:02:19,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:02:19,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:02:19,424 INFO L87 Difference]: Start difference. First operand 43545 states and 69694 transitions. Second operand 6 states. [2019-09-10 04:02:21,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:02:21,286 INFO L93 Difference]: Finished difference Result 90732 states and 142533 transitions. [2019-09-10 04:02:21,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 04:02:21,287 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2019-09-10 04:02:21,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:02:21,584 INFO L225 Difference]: With dead ends: 90732 [2019-09-10 04:02:21,584 INFO L226 Difference]: Without dead ends: 90732 [2019-09-10 04:02:21,585 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:02:21,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90732 states. [2019-09-10 04:02:24,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90732 to 89812. [2019-09-10 04:02:24,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89812 states. [2019-09-10 04:02:24,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89812 states to 89812 states and 141615 transitions. [2019-09-10 04:02:24,565 INFO L78 Accepts]: Start accepts. Automaton has 89812 states and 141615 transitions. Word has length 145 [2019-09-10 04:02:24,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:02:24,566 INFO L475 AbstractCegarLoop]: Abstraction has 89812 states and 141615 transitions. [2019-09-10 04:02:24,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:02:24,566 INFO L276 IsEmpty]: Start isEmpty. Operand 89812 states and 141615 transitions. [2019-09-10 04:02:24,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-10 04:02:24,571 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:02:24,571 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:02:24,571 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:02:24,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:02:24,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1985707213, now seen corresponding path program 1 times [2019-09-10 04:02:24,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:02:24,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:02:24,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:02:24,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:02:24,577 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:02:24,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:02:25,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:02:25,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:02:25,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:02:25,014 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:02:25,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:02:25,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:02:25,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:02:25,016 INFO L87 Difference]: Start difference. First operand 89812 states and 141615 transitions. Second operand 5 states. [2019-09-10 04:02:26,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:02:26,502 INFO L93 Difference]: Finished difference Result 178086 states and 278292 transitions. [2019-09-10 04:02:26,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:02:26,503 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-09-10 04:02:26,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:02:27,056 INFO L225 Difference]: With dead ends: 178086 [2019-09-10 04:02:27,057 INFO L226 Difference]: Without dead ends: 178086 [2019-09-10 04:02:27,057 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:02:27,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178086 states. [2019-09-10 04:02:31,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178086 to 178084. [2019-09-10 04:02:31,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178084 states. [2019-09-10 04:02:32,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178084 states to 178084 states and 278291 transitions. [2019-09-10 04:02:32,458 INFO L78 Accepts]: Start accepts. Automaton has 178084 states and 278291 transitions. Word has length 148 [2019-09-10 04:02:32,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:02:32,459 INFO L475 AbstractCegarLoop]: Abstraction has 178084 states and 278291 transitions. [2019-09-10 04:02:32,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:02:32,459 INFO L276 IsEmpty]: Start isEmpty. Operand 178084 states and 278291 transitions. [2019-09-10 04:02:32,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 04:02:32,466 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:02:32,467 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:02:32,467 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:02:32,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:02:32,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1735540910, now seen corresponding path program 1 times [2019-09-10 04:02:32,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:02:32,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:02:32,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:02:32,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:02:32,469 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:02:32,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:02:32,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 04:02:32,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:02:32,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:02:32,613 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:02:32,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:02:32,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:02:32,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:02:32,614 INFO L87 Difference]: Start difference. First operand 178084 states and 278291 transitions. Second operand 5 states. [2019-09-10 04:02:34,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:02:34,449 INFO L93 Difference]: Finished difference Result 238729 states and 368638 transitions. [2019-09-10 04:02:34,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:02:34,449 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-09-10 04:02:34,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:02:35,209 INFO L225 Difference]: With dead ends: 238729 [2019-09-10 04:02:35,209 INFO L226 Difference]: Without dead ends: 238729 [2019-09-10 04:02:35,211 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:02:35,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238729 states. [2019-09-10 04:02:41,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238729 to 225109. [2019-09-10 04:02:41,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225109 states. [2019-09-10 04:02:42,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225109 states to 225109 states and 353189 transitions. [2019-09-10 04:02:42,362 INFO L78 Accepts]: Start accepts. Automaton has 225109 states and 353189 transitions. Word has length 150 [2019-09-10 04:02:42,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:02:42,363 INFO L475 AbstractCegarLoop]: Abstraction has 225109 states and 353189 transitions. [2019-09-10 04:02:42,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:02:42,363 INFO L276 IsEmpty]: Start isEmpty. Operand 225109 states and 353189 transitions. [2019-09-10 04:02:42,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-10 04:02:42,375 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:02:42,375 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:02:42,375 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:02:42,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:02:42,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1626587629, now seen corresponding path program 1 times [2019-09-10 04:02:42,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:02:42,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:02:42,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:02:42,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:02:42,377 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:02:42,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:02:42,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:02:42,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:02:42,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 04:02:42,446 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:02:42,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 04:02:42,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 04:02:42,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 04:02:42,447 INFO L87 Difference]: Start difference. First operand 225109 states and 353189 transitions. Second operand 3 states. [2019-09-10 04:02:43,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:02:43,180 INFO L93 Difference]: Finished difference Result 225466 states and 353753 transitions. [2019-09-10 04:02:43,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 04:02:43,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-09-10 04:02:43,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:02:49,045 INFO L225 Difference]: With dead ends: 225466 [2019-09-10 04:02:49,046 INFO L226 Difference]: Without dead ends: 225466 [2019-09-10 04:02:49,046 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 04:02:49,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225466 states. [2019-09-10 04:02:51,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225466 to 225122. [2019-09-10 04:02:51,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225122 states. [2019-09-10 04:02:51,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225122 states to 225122 states and 353207 transitions. [2019-09-10 04:02:51,797 INFO L78 Accepts]: Start accepts. Automaton has 225122 states and 353207 transitions. Word has length 152 [2019-09-10 04:02:51,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:02:51,797 INFO L475 AbstractCegarLoop]: Abstraction has 225122 states and 353207 transitions. [2019-09-10 04:02:51,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 04:02:51,797 INFO L276 IsEmpty]: Start isEmpty. Operand 225122 states and 353207 transitions. [2019-09-10 04:02:51,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-10 04:02:51,806 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:02:51,807 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:02:51,807 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:02:51,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:02:51,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1928430506, now seen corresponding path program 1 times [2019-09-10 04:02:51,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:02:51,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:02:51,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:02:51,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:02:51,809 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:02:51,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:02:51,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:02:51,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:02:51,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 04:02:51,936 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:02:51,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 04:02:51,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 04:02:51,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 04:02:51,937 INFO L87 Difference]: Start difference. First operand 225122 states and 353207 transitions. Second operand 4 states. [2019-09-10 04:02:54,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:02:54,748 INFO L93 Difference]: Finished difference Result 478648 states and 741902 transitions. [2019-09-10 04:02:54,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 04:02:54,749 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-09-10 04:02:54,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:02:55,803 INFO L225 Difference]: With dead ends: 478648 [2019-09-10 04:02:55,803 INFO L226 Difference]: Without dead ends: 478648 [2019-09-10 04:02:55,804 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 04:02:56,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478648 states. [2019-09-10 04:03:07,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478648 to 478644. [2019-09-10 04:03:07,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478644 states. [2019-09-10 04:03:08,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478644 states to 478644 states and 741900 transitions. [2019-09-10 04:03:08,745 INFO L78 Accepts]: Start accepts. Automaton has 478644 states and 741900 transitions. Word has length 152 [2019-09-10 04:03:08,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:03:08,746 INFO L475 AbstractCegarLoop]: Abstraction has 478644 states and 741900 transitions. [2019-09-10 04:03:08,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 04:03:08,746 INFO L276 IsEmpty]: Start isEmpty. Operand 478644 states and 741900 transitions. [2019-09-10 04:03:08,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-10 04:03:08,769 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:03:08,769 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:03:08,769 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:03:08,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:03:08,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1391485187, now seen corresponding path program 1 times [2019-09-10 04:03:08,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:03:08,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:03:08,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:03:08,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:03:08,771 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:03:08,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:03:09,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:03:09,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:03:09,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 04:03:09,047 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:03:09,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 04:03:09,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 04:03:09,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-09-10 04:03:09,049 INFO L87 Difference]: Start difference. First operand 478644 states and 741900 transitions. Second operand 12 states. [2019-09-10 04:03:33,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:03:33,365 INFO L93 Difference]: Finished difference Result 978360 states and 1537691 transitions. [2019-09-10 04:03:33,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-10 04:03:33,366 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 153 [2019-09-10 04:03:33,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:03:35,805 INFO L225 Difference]: With dead ends: 978360 [2019-09-10 04:03:35,805 INFO L226 Difference]: Without dead ends: 978360 [2019-09-10 04:03:35,807 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=661, Invalid=2201, Unknown=0, NotChecked=0, Total=2862 [2019-09-10 04:03:36,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978360 states. [2019-09-10 04:04:02,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978360 to 941984. [2019-09-10 04:04:02,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 941984 states. [2019-09-10 04:04:19,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941984 states to 941984 states and 1478669 transitions. [2019-09-10 04:04:19,565 INFO L78 Accepts]: Start accepts. Automaton has 941984 states and 1478669 transitions. Word has length 153 [2019-09-10 04:04:19,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:04:19,565 INFO L475 AbstractCegarLoop]: Abstraction has 941984 states and 1478669 transitions. [2019-09-10 04:04:19,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 04:04:19,566 INFO L276 IsEmpty]: Start isEmpty. Operand 941984 states and 1478669 transitions. [2019-09-10 04:04:19,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-10 04:04:19,584 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:04:19,584 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:04:19,584 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:04:19,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:04:19,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1368852933, now seen corresponding path program 1 times [2019-09-10 04:04:19,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:04:19,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:04:19,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:04:19,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:04:19,586 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:04:19,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:04:19,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:04:19,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:04:19,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 04:04:19,754 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:04:19,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 04:04:19,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 04:04:19,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 04:04:19,755 INFO L87 Difference]: Start difference. First operand 941984 states and 1478669 transitions. Second operand 10 states. [2019-09-10 04:04:38,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:04:38,711 INFO L93 Difference]: Finished difference Result 1202106 states and 1903705 transitions. [2019-09-10 04:04:38,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 04:04:38,711 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 153 [2019-09-10 04:04:38,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:04:42,810 INFO L225 Difference]: With dead ends: 1202106 [2019-09-10 04:04:42,810 INFO L226 Difference]: Without dead ends: 1202058 [2019-09-10 04:04:42,811 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2019-09-10 04:04:43,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202058 states. [2019-09-10 04:05:18,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202058 to 1031334. [2019-09-10 04:05:18,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1031334 states. [2019-09-10 04:05:38,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031334 states to 1031334 states and 1623935 transitions. [2019-09-10 04:05:38,109 INFO L78 Accepts]: Start accepts. Automaton has 1031334 states and 1623935 transitions. Word has length 153 [2019-09-10 04:05:38,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:05:38,109 INFO L475 AbstractCegarLoop]: Abstraction has 1031334 states and 1623935 transitions. [2019-09-10 04:05:38,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 04:05:38,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1031334 states and 1623935 transitions. [2019-09-10 04:05:38,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-10 04:05:38,122 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:05:38,122 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:05:38,122 INFO L418 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:05:38,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:05:38,123 INFO L82 PathProgramCache]: Analyzing trace with hash 682131065, now seen corresponding path program 1 times [2019-09-10 04:05:38,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:05:38,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:05:38,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:05:38,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:05:38,124 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:05:38,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:05:38,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:05:38,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:05:38,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 04:05:38,296 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:05:38,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 04:05:38,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 04:05:38,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:05:38,297 INFO L87 Difference]: Start difference. First operand 1031334 states and 1623935 transitions. Second operand 7 states. [2019-09-10 04:05:53,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:05:53,467 INFO L93 Difference]: Finished difference Result 1166566 states and 1839312 transitions. [2019-09-10 04:05:53,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 04:05:53,472 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 153 [2019-09-10 04:05:53,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:06:06,458 INFO L225 Difference]: With dead ends: 1166566 [2019-09-10 04:06:06,458 INFO L226 Difference]: Without dead ends: 1166566 [2019-09-10 04:06:06,459 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:06:07,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166566 states. [2019-09-10 04:06:35,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166566 to 1111496. [2019-09-10 04:06:35,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1111496 states. [2019-09-10 04:06:40,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111496 states to 1111496 states and 1748859 transitions. [2019-09-10 04:06:40,441 INFO L78 Accepts]: Start accepts. Automaton has 1111496 states and 1748859 transitions. Word has length 153 [2019-09-10 04:06:40,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:06:40,442 INFO L475 AbstractCegarLoop]: Abstraction has 1111496 states and 1748859 transitions. [2019-09-10 04:06:40,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 04:06:40,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1111496 states and 1748859 transitions. [2019-09-10 04:06:40,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-10 04:06:40,453 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:06:40,453 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:06:40,454 INFO L418 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:06:40,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:06:40,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1874141699, now seen corresponding path program 1 times [2019-09-10 04:06:40,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:06:40,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:06:40,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:06:40,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:06:40,456 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:06:40,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:06:40,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:06:40,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:06:40,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:06:40,677 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:06:40,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:06:40,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:06:40,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:06:40,678 INFO L87 Difference]: Start difference. First operand 1111496 states and 1748859 transitions. Second operand 5 states.