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_lcr.7.1.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 04:41:41,898 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 04:41:41,900 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 04:41:41,912 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 04:41:41,912 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 04:41:41,913 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 04:41:41,915 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 04:41:41,917 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 04:41:41,919 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 04:41:41,919 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 04:41:41,920 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 04:41:41,922 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 04:41:41,922 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 04:41:41,923 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 04:41:41,924 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 04:41:41,925 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 04:41:41,926 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 04:41:41,927 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 04:41:41,929 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 04:41:41,931 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 04:41:41,933 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 04:41:41,934 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 04:41:41,936 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 04:41:41,936 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 04:41:41,939 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 04:41:41,939 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 04:41:41,939 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 04:41:41,940 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 04:41:41,941 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 04:41:41,942 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 04:41:41,942 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 04:41:41,944 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 04:41:41,945 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 04:41:41,947 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 04:41:41,948 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 04:41:41,950 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 04:41:41,951 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 04:41:41,951 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 04:41:41,951 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 04:41:41,952 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 04:41:41,953 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 04:41:41,954 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:41:41,982 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 04:41:41,982 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 04:41:41,983 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 04:41:41,983 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 04:41:41,984 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 04:41:41,984 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 04:41:41,984 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 04:41:41,985 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 04:41:41,985 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 04:41:41,985 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 04:41:41,987 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 04:41:41,988 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 04:41:41,988 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 04:41:41,988 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 04:41:41,988 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 04:41:41,989 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 04:41:41,989 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 04:41:41,989 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 04:41:41,989 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 04:41:41,990 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 04:41:41,990 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 04:41:41,990 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 04:41:41,990 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 04:41:41,991 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 04:41:41,991 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 04:41:41,991 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 04:41:41,991 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 04:41:41,992 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 04:41:41,992 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 04:41:41,992 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 04:41:42,044 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 04:41:42,066 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 04:41:42,069 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 04:41:42,071 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 04:41:42,071 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 04:41:42,072 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_lcr.7.1.ufo.UNBOUNDED.pals.c [2019-09-10 04:41:42,145 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6e2f5967/352aa428cb09443f8e5b7adda4a52d29/FLAG5a4e1a618 [2019-09-10 04:41:42,649 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 04:41:42,650 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_lcr.7.1.ufo.UNBOUNDED.pals.c [2019-09-10 04:41:42,662 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6e2f5967/352aa428cb09443f8e5b7adda4a52d29/FLAG5a4e1a618 [2019-09-10 04:41:43,033 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6e2f5967/352aa428cb09443f8e5b7adda4a52d29 [2019-09-10 04:41:43,045 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 04:41:43,047 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 04:41:43,047 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 04:41:43,048 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 04:41:43,051 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 04:41:43,052 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:41:43" (1/1) ... [2019-09-10 04:41:43,055 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47e21f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:41:43, skipping insertion in model container [2019-09-10 04:41:43,055 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:41:43" (1/1) ... [2019-09-10 04:41:43,063 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 04:41:43,120 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 04:41:43,470 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:41:43,481 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 04:41:43,546 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:41:43,567 INFO L192 MainTranslator]: Completed translation [2019-09-10 04:41:43,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:41:43 WrapperNode [2019-09-10 04:41:43,568 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 04:41:43,572 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 04:41:43,572 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 04:41:43,572 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 04:41:43,587 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:41:43" (1/1) ... [2019-09-10 04:41:43,587 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:41:43" (1/1) ... [2019-09-10 04:41:43,598 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:41:43" (1/1) ... [2019-09-10 04:41:43,599 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:41:43" (1/1) ... [2019-09-10 04:41:43,615 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:41:43" (1/1) ... [2019-09-10 04:41:43,629 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:41:43" (1/1) ... [2019-09-10 04:41:43,633 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:41:43" (1/1) ... [2019-09-10 04:41:43,639 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 04:41:43,640 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 04:41:43,640 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 04:41:43,640 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 04:41:43,641 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:41:43" (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:41:43,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 04:41:43,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 04:41:43,704 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-10 04:41:43,704 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-10 04:41:43,704 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-10 04:41:43,705 INFO L138 BoogieDeclarations]: Found implementation of procedure node4 [2019-09-10 04:41:43,705 INFO L138 BoogieDeclarations]: Found implementation of procedure node5 [2019-09-10 04:41:43,705 INFO L138 BoogieDeclarations]: Found implementation of procedure node6 [2019-09-10 04:41:43,705 INFO L138 BoogieDeclarations]: Found implementation of procedure node7 [2019-09-10 04:41:43,705 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-10 04:41:43,705 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-10 04:41:43,705 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 04:41:43,706 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-10 04:41:43,706 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 04:41:43,706 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 04:41:43,706 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 04:41:43,706 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 04:41:43,706 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 04:41:43,707 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 04:41:43,707 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 04:41:43,707 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 04:41:43,707 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 04:41:43,707 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 04:41:43,707 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 04:41:43,708 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 04:41:43,708 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 04:41:43,708 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-10 04:41:43,708 INFO L130 BoogieDeclarations]: Found specification of procedure node7 [2019-09-10 04:41:43,708 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 04:41:43,708 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 04:41:43,708 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 04:41:43,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 04:41:43,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 04:41:44,507 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 04:41:44,507 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-10 04:41:44,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:41:44 BoogieIcfgContainer [2019-09-10 04:41:44,509 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 04:41:44,510 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 04:41:44,510 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 04:41:44,513 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 04:41:44,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 04:41:43" (1/3) ... [2019-09-10 04:41:44,514 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37d4c57b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:41:44, skipping insertion in model container [2019-09-10 04:41:44,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:41:43" (2/3) ... [2019-09-10 04:41:44,515 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37d4c57b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:41:44, skipping insertion in model container [2019-09-10 04:41:44,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:41:44" (3/3) ... [2019-09-10 04:41:44,517 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.1.ufo.UNBOUNDED.pals.c [2019-09-10 04:41:44,526 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 04:41:44,534 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 04:41:44,551 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 04:41:44,576 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 04:41:44,576 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 04:41:44,576 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 04:41:44,577 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 04:41:44,577 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 04:41:44,577 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 04:41:44,577 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 04:41:44,578 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 04:41:44,600 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states. [2019-09-10 04:41:44,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 04:41:44,616 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:41:44,617 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:44,620 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:41:44,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:41:44,625 INFO L82 PathProgramCache]: Analyzing trace with hash 235646269, now seen corresponding path program 1 times [2019-09-10 04:41:44,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:41:44,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:41:44,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:41:44,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:41:44,683 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:41:44,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:41:45,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:41:45,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:41:45,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:41:45,068 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:41:45,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:41:45,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:41:45,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:41:45,095 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 5 states. [2019-09-10 04:41:45,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:41:45,320 INFO L93 Difference]: Finished difference Result 165 states and 255 transitions. [2019-09-10 04:41:45,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 04:41:45,323 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-09-10 04:41:45,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:41:45,346 INFO L225 Difference]: With dead ends: 165 [2019-09-10 04:41:45,346 INFO L226 Difference]: Without dead ends: 161 [2019-09-10 04:41:45,351 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:41:45,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-09-10 04:41:45,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2019-09-10 04:41:45,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-09-10 04:41:45,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 202 transitions. [2019-09-10 04:41:45,452 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 202 transitions. Word has length 75 [2019-09-10 04:41:45,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:41:45,452 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 202 transitions. [2019-09-10 04:41:45,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:41:45,453 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 202 transitions. [2019-09-10 04:41:45,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 04:41:45,460 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:41:45,460 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:45,461 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:41:45,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:41:45,461 INFO L82 PathProgramCache]: Analyzing trace with hash -314908723, now seen corresponding path program 1 times [2019-09-10 04:41:45,461 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:41:45,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:41:45,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:41:45,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:41:45,469 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:41:45,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:41:46,096 INFO L134 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:41:46,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:41:46,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 04:41:46,097 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:41:46,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 04:41:46,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 04:41:46,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2019-09-10 04:41:46,103 INFO L87 Difference]: Start difference. First operand 161 states and 202 transitions. Second operand 17 states. [2019-09-10 04:41:59,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:41:59,975 INFO L93 Difference]: Finished difference Result 2061 states and 3257 transitions. [2019-09-10 04:41:59,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-09-10 04:41:59,977 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 124 [2019-09-10 04:41:59,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:42:00,012 INFO L225 Difference]: With dead ends: 2061 [2019-09-10 04:42:00,012 INFO L226 Difference]: Without dead ends: 2061 [2019-09-10 04:42:00,017 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3677 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1998, Invalid=7122, Unknown=0, NotChecked=0, Total=9120 [2019-09-10 04:42:00,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2061 states. [2019-09-10 04:42:00,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2061 to 1069. [2019-09-10 04:42:00,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1069 states. [2019-09-10 04:42:00,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 1527 transitions. [2019-09-10 04:42:00,214 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 1527 transitions. Word has length 124 [2019-09-10 04:42:00,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:42:00,218 INFO L475 AbstractCegarLoop]: Abstraction has 1069 states and 1527 transitions. [2019-09-10 04:42:00,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 04:42:00,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1527 transitions. [2019-09-10 04:42:00,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 04:42:00,231 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:42:00,231 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:00,232 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:42:00,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:42:00,232 INFO L82 PathProgramCache]: Analyzing trace with hash -632550499, now seen corresponding path program 1 times [2019-09-10 04:42:00,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:42:00,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:42:00,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:42:00,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:42:00,240 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:42:00,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:42:00,350 INFO L134 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:42:00,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:42:00,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 04:42:00,351 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:42:00,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 04:42:00,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 04:42:00,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 04:42:00,354 INFO L87 Difference]: Start difference. First operand 1069 states and 1527 transitions. Second operand 3 states. [2019-09-10 04:42:00,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:42:00,399 INFO L93 Difference]: Finished difference Result 2014 states and 2884 transitions. [2019-09-10 04:42:00,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 04:42:00,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-09-10 04:42:00,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:42:00,412 INFO L225 Difference]: With dead ends: 2014 [2019-09-10 04:42:00,412 INFO L226 Difference]: Without dead ends: 2014 [2019-09-10 04:42:00,413 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 04:42:00,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2014 states. [2019-09-10 04:42:00,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2014 to 1992. [2019-09-10 04:42:00,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1992 states. [2019-09-10 04:42:00,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1992 states to 1992 states and 2853 transitions. [2019-09-10 04:42:00,474 INFO L78 Accepts]: Start accepts. Automaton has 1992 states and 2853 transitions. Word has length 126 [2019-09-10 04:42:00,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:42:00,475 INFO L475 AbstractCegarLoop]: Abstraction has 1992 states and 2853 transitions. [2019-09-10 04:42:00,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 04:42:00,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1992 states and 2853 transitions. [2019-09-10 04:42:00,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 04:42:00,477 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:42:00,478 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:42:00,478 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:42:00,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:42:00,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1920252955, now seen corresponding path program 1 times [2019-09-10 04:42:00,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:42:00,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:42:00,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:42:00,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:42:00,480 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:42:00,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:42:00,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:42:00,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:42:00,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:42:00,691 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:42:00,693 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:42:00,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:42:00,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:42:00,694 INFO L87 Difference]: Start difference. First operand 1992 states and 2853 transitions. Second operand 5 states. [2019-09-10 04:42:01,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:42:01,328 INFO L93 Difference]: Finished difference Result 3784 states and 5418 transitions. [2019-09-10 04:42:01,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:42:01,328 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 126 [2019-09-10 04:42:01,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:42:01,353 INFO L225 Difference]: With dead ends: 3784 [2019-09-10 04:42:01,354 INFO L226 Difference]: Without dead ends: 3784 [2019-09-10 04:42:01,354 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:42:01,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3784 states. [2019-09-10 04:42:01,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3784 to 3782. [2019-09-10 04:42:01,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3782 states. [2019-09-10 04:42:01,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3782 states to 3782 states and 5417 transitions. [2019-09-10 04:42:01,513 INFO L78 Accepts]: Start accepts. Automaton has 3782 states and 5417 transitions. Word has length 126 [2019-09-10 04:42:01,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:42:01,515 INFO L475 AbstractCegarLoop]: Abstraction has 3782 states and 5417 transitions. [2019-09-10 04:42:01,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:42:01,515 INFO L276 IsEmpty]: Start isEmpty. Operand 3782 states and 5417 transitions. [2019-09-10 04:42:01,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 04:42:01,518 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:42:01,519 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:42:01,519 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:42:01,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:42:01,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1576314905, now seen corresponding path program 1 times [2019-09-10 04:42:01,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:42:01,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:42:01,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:42:01,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:42:01,522 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:42:01,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:42:01,711 INFO L134 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:42:01,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:42:01,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:42:01,711 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:42:01,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:42:01,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:42:01,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:42:01,712 INFO L87 Difference]: Start difference. First operand 3782 states and 5417 transitions. Second operand 5 states. [2019-09-10 04:42:02,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:42:02,320 INFO L93 Difference]: Finished difference Result 7250 states and 10328 transitions. [2019-09-10 04:42:02,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:42:02,321 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 126 [2019-09-10 04:42:02,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:42:02,362 INFO L225 Difference]: With dead ends: 7250 [2019-09-10 04:42:02,362 INFO L226 Difference]: Without dead ends: 7250 [2019-09-10 04:42:02,362 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:42:02,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7250 states. [2019-09-10 04:42:02,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7250 to 7248. [2019-09-10 04:42:02,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7248 states. [2019-09-10 04:42:02,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7248 states to 7248 states and 10327 transitions. [2019-09-10 04:42:02,617 INFO L78 Accepts]: Start accepts. Automaton has 7248 states and 10327 transitions. Word has length 126 [2019-09-10 04:42:02,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:42:02,618 INFO L475 AbstractCegarLoop]: Abstraction has 7248 states and 10327 transitions. [2019-09-10 04:42:02,618 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:42:02,618 INFO L276 IsEmpty]: Start isEmpty. Operand 7248 states and 10327 transitions. [2019-09-10 04:42:02,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 04:42:02,620 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:42:02,620 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:02,621 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:42:02,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:42:02,621 INFO L82 PathProgramCache]: Analyzing trace with hash -70764699, now seen corresponding path program 1 times [2019-09-10 04:42:02,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:42:02,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:42:02,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:42:02,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:42:02,623 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:42:02,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:42:02,763 INFO L134 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:42:02,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:42:02,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:42:02,764 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:42:02,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:42:02,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:42:02,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:42:02,765 INFO L87 Difference]: Start difference. First operand 7248 states and 10327 transitions. Second operand 5 states. [2019-09-10 04:42:03,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:42:03,419 INFO L93 Difference]: Finished difference Result 13906 states and 19696 transitions. [2019-09-10 04:42:03,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:42:03,419 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 126 [2019-09-10 04:42:03,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:42:03,500 INFO L225 Difference]: With dead ends: 13906 [2019-09-10 04:42:03,500 INFO L226 Difference]: Without dead ends: 13906 [2019-09-10 04:42:03,501 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:42:03,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13906 states. [2019-09-10 04:42:03,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13906 to 13904. [2019-09-10 04:42:03,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13904 states. [2019-09-10 04:42:03,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13904 states to 13904 states and 19695 transitions. [2019-09-10 04:42:03,899 INFO L78 Accepts]: Start accepts. Automaton has 13904 states and 19695 transitions. Word has length 126 [2019-09-10 04:42:03,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:42:03,900 INFO L475 AbstractCegarLoop]: Abstraction has 13904 states and 19695 transitions. [2019-09-10 04:42:03,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:42:03,900 INFO L276 IsEmpty]: Start isEmpty. Operand 13904 states and 19695 transitions. [2019-09-10 04:42:03,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 04:42:03,904 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:42:03,904 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:03,904 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:42:03,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:42:03,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1421940133, now seen corresponding path program 1 times [2019-09-10 04:42:03,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:42:03,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:42:03,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:42:03,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:42:03,908 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:42:03,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:42:04,071 INFO L134 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:42:04,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:42:04,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:42:04,071 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:42:04,072 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:42:04,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:42:04,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:42:04,072 INFO L87 Difference]: Start difference. First operand 13904 states and 19695 transitions. Second operand 5 states. [2019-09-10 04:42:04,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:42:04,801 INFO L93 Difference]: Finished difference Result 26738 states and 37584 transitions. [2019-09-10 04:42:04,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:42:04,802 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 126 [2019-09-10 04:42:04,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:42:04,910 INFO L225 Difference]: With dead ends: 26738 [2019-09-10 04:42:04,910 INFO L226 Difference]: Without dead ends: 26738 [2019-09-10 04:42:04,911 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:42:04,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26738 states. [2019-09-10 04:42:05,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26738 to 26736. [2019-09-10 04:42:05,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26736 states. [2019-09-10 04:42:05,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26736 states to 26736 states and 37583 transitions. [2019-09-10 04:42:05,575 INFO L78 Accepts]: Start accepts. Automaton has 26736 states and 37583 transitions. Word has length 126 [2019-09-10 04:42:05,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:42:05,575 INFO L475 AbstractCegarLoop]: Abstraction has 26736 states and 37583 transitions. [2019-09-10 04:42:05,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:42:05,575 INFO L276 IsEmpty]: Start isEmpty. Operand 26736 states and 37583 transitions. [2019-09-10 04:42:05,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 04:42:05,577 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:42:05,577 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:05,578 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:42:05,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:42:05,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1686372389, now seen corresponding path program 1 times [2019-09-10 04:42:05,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:42:05,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:42:05,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:42:05,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:42:05,580 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:42:05,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:42:05,708 INFO L134 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:42:05,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:42:05,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:42:05,709 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:42:05,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:42:05,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:42:05,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:42:05,711 INFO L87 Difference]: Start difference. First operand 26736 states and 37583 transitions. Second operand 5 states. [2019-09-10 04:42:06,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:42:06,963 INFO L93 Difference]: Finished difference Result 51298 states and 71552 transitions. [2019-09-10 04:42:06,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:42:06,964 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 126 [2019-09-10 04:42:06,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:42:07,154 INFO L225 Difference]: With dead ends: 51298 [2019-09-10 04:42:07,155 INFO L226 Difference]: Without dead ends: 51298 [2019-09-10 04:42:07,155 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:42:07,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51298 states. [2019-09-10 04:42:08,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51298 to 51296. [2019-09-10 04:42:08,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51296 states. [2019-09-10 04:42:08,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51296 states to 51296 states and 71551 transitions. [2019-09-10 04:42:08,491 INFO L78 Accepts]: Start accepts. Automaton has 51296 states and 71551 transitions. Word has length 126 [2019-09-10 04:42:08,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:42:08,491 INFO L475 AbstractCegarLoop]: Abstraction has 51296 states and 71551 transitions. [2019-09-10 04:42:08,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:42:08,492 INFO L276 IsEmpty]: Start isEmpty. Operand 51296 states and 71551 transitions. [2019-09-10 04:42:08,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 04:42:08,493 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:42:08,494 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:42:08,494 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:42:08,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:42:08,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1086326439, now seen corresponding path program 1 times [2019-09-10 04:42:08,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:42:08,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:42:08,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:42:08,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:42:08,497 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:42:08,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:42:08,627 INFO L134 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:42:08,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:42:08,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:42:08,628 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:42:08,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:42:08,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:42:08,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:42:08,629 INFO L87 Difference]: Start difference. First operand 51296 states and 71551 transitions. Second operand 5 states. [2019-09-10 04:42:09,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:42:09,513 INFO L93 Difference]: Finished difference Result 98114 states and 135808 transitions. [2019-09-10 04:42:09,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:42:09,513 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 126 [2019-09-10 04:42:09,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:42:11,271 INFO L225 Difference]: With dead ends: 98114 [2019-09-10 04:42:11,271 INFO L226 Difference]: Without dead ends: 98114 [2019-09-10 04:42:11,272 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:42:11,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98114 states. [2019-09-10 04:42:12,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98114 to 98112. [2019-09-10 04:42:12,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98112 states. [2019-09-10 04:42:13,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98112 states to 98112 states and 135807 transitions. [2019-09-10 04:42:13,137 INFO L78 Accepts]: Start accepts. Automaton has 98112 states and 135807 transitions. Word has length 126 [2019-09-10 04:42:13,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:42:13,138 INFO L475 AbstractCegarLoop]: Abstraction has 98112 states and 135807 transitions. [2019-09-10 04:42:13,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:42:13,138 INFO L276 IsEmpty]: Start isEmpty. Operand 98112 states and 135807 transitions. [2019-09-10 04:42:13,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 04:42:13,466 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:42:13,466 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:13,466 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:42:13,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:42:13,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1710961317, now seen corresponding path program 1 times [2019-09-10 04:42:13,467 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:42:13,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:42:13,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:42:13,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:42:13,470 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:42:13,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:42:13,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:42:13,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:42:13,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 04:42:13,972 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:42:13,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 04:42:13,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 04:42:13,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2019-09-10 04:42:13,974 INFO L87 Difference]: Start difference. First operand 98112 states and 135807 transitions. Second operand 17 states. [2019-09-10 04:42:17,780 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2019-09-10 04:42:32,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:42:32,753 INFO L93 Difference]: Finished difference Result 231068 states and 370637 transitions. [2019-09-10 04:42:32,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-09-10 04:42:32,754 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 126 [2019-09-10 04:42:32,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:42:33,612 INFO L225 Difference]: With dead ends: 231068 [2019-09-10 04:42:33,612 INFO L226 Difference]: Without dead ends: 231068 [2019-09-10 04:42:33,615 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3708 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=2040, Invalid=7080, Unknown=0, NotChecked=0, Total=9120 [2019-09-10 04:42:33,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231068 states. [2019-09-10 04:42:40,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231068 to 135616. [2019-09-10 04:42:40,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135616 states. [2019-09-10 04:42:40,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135616 states to 135616 states and 188095 transitions. [2019-09-10 04:42:40,979 INFO L78 Accepts]: Start accepts. Automaton has 135616 states and 188095 transitions. Word has length 126 [2019-09-10 04:42:40,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:42:40,980 INFO L475 AbstractCegarLoop]: Abstraction has 135616 states and 188095 transitions. [2019-09-10 04:42:40,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 04:42:40,980 INFO L276 IsEmpty]: Start isEmpty. Operand 135616 states and 188095 transitions. [2019-09-10 04:42:40,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 04:42:40,981 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:42:40,982 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:42:40,982 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:42:40,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:42:40,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1321131864, now seen corresponding path program 1 times [2019-09-10 04:42:40,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:42:40,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:42:40,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:42:40,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:42:40,985 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:42:41,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:42:41,128 INFO L134 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:42:41,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:42:41,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:42:41,129 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:42:41,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:42:41,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:42:41,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:42:41,130 INFO L87 Difference]: Start difference. First operand 135616 states and 188095 transitions. Second operand 5 states. [2019-09-10 04:42:42,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:42:42,193 INFO L93 Difference]: Finished difference Result 198148 states and 272161 transitions. [2019-09-10 04:42:42,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:42:42,193 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 127 [2019-09-10 04:42:42,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:42:45,706 INFO L225 Difference]: With dead ends: 198148 [2019-09-10 04:42:45,706 INFO L226 Difference]: Without dead ends: 198148 [2019-09-10 04:42:45,706 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 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:42:45,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198148 states. [2019-09-10 04:42:47,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198148 to 194816. [2019-09-10 04:42:47,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194816 states. [2019-09-10 04:42:48,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194816 states to 194816 states and 267999 transitions. [2019-09-10 04:42:48,213 INFO L78 Accepts]: Start accepts. Automaton has 194816 states and 267999 transitions. Word has length 127 [2019-09-10 04:42:48,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:42:48,214 INFO L475 AbstractCegarLoop]: Abstraction has 194816 states and 267999 transitions. [2019-09-10 04:42:48,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:42:48,214 INFO L276 IsEmpty]: Start isEmpty. Operand 194816 states and 267999 transitions. [2019-09-10 04:42:48,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 04:42:48,216 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:42:48,216 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:48,216 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:42:48,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:42:48,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1326410471, now seen corresponding path program 1 times [2019-09-10 04:42:48,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:42:48,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:42:48,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:42:48,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:42:48,218 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:42:48,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:42:49,004 INFO L134 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:42:49,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:42:49,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 04:42:49,004 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:42:49,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 04:42:49,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 04:42:49,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:42:49,005 INFO L87 Difference]: Start difference. First operand 194816 states and 267999 transitions. Second operand 11 states. [2019-09-10 04:42:49,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:42:49,831 INFO L93 Difference]: Finished difference Result 227883 states and 330292 transitions. [2019-09-10 04:42:49,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 04:42:49,831 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 127 [2019-09-10 04:42:49,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:42:50,509 INFO L225 Difference]: With dead ends: 227883 [2019-09-10 04:42:50,510 INFO L226 Difference]: Without dead ends: 227883 [2019-09-10 04:42:50,510 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-10 04:42:50,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227883 states. [2019-09-10 04:42:57,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227883 to 207488. [2019-09-10 04:42:57,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207488 states. [2019-09-10 04:42:58,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207488 states to 207488 states and 280991 transitions. [2019-09-10 04:42:58,165 INFO L78 Accepts]: Start accepts. Automaton has 207488 states and 280991 transitions. Word has length 127 [2019-09-10 04:42:58,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:42:58,166 INFO L475 AbstractCegarLoop]: Abstraction has 207488 states and 280991 transitions. [2019-09-10 04:42:58,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 04:42:58,166 INFO L276 IsEmpty]: Start isEmpty. Operand 207488 states and 280991 transitions. [2019-09-10 04:42:58,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 04:42:58,168 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:42:58,168 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:58,168 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:42:58,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:42:58,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1444987300, now seen corresponding path program 1 times [2019-09-10 04:42:58,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:42:58,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:42:58,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:42:58,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:42:58,170 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:42:58,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:42:58,287 INFO L134 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:42:58,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:42:58,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 04:42:58,288 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:42:58,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 04:42:58,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 04:42:58,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:42:58,289 INFO L87 Difference]: Start difference. First operand 207488 states and 280991 transitions. Second operand 9 states. [2019-09-10 04:43:00,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:43:00,893 INFO L93 Difference]: Finished difference Result 252741 states and 344477 transitions. [2019-09-10 04:43:00,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 04:43:00,893 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 128 [2019-09-10 04:43:00,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:43:01,490 INFO L225 Difference]: With dead ends: 252741 [2019-09-10 04:43:01,490 INFO L226 Difference]: Without dead ends: 252741 [2019-09-10 04:43:01,491 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-09-10 04:43:01,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252741 states. [2019-09-10 04:43:09,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252741 to 232581. [2019-09-10 04:43:09,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232581 states. [2019-09-10 04:43:09,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232581 states to 232581 states and 316495 transitions. [2019-09-10 04:43:09,685 INFO L78 Accepts]: Start accepts. Automaton has 232581 states and 316495 transitions. Word has length 128 [2019-09-10 04:43:09,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:43:09,686 INFO L475 AbstractCegarLoop]: Abstraction has 232581 states and 316495 transitions. [2019-09-10 04:43:09,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 04:43:09,686 INFO L276 IsEmpty]: Start isEmpty. Operand 232581 states and 316495 transitions. [2019-09-10 04:43:09,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 04:43:09,687 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:43:09,687 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:09,687 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:43:09,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:43:09,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1465455699, now seen corresponding path program 1 times [2019-09-10 04:43:09,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:43:09,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:43:09,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:43:09,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:43:09,689 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:43:09,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:43:09,810 INFO L134 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:43:09,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:43:09,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:43:09,811 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:43:09,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:43:09,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:43:09,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:43:09,812 INFO L87 Difference]: Start difference. First operand 232581 states and 316495 transitions. Second operand 5 states. [2019-09-10 04:43:11,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:43:11,114 INFO L93 Difference]: Finished difference Result 286327 states and 383102 transitions. [2019-09-10 04:43:11,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:43:11,115 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 129 [2019-09-10 04:43:11,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:43:11,684 INFO L225 Difference]: With dead ends: 286327 [2019-09-10 04:43:11,684 INFO L226 Difference]: Without dead ends: 286327 [2019-09-10 04:43:11,685 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:43:11,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286327 states. [2019-09-10 04:43:20,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286327 to 286322. [2019-09-10 04:43:20,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286322 states. [2019-09-10 04:43:21,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286322 states to 286322 states and 383096 transitions. [2019-09-10 04:43:21,533 INFO L78 Accepts]: Start accepts. Automaton has 286322 states and 383096 transitions. Word has length 129 [2019-09-10 04:43:21,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:43:21,534 INFO L475 AbstractCegarLoop]: Abstraction has 286322 states and 383096 transitions. [2019-09-10 04:43:21,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:43:21,534 INFO L276 IsEmpty]: Start isEmpty. Operand 286322 states and 383096 transitions. [2019-09-10 04:43:21,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-10 04:43:21,588 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:43:21,588 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:43:21,588 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:43:21,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:43:21,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1955060961, now seen corresponding path program 1 times [2019-09-10 04:43:21,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:43:21,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:43:21,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:43:21,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:43:21,590 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:43:21,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:43:21,698 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-10 04:43:21,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:43:21,698 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:43:21,699 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 193 with the following transitions: [2019-09-10 04:43:21,702 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [126], [129], [132], [135], [138], [141], [144], [147], [150], [301], [302], [303], [305], [314], [322], [324], [331], [334], [339], [342], [346], [359], [361], [362], [363], [393], [396], [400], [402], [403], [406], [422], [424], [426], [429], [433], [435], [436], [439], [455], [457], [459], [464], [466], [468], [469], [472], [488], [490], [492], [497], [499], [501], [502], [503], [504], [507], [523], [525], [527], [530], [534], [536], [537], [540], [542], [545], [547], [548], [551], [567], [569], [571], [576], [578], [580], [581], [584], [587], [592], [595], [602], [604], [609], [611], [613], [617], [618], [619], [620], [621], [622], [623], [624], [625], [626], [627], [628], [629], [630], [631], [632], [633], [634], [635], [636], [637], [638], [639] [2019-09-10 04:43:21,765 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:43:21,765 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:43:21,899 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:43:22,448 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:43:22,450 INFO L272 AbstractInterpreter]: Visited 123 different actions 211 times. Merged at 8 different actions 16 times. Never widened. Performed 3241 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3241 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Never found a fixpoint. Largest state had 153 variables. [2019-09-10 04:43:22,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:43:22,455 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:43:22,939 INFO L227 lantSequenceWeakener]: Weakened 115 states. On average, predicates are now at 77.23% of their original sizes. [2019-09-10 04:43:22,939 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:43:28,676 INFO L420 sIntCurrentIteration]: We unified 191 AI predicates to 191 [2019-09-10 04:43:28,676 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:43:28,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:43:28,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [63] imperfect sequences [5] total 66 [2019-09-10 04:43:28,678 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:43:28,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-10 04:43:28,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-10 04:43:28,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=3441, Unknown=0, NotChecked=0, Total=3906 [2019-09-10 04:43:28,682 INFO L87 Difference]: Start difference. First operand 286322 states and 383096 transitions. Second operand 63 states. [2019-09-10 04:44:46,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:44:46,616 INFO L93 Difference]: Finished difference Result 307410 states and 411827 transitions. [2019-09-10 04:44:46,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-09-10 04:44:46,616 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 192 [2019-09-10 04:44:46,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:44:48,178 INFO L225 Difference]: With dead ends: 307410 [2019-09-10 04:44:48,178 INFO L226 Difference]: Without dead ends: 307410 [2019-09-10 04:44:48,185 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3482 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=1392, Invalid=10164, Unknown=0, NotChecked=0, Total=11556 [2019-09-10 04:44:48,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307410 states. [2019-09-10 04:44:55,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307410 to 306697. [2019-09-10 04:44:55,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306697 states. [2019-09-10 04:44:57,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306697 states to 306697 states and 410818 transitions. [2019-09-10 04:44:57,125 INFO L78 Accepts]: Start accepts. Automaton has 306697 states and 410818 transitions. Word has length 192 [2019-09-10 04:44:57,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:44:57,125 INFO L475 AbstractCegarLoop]: Abstraction has 306697 states and 410818 transitions. [2019-09-10 04:44:57,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-10 04:44:57,125 INFO L276 IsEmpty]: Start isEmpty. Operand 306697 states and 410818 transitions. [2019-09-10 04:44:57,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-10 04:44:57,245 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:44:57,246 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:44:57,246 INFO L418 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:44:57,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:44:57,247 INFO L82 PathProgramCache]: Analyzing trace with hash -672888675, now seen corresponding path program 1 times [2019-09-10 04:44:57,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:44:57,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:44:57,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:44:57,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:44:57,249 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:44:57,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:44:57,415 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-10 04:44:57,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:44:57,417 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:44:57,417 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 193 with the following transitions: [2019-09-10 04:44:57,419 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [126], [129], [132], [135], [138], [141], [144], [147], [150], [301], [302], [303], [305], [314], [322], [324], [331], [334], [339], [342], [346], [359], [361], [362], [363], [393], [396], [400], [402], [403], [406], [422], [424], [426], [429], [433], [435], [436], [439], [455], [457], [459], [464], [466], [468], [469], [472], [488], [490], [492], [495], [499], [501], [502], [503], [504], [507], [523], [525], [527], [530], [534], [536], [537], [540], [542], [545], [547], [548], [551], [567], [569], [571], [576], [578], [580], [581], [584], [587], [592], [595], [602], [604], [609], [611], [613], [617], [618], [619], [620], [621], [622], [623], [624], [625], [626], [627], [628], [629], [630], [631], [632], [633], [634], [635], [636], [637], [638], [639] [2019-09-10 04:44:57,433 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:44:57,433 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:44:57,463 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:44:57,970 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:44:57,971 INFO L272 AbstractInterpreter]: Visited 124 different actions 298 times. Merged at 11 different actions 33 times. Never widened. Performed 4558 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4558 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 2 fixpoints after 1 different actions. Largest state had 153 variables. [2019-09-10 04:44:57,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:44:57,971 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:44:58,266 INFO L227 lantSequenceWeakener]: Weakened 116 states. On average, predicates are now at 77.21% of their original sizes. [2019-09-10 04:44:58,266 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:45:04,368 INFO L420 sIntCurrentIteration]: We unified 191 AI predicates to 191 [2019-09-10 04:45:04,368 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:45:04,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:45:04,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [65] imperfect sequences [5] total 68 [2019-09-10 04:45:04,369 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:45:04,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-10 04:45:04,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-10 04:45:04,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=479, Invalid=3681, Unknown=0, NotChecked=0, Total=4160 [2019-09-10 04:45:04,372 INFO L87 Difference]: Start difference. First operand 306697 states and 410818 transitions. Second operand 65 states. [2019-09-10 04:46:58,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:46:58,110 INFO L93 Difference]: Finished difference Result 310992 states and 416473 transitions. [2019-09-10 04:46:58,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2019-09-10 04:46:58,110 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 192 [2019-09-10 04:46:58,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:46:58,988 INFO L225 Difference]: With dead ends: 310992 [2019-09-10 04:46:58,989 INFO L226 Difference]: Without dead ends: 310992 [2019-09-10 04:46:58,995 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6994 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=2336, Invalid=20014, Unknown=0, NotChecked=0, Total=22350 [2019-09-10 04:46:59,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310992 states. [2019-09-10 04:47:03,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310992 to 308326. [2019-09-10 04:47:03,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308326 states. [2019-09-10 04:47:04,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308326 states to 308326 states and 412669 transitions. [2019-09-10 04:47:04,503 INFO L78 Accepts]: Start accepts. Automaton has 308326 states and 412669 transitions. Word has length 192 [2019-09-10 04:47:04,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:47:04,503 INFO L475 AbstractCegarLoop]: Abstraction has 308326 states and 412669 transitions. [2019-09-10 04:47:04,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-10 04:47:04,503 INFO L276 IsEmpty]: Start isEmpty. Operand 308326 states and 412669 transitions. [2019-09-10 04:47:04,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-10 04:47:04,543 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:47:04,543 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:47:04,543 INFO L418 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:47:04,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:47:04,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1233514591, now seen corresponding path program 1 times [2019-09-10 04:47:04,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:47:04,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:47:04,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:47:04,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:47:04,545 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:47:04,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:47:04,645 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-10 04:47:04,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:47:04,645 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:47:04,645 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 193 with the following transitions: [2019-09-10 04:47:04,646 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [126], [129], [132], [135], [138], [141], [144], [147], [150], [301], [302], [303], [305], [314], [322], [324], [331], [334], [339], [342], [346], [359], [361], [362], [363], [393], [396], [400], [402], [403], [406], [422], [424], [426], [429], [433], [435], [436], [439], [455], [457], [459], [462], [466], [468], [469], [472], [488], [490], [492], [495], [499], [501], [502], [503], [504], [507], [523], [525], [527], [530], [534], [536], [537], [540], [542], [545], [547], [548], [551], [567], [569], [571], [576], [578], [580], [581], [584], [587], [592], [595], [602], [604], [609], [611], [613], [617], [618], [619], [620], [621], [622], [623], [624], [625], [626], [627], [628], [629], [630], [631], [632], [633], [634], [635], [636], [637], [638], [639] [2019-09-10 04:47:04,648 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:47:04,648 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:47:04,671 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:47:10,975 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:47:10,975 INFO L272 AbstractInterpreter]: Visited 125 different actions 346 times. Merged at 13 different actions 49 times. Never widened. Performed 5234 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5234 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 6 fixpoints after 2 different actions. Largest state had 153 variables. [2019-09-10 04:47:10,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:47:10,976 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:47:11,204 INFO L227 lantSequenceWeakener]: Weakened 117 states. On average, predicates are now at 77.2% of their original sizes. [2019-09-10 04:47:11,204 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:47:16,839 INFO L420 sIntCurrentIteration]: We unified 191 AI predicates to 191 [2019-09-10 04:47:16,840 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:47:16,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:47:16,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [67] imperfect sequences [5] total 70 [2019-09-10 04:47:16,840 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:47:16,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-09-10 04:47:16,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-09-10 04:47:16,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=497, Invalid=3925, Unknown=0, NotChecked=0, Total=4422 [2019-09-10 04:47:16,843 INFO L87 Difference]: Start difference. First operand 308326 states and 412669 transitions. Second operand 67 states. [2019-09-10 04:49:42,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:49:42,856 INFO L93 Difference]: Finished difference Result 317296 states and 424895 transitions. [2019-09-10 04:49:42,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2019-09-10 04:49:42,856 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 192 [2019-09-10 04:49:42,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:49:43,813 INFO L225 Difference]: With dead ends: 317296 [2019-09-10 04:49:43,813 INFO L226 Difference]: Without dead ends: 317296 [2019-09-10 04:49:43,816 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9262 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=2863, Invalid=26207, Unknown=0, NotChecked=0, Total=29070 [2019-09-10 04:49:44,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317296 states. [2019-09-10 04:49:48,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317296 to 311100. [2019-09-10 04:49:48,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311100 states. [2019-09-10 04:49:49,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311100 states to 311100 states and 416082 transitions. [2019-09-10 04:49:49,241 INFO L78 Accepts]: Start accepts. Automaton has 311100 states and 416082 transitions. Word has length 192 [2019-09-10 04:49:49,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:49:49,241 INFO L475 AbstractCegarLoop]: Abstraction has 311100 states and 416082 transitions. [2019-09-10 04:49:49,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-09-10 04:49:49,241 INFO L276 IsEmpty]: Start isEmpty. Operand 311100 states and 416082 transitions. [2019-09-10 04:49:49,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-10 04:49:49,269 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:49:49,270 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:49:49,270 INFO L418 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:49:49,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:49:49,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1120870691, now seen corresponding path program 1 times [2019-09-10 04:49:49,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:49:49,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:49:49,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:49:49,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:49:49,272 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:49:49,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:49:49,374 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-10 04:49:49,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:49:49,374 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:49:49,375 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 193 with the following transitions: [2019-09-10 04:49:49,375 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [126], [129], [132], [135], [138], [141], [144], [147], [150], [301], [302], [303], [305], [314], [322], [324], [331], [334], [339], [342], [346], [359], [361], [362], [363], [393], [396], [400], [402], [403], [406], [422], [424], [426], [429], [433], [435], [436], [439], [455], [457], [459], [462], [466], [468], [469], [472], [488], [490], [492], [495], [499], [501], [502], [503], [504], [507], [523], [525], [527], [530], [534], [536], [537], [540], [542], [545], [547], [548], [551], [567], [569], [571], [574], [578], [580], [581], [584], [587], [592], [595], [602], [604], [609], [611], [613], [617], [618], [619], [620], [621], [622], [623], [624], [625], [626], [627], [628], [629], [630], [631], [632], [633], [634], [635], [636], [637], [638], [639] [2019-09-10 04:49:49,377 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:49:49,377 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:49:49,400 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:49:49,814 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:49:49,815 INFO L272 AbstractInterpreter]: Visited 126 different actions 382 times. Merged at 15 different actions 67 times. Never widened. Performed 5627 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5627 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 12 fixpoints after 3 different actions. Largest state had 153 variables. [2019-09-10 04:49:49,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:49:49,815 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:49:50,015 INFO L227 lantSequenceWeakener]: Weakened 118 states. On average, predicates are now at 77.19% of their original sizes. [2019-09-10 04:49:50,016 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:50:00,879 INFO L420 sIntCurrentIteration]: We unified 191 AI predicates to 191 [2019-09-10 04:50:00,879 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:50:00,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:50:00,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [69] imperfect sequences [5] total 72 [2019-09-10 04:50:00,880 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:50:00,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-09-10 04:50:00,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-09-10 04:50:00,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=517, Invalid=4175, Unknown=0, NotChecked=0, Total=4692 [2019-09-10 04:50:00,882 INFO L87 Difference]: Start difference. First operand 311100 states and 416082 transitions. Second operand 69 states. [2019-09-10 04:52:23,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:52:23,010 INFO L93 Difference]: Finished difference Result 318384 states and 425573 transitions. [2019-09-10 04:52:23,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2019-09-10 04:52:23,010 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 192 [2019-09-10 04:52:23,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:52:23,873 INFO L225 Difference]: With dead ends: 318384 [2019-09-10 04:52:23,873 INFO L226 Difference]: Without dead ends: 318384 [2019-09-10 04:52:23,876 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11206 ImplicationChecksByTransitivity, 22.7s TimeCoverageRelationStatistics Valid=3319, Invalid=31463, Unknown=0, NotChecked=0, Total=34782 [2019-09-10 04:52:24,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318384 states. [2019-09-10 04:52:29,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318384 to 316667. [2019-09-10 04:52:29,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316667 states. [2019-09-10 04:52:29,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316667 states to 316667 states and 423274 transitions. [2019-09-10 04:52:29,971 INFO L78 Accepts]: Start accepts. Automaton has 316667 states and 423274 transitions. Word has length 192 [2019-09-10 04:52:29,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:52:29,972 INFO L475 AbstractCegarLoop]: Abstraction has 316667 states and 423274 transitions. [2019-09-10 04:52:29,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-09-10 04:52:29,972 INFO L276 IsEmpty]: Start isEmpty. Operand 316667 states and 423274 transitions. [2019-09-10 04:52:30,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-10 04:52:30,014 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:52:30,014 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:52:30,015 INFO L418 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:52:30,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:52:30,015 INFO L82 PathProgramCache]: Analyzing trace with hash 758260255, now seen corresponding path program 1 times [2019-09-10 04:52:30,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:52:30,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:52:30,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:52:30,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:52:30,017 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:52:30,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:52:30,122 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-10 04:52:30,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:52:30,123 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:52:30,123 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 193 with the following transitions: [2019-09-10 04:52:30,124 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [126], [129], [132], [135], [138], [141], [144], [147], [150], [301], [302], [303], [305], [314], [322], [324], [331], [334], [339], [342], [346], [359], [361], [362], [363], [393], [396], [400], [402], [403], [406], [422], [424], [426], [429], [433], [435], [436], [439], [455], [457], [459], [462], [466], [468], [469], [472], [488], [490], [492], [495], [499], [501], [502], [503], [504], [507], [523], [525], [527], [530], [534], [536], [537], [540], [542], [545], [547], [548], [551], [567], [569], [571], [574], [578], [580], [581], [584], [587], [592], [595], [602], [604], [607], [611], [613], [617], [618], [619], [620], [621], [622], [623], [624], [625], [626], [627], [628], [629], [630], [631], [632], [633], [634], [635], [636], [637], [638], [639] [2019-09-10 04:52:30,126 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:52:30,126 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:52:30,149 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:52:31,881 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:52:31,882 INFO L272 AbstractInterpreter]: Visited 150 different actions 1833 times. Merged at 24 different actions 415 times. Widened at 1 different actions 1 times. Performed 25990 root evaluator evaluations with a maximum evaluation depth of 7. Performed 25990 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 110 fixpoints after 8 different actions. Largest state had 153 variables. [2019-09-10 04:52:31,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:52:31,883 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:52:32,294 INFO L227 lantSequenceWeakener]: Weakened 153 states. On average, predicates are now at 78.13% of their original sizes. [2019-09-10 04:52:32,294 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:52:46,364 INFO L420 sIntCurrentIteration]: We unified 191 AI predicates to 191 [2019-09-10 04:52:46,364 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:52:46,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:52:46,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [88] imperfect sequences [5] total 91 [2019-09-10 04:52:46,364 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:52:46,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-09-10 04:52:46,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-09-10 04:52:46,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=710, Invalid=6946, Unknown=0, NotChecked=0, Total=7656 [2019-09-10 04:52:46,367 INFO L87 Difference]: Start difference. First operand 316667 states and 423274 transitions. Second operand 88 states.