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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/n.c24.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0883e75 [2019-09-05 11:29:29,021 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-05 11:29:29,023 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-05 11:29:29,035 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-05 11:29:29,036 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-05 11:29:29,037 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-05 11:29:29,038 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-05 11:29:29,040 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-05 11:29:29,042 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-05 11:29:29,043 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-05 11:29:29,044 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-05 11:29:29,045 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-05 11:29:29,046 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-05 11:29:29,047 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-05 11:29:29,048 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-05 11:29:29,049 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-05 11:29:29,050 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-05 11:29:29,051 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-05 11:29:29,053 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-05 11:29:29,055 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-05 11:29:29,056 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-05 11:29:29,058 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-05 11:29:29,059 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-05 11:29:29,059 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-05 11:29:29,062 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-05 11:29:29,062 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-05 11:29:29,062 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-05 11:29:29,063 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-05 11:29:29,064 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-05 11:29:29,065 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-05 11:29:29,065 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-05 11:29:29,066 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-05 11:29:29,067 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-05 11:29:29,067 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-05 11:29:29,068 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-05 11:29:29,069 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-05 11:29:29,069 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-05 11:29:29,070 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-05 11:29:29,070 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-05 11:29:29,071 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-05 11:29:29,071 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-05 11:29:29,072 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-05 11:29:29,087 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-05 11:29:29,087 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-05 11:29:29,089 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-05 11:29:29,089 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-05 11:29:29,089 INFO L138 SettingsManager]: * Use SBE=true [2019-09-05 11:29:29,089 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-05 11:29:29,089 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-05 11:29:29,090 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-05 11:29:29,090 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-05 11:29:29,090 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-05 11:29:29,090 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-05 11:29:29,090 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-05 11:29:29,091 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-05 11:29:29,091 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-05 11:29:29,091 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-05 11:29:29,091 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-05 11:29:29,091 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-05 11:29:29,092 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-05 11:29:29,092 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-05 11:29:29,092 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-05 11:29:29,092 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-05 11:29:29,092 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 11:29:29,093 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-05 11:29:29,093 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-05 11:29:29,093 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-05 11:29:29,093 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-05 11:29:29,093 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-05 11:29:29,094 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-05 11:29:29,094 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-05 11:29:29,122 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-05 11:29:29,135 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-05 11:29:29,139 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-05 11:29:29,140 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-05 11:29:29,141 INFO L275 PluginConnector]: CDTParser initialized [2019-09-05 11:29:29,141 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/n.c24.i [2019-09-05 11:29:29,197 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed2ef4133/7bbb4c719973428e8d40f545da994bd0/FLAGfe7b5490f [2019-09-05 11:29:29,660 INFO L306 CDTParser]: Found 1 translation units. [2019-09-05 11:29:29,660 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/n.c24.i [2019-09-05 11:29:29,674 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed2ef4133/7bbb4c719973428e8d40f545da994bd0/FLAGfe7b5490f [2019-09-05 11:29:30,038 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed2ef4133/7bbb4c719973428e8d40f545da994bd0 [2019-09-05 11:29:30,050 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-05 11:29:30,051 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-05 11:29:30,063 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-05 11:29:30,064 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-05 11:29:30,067 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-05 11:29:30,068 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 11:29:30" (1/1) ... [2019-09-05 11:29:30,071 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@630c9713 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:30, skipping insertion in model container [2019-09-05 11:29:30,071 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 11:29:30" (1/1) ... [2019-09-05 11:29:30,079 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-05 11:29:30,114 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-05 11:29:30,381 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 11:29:30,481 INFO L188 MainTranslator]: Completed pre-run [2019-09-05 11:29:30,534 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 11:29:30,563 INFO L192 MainTranslator]: Completed translation [2019-09-05 11:29:30,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:30 WrapperNode [2019-09-05 11:29:30,564 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-05 11:29:30,564 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-05 11:29:30,565 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-05 11:29:30,565 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-05 11:29:30,577 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:30" (1/1) ... [2019-09-05 11:29:30,577 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:30" (1/1) ... [2019-09-05 11:29:30,588 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:30" (1/1) ... [2019-09-05 11:29:30,588 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:30" (1/1) ... [2019-09-05 11:29:30,602 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:30" (1/1) ... [2019-09-05 11:29:30,609 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:30" (1/1) ... [2019-09-05 11:29:30,612 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:30" (1/1) ... [2019-09-05 11:29:30,616 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-05 11:29:30,617 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-05 11:29:30,617 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-05 11:29:30,617 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-05 11:29:30,618 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:30" (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-05 11:29:30,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-05 11:29:30,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-05 11:29:30,669 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-05 11:29:30,669 INFO L138 BoogieDeclarations]: Found implementation of procedure bar [2019-09-05 11:29:30,669 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2019-09-05 11:29:30,670 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-05 11:29:30,670 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove [2019-09-05 11:29:30,670 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-05 11:29:30,670 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-05 11:29:30,670 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-05 11:29:30,670 INFO L130 BoogieDeclarations]: Found specification of procedure memmove [2019-09-05 11:29:30,671 INFO L130 BoogieDeclarations]: Found specification of procedure memccpy [2019-09-05 11:29:30,671 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-09-05 11:29:30,671 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2019-09-05 11:29:30,671 INFO L130 BoogieDeclarations]: Found specification of procedure memchr [2019-09-05 11:29:30,671 INFO L130 BoogieDeclarations]: Found specification of procedure strcpy [2019-09-05 11:29:30,672 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2019-09-05 11:29:30,672 INFO L130 BoogieDeclarations]: Found specification of procedure strcat [2019-09-05 11:29:30,672 INFO L130 BoogieDeclarations]: Found specification of procedure strncat [2019-09-05 11:29:30,672 INFO L130 BoogieDeclarations]: Found specification of procedure strcmp [2019-09-05 11:29:30,672 INFO L130 BoogieDeclarations]: Found specification of procedure strncmp [2019-09-05 11:29:30,672 INFO L130 BoogieDeclarations]: Found specification of procedure strcoll [2019-09-05 11:29:30,672 INFO L130 BoogieDeclarations]: Found specification of procedure strxfrm [2019-09-05 11:29:30,673 INFO L130 BoogieDeclarations]: Found specification of procedure strcoll_l [2019-09-05 11:29:30,673 INFO L130 BoogieDeclarations]: Found specification of procedure strxfrm_l [2019-09-05 11:29:30,673 INFO L130 BoogieDeclarations]: Found specification of procedure strdup [2019-09-05 11:29:30,673 INFO L130 BoogieDeclarations]: Found specification of procedure strndup [2019-09-05 11:29:30,673 INFO L130 BoogieDeclarations]: Found specification of procedure strchr [2019-09-05 11:29:30,674 INFO L130 BoogieDeclarations]: Found specification of procedure strrchr [2019-09-05 11:29:30,674 INFO L130 BoogieDeclarations]: Found specification of procedure strcspn [2019-09-05 11:29:30,674 INFO L130 BoogieDeclarations]: Found specification of procedure strspn [2019-09-05 11:29:30,674 INFO L130 BoogieDeclarations]: Found specification of procedure strpbrk [2019-09-05 11:29:30,674 INFO L130 BoogieDeclarations]: Found specification of procedure strstr [2019-09-05 11:29:30,674 INFO L130 BoogieDeclarations]: Found specification of procedure strtok [2019-09-05 11:29:30,674 INFO L130 BoogieDeclarations]: Found specification of procedure __strtok_r [2019-09-05 11:29:30,675 INFO L130 BoogieDeclarations]: Found specification of procedure strtok_r [2019-09-05 11:29:30,675 INFO L130 BoogieDeclarations]: Found specification of procedure strlen [2019-09-05 11:29:30,675 INFO L130 BoogieDeclarations]: Found specification of procedure strnlen [2019-09-05 11:29:30,675 INFO L130 BoogieDeclarations]: Found specification of procedure strerror [2019-09-05 11:29:30,675 INFO L130 BoogieDeclarations]: Found specification of procedure strerror_r [2019-09-05 11:29:30,675 INFO L130 BoogieDeclarations]: Found specification of procedure strerror_l [2019-09-05 11:29:30,676 INFO L130 BoogieDeclarations]: Found specification of procedure __bzero [2019-09-05 11:29:30,676 INFO L130 BoogieDeclarations]: Found specification of procedure bcopy [2019-09-05 11:29:30,676 INFO L130 BoogieDeclarations]: Found specification of procedure bzero [2019-09-05 11:29:30,676 INFO L130 BoogieDeclarations]: Found specification of procedure bcmp [2019-09-05 11:29:30,676 INFO L130 BoogieDeclarations]: Found specification of procedure index [2019-09-05 11:29:30,676 INFO L130 BoogieDeclarations]: Found specification of procedure rindex [2019-09-05 11:29:30,677 INFO L130 BoogieDeclarations]: Found specification of procedure ffs [2019-09-05 11:29:30,677 INFO L130 BoogieDeclarations]: Found specification of procedure strcasecmp [2019-09-05 11:29:30,677 INFO L130 BoogieDeclarations]: Found specification of procedure strncasecmp [2019-09-05 11:29:30,677 INFO L130 BoogieDeclarations]: Found specification of procedure strsep [2019-09-05 11:29:30,677 INFO L130 BoogieDeclarations]: Found specification of procedure strsignal [2019-09-05 11:29:30,677 INFO L130 BoogieDeclarations]: Found specification of procedure __stpcpy [2019-09-05 11:29:30,677 INFO L130 BoogieDeclarations]: Found specification of procedure stpcpy [2019-09-05 11:29:30,678 INFO L130 BoogieDeclarations]: Found specification of procedure __stpncpy [2019-09-05 11:29:30,678 INFO L130 BoogieDeclarations]: Found specification of procedure stpncpy [2019-09-05 11:29:30,678 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-05 11:29:30,678 INFO L130 BoogieDeclarations]: Found specification of procedure bar [2019-09-05 11:29:30,678 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2019-09-05 11:29:30,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-05 11:29:30,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-05 11:29:30,679 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-05 11:29:30,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-05 11:29:30,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove [2019-09-05 11:29:30,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-05 11:29:30,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-05 11:29:30,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-05 11:29:30,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-05 11:29:30,680 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-05 11:29:31,174 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-05 11:29:31,174 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-05 11:29:31,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 11:29:31 BoogieIcfgContainer [2019-09-05 11:29:31,176 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-05 11:29:31,177 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-05 11:29:31,177 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-05 11:29:31,181 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-05 11:29:31,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.09 11:29:30" (1/3) ... [2019-09-05 11:29:31,182 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40cfcc48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 11:29:31, skipping insertion in model container [2019-09-05 11:29:31,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:30" (2/3) ... [2019-09-05 11:29:31,183 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40cfcc48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 11:29:31, skipping insertion in model container [2019-09-05 11:29:31,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 11:29:31" (3/3) ... [2019-09-05 11:29:31,187 INFO L109 eAbstractionObserver]: Analyzing ICFG n.c24.i [2019-09-05 11:29:31,195 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-05 11:29:31,203 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-05 11:29:31,221 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-05 11:29:31,253 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-05 11:29:31,253 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-05 11:29:31,254 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-05 11:29:31,254 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-05 11:29:31,254 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-05 11:29:31,254 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-05 11:29:31,254 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-05 11:29:31,255 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-05 11:29:31,255 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-05 11:29:31,273 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2019-09-05 11:29:31,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-05 11:29:31,280 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:31,281 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:31,283 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:31,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:31,289 INFO L82 PathProgramCache]: Analyzing trace with hash -581213385, now seen corresponding path program 1 times [2019-09-05 11:29:31,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:31,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:31,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:31,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:31,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:31,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:31,450 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-05 11:29:31,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:29:31,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-05 11:29:31,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 11:29:31,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 11:29:31,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 11:29:31,475 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 3 states. [2019-09-05 11:29:31,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:31,559 INFO L93 Difference]: Finished difference Result 123 states and 177 transitions. [2019-09-05 11:29:31,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 11:29:31,561 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-09-05 11:29:31,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:31,573 INFO L225 Difference]: With dead ends: 123 [2019-09-05 11:29:31,573 INFO L226 Difference]: Without dead ends: 69 [2019-09-05 11:29:31,577 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-05 11:29:31,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-05 11:29:31,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 48. [2019-09-05 11:29:31,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-05 11:29:31,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2019-09-05 11:29:31,637 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 13 [2019-09-05 11:29:31,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:31,637 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2019-09-05 11:29:31,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 11:29:31,638 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2019-09-05 11:29:31,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-05 11:29:31,640 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:31,640 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] [2019-09-05 11:29:31,641 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:31,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:31,642 INFO L82 PathProgramCache]: Analyzing trace with hash -351648040, now seen corresponding path program 1 times [2019-09-05 11:29:31,642 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:31,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:31,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:31,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:31,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:31,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:31,775 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 11:29:31,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:31,775 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:29:31,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:31,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:31,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-05 11:29:31,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:31,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 11:29:31,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:31,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-05 11:29:31,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 11:29:31,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 11:29:31,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:29:31,869 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand 5 states. [2019-09-05 11:29:31,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:31,995 INFO L93 Difference]: Finished difference Result 131 states and 172 transitions. [2019-09-05 11:29:31,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 11:29:31,996 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-09-05 11:29:31,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:31,998 INFO L225 Difference]: With dead ends: 131 [2019-09-05 11:29:31,998 INFO L226 Difference]: Without dead ends: 92 [2019-09-05 11:29:31,999 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:29:32,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-09-05 11:29:32,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 71. [2019-09-05 11:29:32,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-09-05 11:29:32,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 91 transitions. [2019-09-05 11:29:32,021 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 91 transitions. Word has length 20 [2019-09-05 11:29:32,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:32,022 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 91 transitions. [2019-09-05 11:29:32,022 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 11:29:32,022 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 91 transitions. [2019-09-05 11:29:32,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-05 11:29:32,025 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:32,025 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:32,027 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:32,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:32,027 INFO L82 PathProgramCache]: Analyzing trace with hash 613250579, now seen corresponding path program 2 times [2019-09-05 11:29:32,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:32,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:32,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:32,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:32,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:32,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:32,112 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-05 11:29:32,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:32,113 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:29:32,139 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:32,186 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:29:32,187 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:29:32,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-05 11:29:32,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:32,223 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-05 11:29:32,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-05 11:29:32,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-09-05 11:29:32,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-05 11:29:32,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-05 11:29:32,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-05 11:29:32,229 INFO L87 Difference]: Start difference. First operand 71 states and 91 transitions. Second operand 8 states. [2019-09-05 11:29:32,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:32,572 INFO L93 Difference]: Finished difference Result 259 states and 362 transitions. [2019-09-05 11:29:32,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-05 11:29:32,572 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-09-05 11:29:32,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:32,575 INFO L225 Difference]: With dead ends: 259 [2019-09-05 11:29:32,576 INFO L226 Difference]: Without dead ends: 196 [2019-09-05 11:29:32,577 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-09-05 11:29:32,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-09-05 11:29:32,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 95. [2019-09-05 11:29:32,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-09-05 11:29:32,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 126 transitions. [2019-09-05 11:29:32,596 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 126 transitions. Word has length 27 [2019-09-05 11:29:32,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:32,597 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 126 transitions. [2019-09-05 11:29:32,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-05 11:29:32,597 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 126 transitions. [2019-09-05 11:29:32,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-05 11:29:32,599 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:32,600 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:32,600 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:32,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:32,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1884917406, now seen corresponding path program 1 times [2019-09-05 11:29:32,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:32,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:32,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:32,602 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:29:32,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:32,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:32,718 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-05 11:29:32,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:32,719 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:29:32,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:32,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:32,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-05 11:29:32,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:32,798 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-05 11:29:32,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:32,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-05 11:29:32,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-05 11:29:32,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-05 11:29:32,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-05 11:29:32,804 INFO L87 Difference]: Start difference. First operand 95 states and 126 transitions. Second operand 7 states. [2019-09-05 11:29:32,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:32,929 INFO L93 Difference]: Finished difference Result 228 states and 313 transitions. [2019-09-05 11:29:32,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 11:29:32,930 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2019-09-05 11:29:32,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:32,931 INFO L225 Difference]: With dead ends: 228 [2019-09-05 11:29:32,931 INFO L226 Difference]: Without dead ends: 146 [2019-09-05 11:29:32,933 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-05 11:29:32,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-09-05 11:29:32,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 118. [2019-09-05 11:29:32,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-09-05 11:29:32,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 159 transitions. [2019-09-05 11:29:32,969 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 159 transitions. Word has length 43 [2019-09-05 11:29:32,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:32,971 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 159 transitions. [2019-09-05 11:29:32,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-05 11:29:32,971 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 159 transitions. [2019-09-05 11:29:32,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-05 11:29:32,978 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:32,979 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:32,979 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:32,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:32,981 INFO L82 PathProgramCache]: Analyzing trace with hash 708097291, now seen corresponding path program 2 times [2019-09-05 11:29:32,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:32,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:32,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:32,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:32,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:33,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:33,128 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-05 11:29:33,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:33,128 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:33,148 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:29:33,184 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:29:33,184 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:29:33,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-05 11:29:33,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:33,202 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-05 11:29:33,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:33,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-05 11:29:33,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-05 11:29:33,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-05 11:29:33,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-05 11:29:33,212 INFO L87 Difference]: Start difference. First operand 118 states and 159 transitions. Second operand 8 states. [2019-09-05 11:29:33,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:33,397 INFO L93 Difference]: Finished difference Result 272 states and 377 transitions. [2019-09-05 11:29:33,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 11:29:33,398 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2019-09-05 11:29:33,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:33,400 INFO L225 Difference]: With dead ends: 272 [2019-09-05 11:29:33,400 INFO L226 Difference]: Without dead ends: 169 [2019-09-05 11:29:33,401 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-05 11:29:33,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-09-05 11:29:33,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 141. [2019-09-05 11:29:33,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-09-05 11:29:33,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 192 transitions. [2019-09-05 11:29:33,420 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 192 transitions. Word has length 50 [2019-09-05 11:29:33,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:33,421 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 192 transitions. [2019-09-05 11:29:33,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-05 11:29:33,421 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 192 transitions. [2019-09-05 11:29:33,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-05 11:29:33,424 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:33,425 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:33,425 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:33,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:33,425 INFO L82 PathProgramCache]: Analyzing trace with hash 633204730, now seen corresponding path program 3 times [2019-09-05 11:29:33,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:33,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:33,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:33,427 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:29:33,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:33,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:33,595 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-05 11:29:33,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:33,595 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:33,617 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:29:33,650 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-05 11:29:33,650 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:29:33,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-05 11:29:33,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:33,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:33,764 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-09-05 11:29:33,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:33,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2019-09-05 11:29:33,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-05 11:29:33,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-05 11:29:33,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2019-09-05 11:29:33,769 INFO L87 Difference]: Start difference. First operand 141 states and 192 transitions. Second operand 15 states. [2019-09-05 11:29:34,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:34,835 INFO L93 Difference]: Finished difference Result 593 states and 857 transitions. [2019-09-05 11:29:34,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-05 11:29:34,835 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 57 [2019-09-05 11:29:34,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:34,839 INFO L225 Difference]: With dead ends: 593 [2019-09-05 11:29:34,839 INFO L226 Difference]: Without dead ends: 466 [2019-09-05 11:29:34,841 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=465, Invalid=1257, Unknown=0, NotChecked=0, Total=1722 [2019-09-05 11:29:34,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2019-09-05 11:29:34,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 181. [2019-09-05 11:29:34,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-09-05 11:29:34,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 252 transitions. [2019-09-05 11:29:34,865 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 252 transitions. Word has length 57 [2019-09-05 11:29:34,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:34,865 INFO L475 AbstractCegarLoop]: Abstraction has 181 states and 252 transitions. [2019-09-05 11:29:34,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-05 11:29:34,866 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 252 transitions. [2019-09-05 11:29:34,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-05 11:29:34,869 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:34,869 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:34,869 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:34,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:34,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1421723573, now seen corresponding path program 4 times [2019-09-05 11:29:34,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:34,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:34,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:34,871 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:29:34,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:34,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:35,002 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-09-05 11:29:35,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:35,003 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:35,025 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:29:35,072 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:29:35,072 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:29:35,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-05 11:29:35,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:35,104 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-09-05 11:29:35,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:35,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-09-05 11:29:35,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-05 11:29:35,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-05 11:29:35,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-05 11:29:35,117 INFO L87 Difference]: Start difference. First operand 181 states and 252 transitions. Second operand 10 states. [2019-09-05 11:29:35,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:35,320 INFO L93 Difference]: Finished difference Result 428 states and 613 transitions. [2019-09-05 11:29:35,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-05 11:29:35,321 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 73 [2019-09-05 11:29:35,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:35,323 INFO L225 Difference]: With dead ends: 428 [2019-09-05 11:29:35,324 INFO L226 Difference]: Without dead ends: 266 [2019-09-05 11:29:35,325 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-05 11:29:35,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-09-05 11:29:35,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 204. [2019-09-05 11:29:35,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-09-05 11:29:35,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 285 transitions. [2019-09-05 11:29:35,340 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 285 transitions. Word has length 73 [2019-09-05 11:29:35,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:35,341 INFO L475 AbstractCegarLoop]: Abstraction has 204 states and 285 transitions. [2019-09-05 11:29:35,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-05 11:29:35,341 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 285 transitions. [2019-09-05 11:29:35,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-05 11:29:35,343 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:35,343 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:35,343 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:35,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:35,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1891487876, now seen corresponding path program 5 times [2019-09-05 11:29:35,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:35,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:35,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:35,345 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:29:35,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:35,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:35,439 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-09-05 11:29:35,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:35,440 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:35,453 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 11:29:35,552 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-09-05 11:29:35,553 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:29:35,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-05 11:29:35,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:35,603 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-09-05 11:29:35,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:35,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-09-05 11:29:35,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-05 11:29:35,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-05 11:29:35,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-05 11:29:35,611 INFO L87 Difference]: Start difference. First operand 204 states and 285 transitions. Second operand 11 states. [2019-09-05 11:29:35,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:35,817 INFO L93 Difference]: Finished difference Result 472 states and 677 transitions. [2019-09-05 11:29:35,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-05 11:29:35,817 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 80 [2019-09-05 11:29:35,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:35,819 INFO L225 Difference]: With dead ends: 472 [2019-09-05 11:29:35,820 INFO L226 Difference]: Without dead ends: 289 [2019-09-05 11:29:35,820 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-05 11:29:35,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-09-05 11:29:35,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 227. [2019-09-05 11:29:35,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-09-05 11:29:35,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 318 transitions. [2019-09-05 11:29:35,839 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 318 transitions. Word has length 80 [2019-09-05 11:29:35,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:35,839 INFO L475 AbstractCegarLoop]: Abstraction has 227 states and 318 transitions. [2019-09-05 11:29:35,839 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-05 11:29:35,839 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 318 transitions. [2019-09-05 11:29:35,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-05 11:29:35,841 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:35,841 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:35,841 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:35,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:35,842 INFO L82 PathProgramCache]: Analyzing trace with hash 150079527, now seen corresponding path program 6 times [2019-09-05 11:29:35,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:35,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:35,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:35,843 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:29:35,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:35,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:35,945 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2019-09-05 11:29:35,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:35,945 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:29:35,964 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:36,019 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-05 11:29:36,019 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:29:36,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-05 11:29:36,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:36,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:36,142 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 14 proven. 30 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2019-09-05 11:29:36,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:36,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2019-09-05 11:29:36,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-05 11:29:36,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-05 11:29:36,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2019-09-05 11:29:36,155 INFO L87 Difference]: Start difference. First operand 227 states and 318 transitions. Second operand 19 states. [2019-09-05 11:29:38,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:38,378 INFO L93 Difference]: Finished difference Result 1063 states and 1557 transitions. [2019-09-05 11:29:38,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-05 11:29:38,379 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 87 [2019-09-05 11:29:38,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:38,385 INFO L225 Difference]: With dead ends: 1063 [2019-09-05 11:29:38,385 INFO L226 Difference]: Without dead ends: 856 [2019-09-05 11:29:38,388 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1247 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1267, Invalid=3289, Unknown=0, NotChecked=0, Total=4556 [2019-09-05 11:29:38,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2019-09-05 11:29:38,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 267. [2019-09-05 11:29:38,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-09-05 11:29:38,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 378 transitions. [2019-09-05 11:29:38,419 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 378 transitions. Word has length 87 [2019-09-05 11:29:38,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:38,420 INFO L475 AbstractCegarLoop]: Abstraction has 267 states and 378 transitions. [2019-09-05 11:29:38,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-05 11:29:38,420 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 378 transitions. [2019-09-05 11:29:38,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-05 11:29:38,422 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:38,422 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:38,422 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:38,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:38,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1871912078, now seen corresponding path program 7 times [2019-09-05 11:29:38,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:38,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:38,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:38,424 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:29:38,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:38,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:38,532 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2019-09-05 11:29:38,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:38,533 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:29:38,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:38,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:38,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-05 11:29:38,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:38,648 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2019-09-05 11:29:38,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:38,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-09-05 11:29:38,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-05 11:29:38,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-05 11:29:38,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-05 11:29:38,655 INFO L87 Difference]: Start difference. First operand 267 states and 378 transitions. Second operand 13 states. [2019-09-05 11:29:38,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:38,891 INFO L93 Difference]: Finished difference Result 628 states and 913 transitions. [2019-09-05 11:29:38,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-05 11:29:38,892 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 103 [2019-09-05 11:29:38,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:38,895 INFO L225 Difference]: With dead ends: 628 [2019-09-05 11:29:38,895 INFO L226 Difference]: Without dead ends: 386 [2019-09-05 11:29:38,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-05 11:29:38,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-09-05 11:29:38,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 290. [2019-09-05 11:29:38,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2019-09-05 11:29:38,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 411 transitions. [2019-09-05 11:29:38,921 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 411 transitions. Word has length 103 [2019-09-05 11:29:38,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:38,921 INFO L475 AbstractCegarLoop]: Abstraction has 290 states and 411 transitions. [2019-09-05 11:29:38,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-05 11:29:38,922 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 411 transitions. [2019-09-05 11:29:38,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-05 11:29:38,923 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:38,924 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:38,924 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:38,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:38,924 INFO L82 PathProgramCache]: Analyzing trace with hash -2027103113, now seen corresponding path program 8 times [2019-09-05 11:29:38,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:38,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:38,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:38,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:38,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:38,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:39,112 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2019-09-05 11:29:39,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:39,113 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:29:39,133 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:39,208 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:29:39,208 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:29:39,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-05 11:29:39,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:39,255 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2019-09-05 11:29:39,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:39,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-09-05 11:29:39,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-05 11:29:39,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-05 11:29:39,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-05 11:29:39,262 INFO L87 Difference]: Start difference. First operand 290 states and 411 transitions. Second operand 14 states. [2019-09-05 11:29:39,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:39,530 INFO L93 Difference]: Finished difference Result 672 states and 977 transitions. [2019-09-05 11:29:39,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-05 11:29:39,531 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 110 [2019-09-05 11:29:39,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:39,534 INFO L225 Difference]: With dead ends: 672 [2019-09-05 11:29:39,534 INFO L226 Difference]: Without dead ends: 409 [2019-09-05 11:29:39,536 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-05 11:29:39,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2019-09-05 11:29:39,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 313. [2019-09-05 11:29:39,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-09-05 11:29:39,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 444 transitions. [2019-09-05 11:29:39,569 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 444 transitions. Word has length 110 [2019-09-05 11:29:39,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:39,571 INFO L475 AbstractCegarLoop]: Abstraction has 313 states and 444 transitions. [2019-09-05 11:29:39,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-05 11:29:39,571 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 444 transitions. [2019-09-05 11:29:39,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-05 11:29:39,573 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:39,573 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:39,574 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:39,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:39,574 INFO L82 PathProgramCache]: Analyzing trace with hash -615956018, now seen corresponding path program 9 times [2019-09-05 11:29:39,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:39,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:39,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:39,575 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:29:39,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:39,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:39,761 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2019-09-05 11:29:39,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:39,762 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:29:39,784 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:39,831 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-05 11:29:39,832 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:29:39,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-05 11:29:39,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:39,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:39,983 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 30 proven. 52 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (12)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 11:29:39,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:39,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2019-09-05 11:29:39,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-05 11:29:39,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-05 11:29:39,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2019-09-05 11:29:39,990 INFO L87 Difference]: Start difference. First operand 313 states and 444 transitions. Second operand 23 states. [2019-09-05 11:29:43,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:43,902 INFO L93 Difference]: Finished difference Result 1653 states and 2437 transitions. [2019-09-05 11:29:43,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-09-05 11:29:43,903 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 117 [2019-09-05 11:29:43,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:43,912 INFO L225 Difference]: With dead ends: 1653 [2019-09-05 11:29:43,912 INFO L226 Difference]: Without dead ends: 1366 [2019-09-05 11:29:43,917 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3119 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2771, Invalid=7129, Unknown=0, NotChecked=0, Total=9900 [2019-09-05 11:29:43,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states. [2019-09-05 11:29:43,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 353. [2019-09-05 11:29:43,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-09-05 11:29:43,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 504 transitions. [2019-09-05 11:29:43,964 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 504 transitions. Word has length 117 [2019-09-05 11:29:43,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:43,965 INFO L475 AbstractCegarLoop]: Abstraction has 353 states and 504 transitions. [2019-09-05 11:29:43,965 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-05 11:29:43,965 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 504 transitions. [2019-09-05 11:29:43,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-05 11:29:43,970 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:43,970 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:43,970 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:43,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:43,971 INFO L82 PathProgramCache]: Analyzing trace with hash -780097697, now seen corresponding path program 10 times [2019-09-05 11:29:43,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:43,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:43,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:43,973 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:29:43,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:43,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:44,185 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2019-09-05 11:29:44,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:44,186 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:44,196 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:29:44,261 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:29:44,262 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:29:44,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-05 11:29:44,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:44,286 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2019-09-05 11:29:44,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:44,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-09-05 11:29:44,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-05 11:29:44,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-05 11:29:44,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-05 11:29:44,292 INFO L87 Difference]: Start difference. First operand 353 states and 504 transitions. Second operand 16 states. [2019-09-05 11:29:44,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:44,694 INFO L93 Difference]: Finished difference Result 828 states and 1213 transitions. [2019-09-05 11:29:44,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-05 11:29:44,694 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 133 [2019-09-05 11:29:44,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:44,699 INFO L225 Difference]: With dead ends: 828 [2019-09-05 11:29:44,699 INFO L226 Difference]: Without dead ends: 506 [2019-09-05 11:29:44,701 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-05 11:29:44,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2019-09-05 11:29:44,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 376. [2019-09-05 11:29:44,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2019-09-05 11:29:44,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 537 transitions. [2019-09-05 11:29:44,730 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 537 transitions. Word has length 133 [2019-09-05 11:29:44,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:44,730 INFO L475 AbstractCegarLoop]: Abstraction has 376 states and 537 transitions. [2019-09-05 11:29:44,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-05 11:29:44,730 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 537 transitions. [2019-09-05 11:29:44,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-05 11:29:44,733 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:44,733 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:44,733 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:44,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:44,734 INFO L82 PathProgramCache]: Analyzing trace with hash 994619440, now seen corresponding path program 11 times [2019-09-05 11:29:44,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:44,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:44,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:44,735 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:29:44,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:44,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:44,922 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 509 trivial. 0 not checked. [2019-09-05 11:29:44,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:44,923 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:29:44,947 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:45,101 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2019-09-05 11:29:45,101 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:29:45,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-05 11:29:45,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:45,166 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 0 proven. 451 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2019-09-05 11:29:45,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:45,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-09-05 11:29:45,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-05 11:29:45,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-05 11:29:45,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-05 11:29:45,172 INFO L87 Difference]: Start difference. First operand 376 states and 537 transitions. Second operand 17 states. [2019-09-05 11:29:45,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:45,509 INFO L93 Difference]: Finished difference Result 872 states and 1277 transitions. [2019-09-05 11:29:45,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-05 11:29:45,510 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 140 [2019-09-05 11:29:45,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:45,514 INFO L225 Difference]: With dead ends: 872 [2019-09-05 11:29:45,514 INFO L226 Difference]: Without dead ends: 529 [2019-09-05 11:29:45,516 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-05 11:29:45,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2019-09-05 11:29:45,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 399. [2019-09-05 11:29:45,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-09-05 11:29:45,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 570 transitions. [2019-09-05 11:29:45,547 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 570 transitions. Word has length 140 [2019-09-05 11:29:45,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:45,548 INFO L475 AbstractCegarLoop]: Abstraction has 399 states and 570 transitions. [2019-09-05 11:29:45,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-05 11:29:45,548 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 570 transitions. [2019-09-05 11:29:45,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-05 11:29:45,551 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:45,551 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:45,551 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:45,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:45,551 INFO L82 PathProgramCache]: Analyzing trace with hash -885869509, now seen corresponding path program 12 times [2019-09-05 11:29:45,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:45,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:45,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:45,553 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:29:45,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:45,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:45,723 INFO L134 CoverageAnalysis]: Checked inductivity of 775 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2019-09-05 11:29:45,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:45,723 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:45,736 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 11:29:45,870 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2019-09-05 11:29:45,870 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:29:45,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-05 11:29:45,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:46,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:46,072 INFO L134 CoverageAnalysis]: Checked inductivity of 775 backedges. 52 proven. 80 refuted. 0 times theorem prover too weak. 643 trivial. 0 not checked. [2019-09-05 11:29:46,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:46,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 27 [2019-09-05 11:29:46,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-05 11:29:46,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-05 11:29:46,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=527, Unknown=0, NotChecked=0, Total=702 [2019-09-05 11:29:46,077 INFO L87 Difference]: Start difference. First operand 399 states and 570 transitions. Second operand 27 states. [2019-09-05 11:29:52,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:52,426 INFO L93 Difference]: Finished difference Result 2363 states and 3497 transitions. [2019-09-05 11:29:52,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-09-05 11:29:52,427 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 147 [2019-09-05 11:29:52,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:52,438 INFO L225 Difference]: With dead ends: 2363 [2019-09-05 11:29:52,438 INFO L226 Difference]: Without dead ends: 1996 [2019-09-05 11:29:52,450 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6608 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5283, Invalid=13623, Unknown=0, NotChecked=0, Total=18906 [2019-09-05 11:29:52,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1996 states. [2019-09-05 11:29:52,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1996 to 439. [2019-09-05 11:29:52,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2019-09-05 11:29:52,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 630 transitions. [2019-09-05 11:29:52,513 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 630 transitions. Word has length 147 [2019-09-05 11:29:52,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:52,515 INFO L475 AbstractCegarLoop]: Abstraction has 439 states and 630 transitions. [2019-09-05 11:29:52,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-05 11:29:52,515 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 630 transitions. [2019-09-05 11:29:52,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-05 11:29:52,518 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:52,518 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:52,519 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:52,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:52,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1611539014, now seen corresponding path program 13 times [2019-09-05 11:29:52,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:52,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:52,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:52,520 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:29:52,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:52,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:52,813 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 705 trivial. 0 not checked. [2019-09-05 11:29:52,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:52,814 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:29:52,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:52,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:52,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-05 11:29:52,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:53,013 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 705 trivial. 0 not checked. [2019-09-05 11:29:53,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:53,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-09-05 11:29:53,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-05 11:29:53,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-05 11:29:53,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-05 11:29:53,018 INFO L87 Difference]: Start difference. First operand 439 states and 630 transitions. Second operand 19 states. [2019-09-05 11:29:53,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:53,464 INFO L93 Difference]: Finished difference Result 1028 states and 1513 transitions. [2019-09-05 11:29:53,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-05 11:29:53,465 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 163 [2019-09-05 11:29:53,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:53,468 INFO L225 Difference]: With dead ends: 1028 [2019-09-05 11:29:53,468 INFO L226 Difference]: Without dead ends: 626 [2019-09-05 11:29:53,469 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-05 11:29:53,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-09-05 11:29:53,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 462. [2019-09-05 11:29:53,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2019-09-05 11:29:53,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 663 transitions. [2019-09-05 11:29:53,512 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 663 transitions. Word has length 163 [2019-09-05 11:29:53,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:53,513 INFO L475 AbstractCegarLoop]: Abstraction has 462 states and 663 transitions. [2019-09-05 11:29:53,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-05 11:29:53,513 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 663 transitions. [2019-09-05 11:29:53,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-05 11:29:53,516 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:53,516 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:53,516 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:53,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:53,516 INFO L82 PathProgramCache]: Analyzing trace with hash -323900957, now seen corresponding path program 14 times [2019-09-05 11:29:53,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:53,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:53,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:53,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:53,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:53,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:53,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1042 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2019-09-05 11:29:53,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:53,730 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:53,739 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:29:53,820 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:29:53,820 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:29:53,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-05 11:29:53,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:53,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1042 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (17)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 11:29:53,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:53,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-09-05 11:29:53,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-05 11:29:53,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-05 11:29:53,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-05 11:29:53,868 INFO L87 Difference]: Start difference. First operand 462 states and 663 transitions. Second operand 20 states. [2019-09-05 11:29:54,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:54,234 INFO L93 Difference]: Finished difference Result 1072 states and 1577 transitions. [2019-09-05 11:29:54,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-05 11:29:54,235 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 170 [2019-09-05 11:29:54,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:54,240 INFO L225 Difference]: With dead ends: 1072 [2019-09-05 11:29:54,240 INFO L226 Difference]: Without dead ends: 649 [2019-09-05 11:29:54,242 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-05 11:29:54,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2019-09-05 11:29:54,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 485. [2019-09-05 11:29:54,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2019-09-05 11:29:54,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 696 transitions. [2019-09-05 11:29:54,289 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 696 transitions. Word has length 170 [2019-09-05 11:29:54,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:54,290 INFO L475 AbstractCegarLoop]: Abstraction has 485 states and 696 transitions. [2019-09-05 11:29:54,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-05 11:29:54,290 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 696 transitions. [2019-09-05 11:29:54,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-05 11:29:54,293 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:54,293 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:54,293 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:54,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:54,293 INFO L82 PathProgramCache]: Analyzing trace with hash 956759458, now seen corresponding path program 15 times [2019-09-05 11:29:54,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:54,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:54,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:54,294 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:29:54,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:54,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:54,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1161 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 872 trivial. 0 not checked. [2019-09-05 11:29:54,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:54,538 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:54,549 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:29:54,638 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-09-05 11:29:54,639 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:29:54,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-05 11:29:54,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:54,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:54,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1161 backedges. 80 proven. 114 refuted. 0 times theorem prover too weak. 967 trivial. 0 not checked. [2019-09-05 11:29:54,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:54,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 13] total 31 [2019-09-05 11:29:54,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-05 11:29:54,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-05 11:29:54,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=692, Unknown=0, NotChecked=0, Total=930 [2019-09-05 11:29:54,840 INFO L87 Difference]: Start difference. First operand 485 states and 696 transitions. Second operand 31 states. [2019-09-05 11:30:04,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:30:04,306 INFO L93 Difference]: Finished difference Result 3193 states and 4737 transitions. [2019-09-05 11:30:04,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2019-09-05 11:30:04,306 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 177 [2019-09-05 11:30:04,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:30:04,320 INFO L225 Difference]: With dead ends: 3193 [2019-09-05 11:30:04,320 INFO L226 Difference]: Without dead ends: 2746 [2019-09-05 11:30:04,330 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12576 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=9163, Invalid=23779, Unknown=0, NotChecked=0, Total=32942 [2019-09-05 11:30:04,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2746 states. [2019-09-05 11:30:04,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2746 to 525. [2019-09-05 11:30:04,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525 states. [2019-09-05 11:30:04,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 756 transitions. [2019-09-05 11:30:04,407 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 756 transitions. Word has length 177 [2019-09-05 11:30:04,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:30:04,407 INFO L475 AbstractCegarLoop]: Abstraction has 525 states and 756 transitions. [2019-09-05 11:30:04,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-05 11:30:04,407 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 756 transitions. [2019-09-05 11:30:04,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-05 11:30:04,411 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:30:04,411 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:30:04,411 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:30:04,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:30:04,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1706143859, now seen corresponding path program 16 times [2019-09-05 11:30:04,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:30:04,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:30:04,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:30:04,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:30:04,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:30:04,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:30:04,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1350 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 1026 trivial. 0 not checked. [2019-09-05 11:30:04,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:30:04,689 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:30:04,706 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:30:04,802 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:30:04,803 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:30:04,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 644 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-05 11:30:04,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:30:04,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1350 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 1026 trivial. 0 not checked. [2019-09-05 11:30:04,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:30:04,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-09-05 11:30:04,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-05 11:30:04,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-05 11:30:04,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-05 11:30:04,840 INFO L87 Difference]: Start difference. First operand 525 states and 756 transitions. Second operand 22 states. [2019-09-05 11:30:05,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:30:05,362 INFO L93 Difference]: Finished difference Result 1228 states and 1813 transitions. [2019-09-05 11:30:05,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-05 11:30:05,362 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 193 [2019-09-05 11:30:05,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:30:05,366 INFO L225 Difference]: With dead ends: 1228 [2019-09-05 11:30:05,366 INFO L226 Difference]: Without dead ends: 746 [2019-09-05 11:30:05,368 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-05 11:30:05,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2019-09-05 11:30:05,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 548. [2019-09-05 11:30:05,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2019-09-05 11:30:05,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 789 transitions. [2019-09-05 11:30:05,431 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 789 transitions. Word has length 193 [2019-09-05 11:30:05,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:30:05,431 INFO L475 AbstractCegarLoop]: Abstraction has 548 states and 789 transitions. [2019-09-05 11:30:05,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-05 11:30:05,431 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 789 transitions. [2019-09-05 11:30:05,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-09-05 11:30:05,435 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:30:05,435 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:30:05,436 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:30:05,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:30:05,436 INFO L82 PathProgramCache]: Analyzing trace with hash -2130450980, now seen corresponding path program 17 times [2019-09-05 11:30:05,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:30:05,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:30:05,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:30:05,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:30:05,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:30:05,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:30:05,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1484 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 1123 trivial. 0 not checked. [2019-09-05 11:30:05,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:30:05,717 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:30:05,745 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:30:06,226 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2019-09-05 11:30:06,226 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:30:06,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 667 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-05 11:30:06,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:30:06,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1484 backedges. 0 proven. 982 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2019-09-05 11:30:06,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:30:06,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-09-05 11:30:06,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-05 11:30:06,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-05 11:30:06,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-05 11:30:06,272 INFO L87 Difference]: Start difference. First operand 548 states and 789 transitions. Second operand 23 states. [2019-09-05 11:30:06,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:30:06,860 INFO L93 Difference]: Finished difference Result 1272 states and 1877 transitions. [2019-09-05 11:30:06,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-05 11:30:06,860 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 200 [2019-09-05 11:30:06,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:30:06,865 INFO L225 Difference]: With dead ends: 1272 [2019-09-05 11:30:06,865 INFO L226 Difference]: Without dead ends: 769 [2019-09-05 11:30:06,867 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-05 11:30:06,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2019-09-05 11:30:06,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 571. [2019-09-05 11:30:06,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-09-05 11:30:06,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 822 transitions. [2019-09-05 11:30:06,933 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 822 transitions. Word has length 200 [2019-09-05 11:30:06,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:30:06,933 INFO L475 AbstractCegarLoop]: Abstraction has 571 states and 822 transitions. [2019-09-05 11:30:06,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-05 11:30:06,933 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 822 transitions. [2019-09-05 11:30:06,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-09-05 11:30:06,937 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:30:06,937 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:30:06,938 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:30:06,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:30:06,938 INFO L82 PathProgramCache]: Analyzing trace with hash 791312975, now seen corresponding path program 18 times [2019-09-05 11:30:06,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:30:06,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:30:06,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:30:06,939 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:30:06,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:30:06,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:30:07,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1625 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-09-05 11:30:07,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:30:07,227 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:30:07,239 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 11:30:07,591 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2019-09-05 11:30:07,592 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:30:07,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-05 11:30:07,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:30:07,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:30:07,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1625 backedges. 114 proven. 154 refuted. 0 times theorem prover too weak. 1357 trivial. 0 not checked. [2019-09-05 11:30:07,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:30:07,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 14] total 35 [2019-09-05 11:30:07,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-05 11:30:07,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-05 11:30:07,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=879, Unknown=0, NotChecked=0, Total=1190 [2019-09-05 11:30:07,978 INFO L87 Difference]: Start difference. First operand 571 states and 822 transitions. Second operand 35 states. [2019-09-05 11:30:22,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:30:22,014 INFO L93 Difference]: Finished difference Result 4143 states and 6157 transitions. [2019-09-05 11:30:22,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2019-09-05 11:30:22,015 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 207 [2019-09-05 11:30:22,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:30:22,028 INFO L225 Difference]: With dead ends: 4143 [2019-09-05 11:30:22,028 INFO L226 Difference]: Without dead ends: 3616 [2019-09-05 11:30:22,034 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21896 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=14825, Invalid=38767, Unknown=0, NotChecked=0, Total=53592 [2019-09-05 11:30:22,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3616 states. [2019-09-05 11:30:22,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3616 to 611. [2019-09-05 11:30:22,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-09-05 11:30:22,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 882 transitions. [2019-09-05 11:30:22,142 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 882 transitions. Word has length 207 [2019-09-05 11:30:22,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:30:22,143 INFO L475 AbstractCegarLoop]: Abstraction has 611 states and 882 transitions. [2019-09-05 11:30:22,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-05 11:30:22,143 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 882 transitions. [2019-09-05 11:30:22,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-09-05 11:30:22,147 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:30:22,147 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:30:22,147 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:30:22,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:30:22,148 INFO L82 PathProgramCache]: Analyzing trace with hash -347845862, now seen corresponding path program 19 times [2019-09-05 11:30:22,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:30:22,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:30:22,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:30:22,149 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:30:22,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:30:22,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:30:22,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1848 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 1407 trivial. 0 not checked. [2019-09-05 11:30:22,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:30:22,543 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:30:22,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:30:22,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:30:22,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 742 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-05 11:30:22,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:30:22,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1848 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 1407 trivial. 0 not checked. [2019-09-05 11:30:22,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:30:22,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-09-05 11:30:22,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-05 11:30:22,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-05 11:30:22,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-05 11:30:22,752 INFO L87 Difference]: Start difference. First operand 611 states and 882 transitions. Second operand 25 states. [2019-09-05 11:30:23,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:30:23,392 INFO L93 Difference]: Finished difference Result 1428 states and 2113 transitions. [2019-09-05 11:30:23,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-05 11:30:23,397 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 223 [2019-09-05 11:30:23,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:30:23,402 INFO L225 Difference]: With dead ends: 1428 [2019-09-05 11:30:23,402 INFO L226 Difference]: Without dead ends: 866 [2019-09-05 11:30:23,404 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-05 11:30:23,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2019-09-05 11:30:23,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 634. [2019-09-05 11:30:23,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2019-09-05 11:30:23,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 915 transitions. [2019-09-05 11:30:23,473 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 915 transitions. Word has length 223 [2019-09-05 11:30:23,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:30:23,474 INFO L475 AbstractCegarLoop]: Abstraction has 634 states and 915 transitions. [2019-09-05 11:30:23,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-05 11:30:23,474 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 915 transitions. [2019-09-05 11:30:23,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-05 11:30:23,477 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:30:23,477 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:30:23,477 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:30:23,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:30:23,478 INFO L82 PathProgramCache]: Analyzing trace with hash 117972303, now seen corresponding path program 20 times [2019-09-05 11:30:23,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:30:23,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:30:23,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:30:23,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:30:23,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:30:23,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:30:23,845 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 1520 trivial. 0 not checked. [2019-09-05 11:30:23,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:30:23,846 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:30:23,855 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:30:23,966 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:30:23,966 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:30:23,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-05 11:30:23,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:30:24,005 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 1520 trivial. 0 not checked. [2019-09-05 11:30:24,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:30:24,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-09-05 11:30:24,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-05 11:30:24,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-05 11:30:24,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-05 11:30:24,011 INFO L87 Difference]: Start difference. First operand 634 states and 915 transitions. Second operand 26 states. [2019-09-05 11:30:24,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:30:24,591 INFO L93 Difference]: Finished difference Result 1472 states and 2177 transitions. [2019-09-05 11:30:24,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-05 11:30:24,591 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 230 [2019-09-05 11:30:24,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:30:24,597 INFO L225 Difference]: With dead ends: 1472 [2019-09-05 11:30:24,597 INFO L226 Difference]: Without dead ends: 889 [2019-09-05 11:30:24,598 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-05 11:30:24,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2019-09-05 11:30:24,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 657. [2019-09-05 11:30:24,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-09-05 11:30:24,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 948 transitions. [2019-09-05 11:30:24,665 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 948 transitions. Word has length 230 [2019-09-05 11:30:24,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:30:24,665 INFO L475 AbstractCegarLoop]: Abstraction has 657 states and 948 transitions. [2019-09-05 11:30:24,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-05 11:30:24,666 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 948 transitions. [2019-09-05 11:30:24,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-05 11:30:24,668 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:30:24,669 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:30:24,669 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:30:24,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:30:24,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1992416394, now seen corresponding path program 21 times [2019-09-05 11:30:24,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:30:24,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:30:24,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:30:24,670 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:30:24,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:30:24,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:30:25,034 INFO L134 CoverageAnalysis]: Checked inductivity of 2167 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 1638 trivial. 0 not checked. [2019-09-05 11:30:25,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:30:25,034 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:30:25,046 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:30:25,153 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-05 11:30:25,154 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:30:25,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-05 11:30:25,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:30:25,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:30:25,481 INFO L134 CoverageAnalysis]: Checked inductivity of 2167 backedges. 154 proven. 200 refuted. 0 times theorem prover too weak. 1813 trivial. 0 not checked. [2019-09-05 11:30:25,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:30:25,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 15] total 39 [2019-09-05 11:30:25,485 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-05 11:30:25,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-05 11:30:25,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=1088, Unknown=0, NotChecked=0, Total=1482 [2019-09-05 11:30:25,486 INFO L87 Difference]: Start difference. First operand 657 states and 948 transitions. Second operand 39 states. [2019-09-05 11:30:45,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:30:45,260 INFO L93 Difference]: Finished difference Result 5213 states and 7757 transitions. [2019-09-05 11:30:45,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 253 states. [2019-09-05 11:30:45,260 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 237 [2019-09-05 11:30:45,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:30:45,293 INFO L225 Difference]: With dead ends: 5213 [2019-09-05 11:30:45,293 INFO L226 Difference]: Without dead ends: 4606 [2019-09-05 11:30:45,299 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 511 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 286 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35489 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=22737, Invalid=59919, Unknown=0, NotChecked=0, Total=82656 [2019-09-05 11:30:45,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4606 states. [2019-09-05 11:30:45,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4606 to 697. [2019-09-05 11:30:45,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2019-09-05 11:30:45,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1008 transitions. [2019-09-05 11:30:45,429 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 1008 transitions. Word has length 237 [2019-09-05 11:30:45,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:30:45,429 INFO L475 AbstractCegarLoop]: Abstraction has 697 states and 1008 transitions. [2019-09-05 11:30:45,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-05 11:30:45,430 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1008 transitions. [2019-09-05 11:30:45,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-09-05 11:30:45,433 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:30:45,433 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:30:45,434 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:30:45,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:30:45,434 INFO L82 PathProgramCache]: Analyzing trace with hash 2003850119, now seen corresponding path program 22 times [2019-09-05 11:30:45,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:30:45,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:30:45,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:30:45,435 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:30:45,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:30:45,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:30:45,783 INFO L134 CoverageAnalysis]: Checked inductivity of 2424 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 1848 trivial. 0 not checked. [2019-09-05 11:30:45,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:30:45,783 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:30:45,793 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:30:45,906 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:30:45,906 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:30:45,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 840 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-05 11:30:45,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:30:46,011 INFO L134 CoverageAnalysis]: Checked inductivity of 2424 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 1848 trivial. 0 not checked. [2019-09-05 11:30:46,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:30:46,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-09-05 11:30:46,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-05 11:30:46,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-05 11:30:46,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-05 11:30:46,017 INFO L87 Difference]: Start difference. First operand 697 states and 1008 transitions. Second operand 28 states. [2019-09-05 11:30:46,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:30:46,907 INFO L93 Difference]: Finished difference Result 1628 states and 2413 transitions. [2019-09-05 11:30:46,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-05 11:30:46,907 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 253 [2019-09-05 11:30:46,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:30:46,912 INFO L225 Difference]: With dead ends: 1628 [2019-09-05 11:30:46,912 INFO L226 Difference]: Without dead ends: 986 [2019-09-05 11:30:46,914 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-05 11:30:46,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2019-09-05 11:30:47,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 720. [2019-09-05 11:30:47,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2019-09-05 11:30:47,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1041 transitions. [2019-09-05 11:30:47,032 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1041 transitions. Word has length 253 [2019-09-05 11:30:47,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:30:47,033 INFO L475 AbstractCegarLoop]: Abstraction has 720 states and 1041 transitions. [2019-09-05 11:30:47,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-05 11:30:47,033 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1041 transitions. [2019-09-05 11:30:47,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-09-05 11:30:47,036 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:30:47,036 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 25, 25, 25, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:30:47,036 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:30:47,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:30:47,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1363702152, now seen corresponding path program 23 times [2019-09-05 11:30:47,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:30:47,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:30:47,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:30:47,038 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:30:47,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:30:47,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:30:47,544 INFO L134 CoverageAnalysis]: Checked inductivity of 2602 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 1977 trivial. 0 not checked. [2019-09-05 11:30:47,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:30:47,545 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:30:47,558 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 11:30:48,253 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 26 check-sat command(s) [2019-09-05 11:30:48,254 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:30:48,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 863 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-05 11:30:48,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:30:48,311 INFO L134 CoverageAnalysis]: Checked inductivity of 2602 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 1977 trivial. 0 not checked. [2019-09-05 11:30:48,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:30:48,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-09-05 11:30:48,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-05 11:30:48,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-05 11:30:48,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-05 11:30:48,317 INFO L87 Difference]: Start difference. First operand 720 states and 1041 transitions. Second operand 29 states. [2019-09-05 11:30:49,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:30:49,085 INFO L93 Difference]: Finished difference Result 1672 states and 2477 transitions. [2019-09-05 11:30:49,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-05 11:30:49,086 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 260 [2019-09-05 11:30:49,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:30:49,095 INFO L225 Difference]: With dead ends: 1672 [2019-09-05 11:30:49,095 INFO L226 Difference]: Without dead ends: 1009 [2019-09-05 11:30:49,097 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-05 11:30:49,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2019-09-05 11:30:49,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 743. [2019-09-05 11:30:49,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 743 states. [2019-09-05 11:30:49,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1074 transitions. [2019-09-05 11:30:49,218 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1074 transitions. Word has length 260 [2019-09-05 11:30:49,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:30:49,218 INFO L475 AbstractCegarLoop]: Abstraction has 743 states and 1074 transitions. [2019-09-05 11:30:49,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-05 11:30:49,218 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1074 transitions. [2019-09-05 11:30:49,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-09-05 11:30:49,221 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:30:49,222 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 26, 26, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:30:49,222 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:30:49,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:30:49,222 INFO L82 PathProgramCache]: Analyzing trace with hash 313809507, now seen corresponding path program 24 times [2019-09-05 11:30:49,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:30:49,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:30:49,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:30:49,223 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:30:49,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:30:49,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:30:49,827 INFO L134 CoverageAnalysis]: Checked inductivity of 2787 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 2111 trivial. 0 not checked. [2019-09-05 11:30:49,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:30:49,828 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:30:49,841 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:30:50,741 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-09-05 11:30:50,742 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:30:50,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-05 11:30:50,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:30:51,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:30:51,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2787 backedges. 200 proven. 252 refuted. 0 times theorem prover too weak. 2335 trivial. 0 not checked. [2019-09-05 11:30:51,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:30:51,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 16] total 43 [2019-09-05 11:30:51,119 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-05 11:30:51,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-05 11:30:51,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=487, Invalid=1319, Unknown=0, NotChecked=0, Total=1806 [2019-09-05 11:30:51,120 INFO L87 Difference]: Start difference. First operand 743 states and 1074 transitions. Second operand 43 states. [2019-09-05 11:31:14,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:31:14,621 INFO L93 Difference]: Finished difference Result 6403 states and 9537 transitions. [2019-09-05 11:31:14,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 311 states. [2019-09-05 11:31:14,622 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 267 [2019-09-05 11:31:14,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:31:14,635 INFO L225 Difference]: With dead ends: 6403 [2019-09-05 11:31:14,636 INFO L226 Difference]: Without dead ends: 5716 [2019-09-05 11:31:14,644 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 602 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 348 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54886 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=33421, Invalid=88729, Unknown=0, NotChecked=0, Total=122150 [2019-09-05 11:31:14,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5716 states. [2019-09-05 11:31:14,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5716 to 783. [2019-09-05 11:31:14,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-09-05 11:31:14,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1134 transitions. [2019-09-05 11:31:14,837 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1134 transitions. Word has length 267 [2019-09-05 11:31:14,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:31:14,837 INFO L475 AbstractCegarLoop]: Abstraction has 783 states and 1134 transitions. [2019-09-05 11:31:14,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-05 11:31:14,837 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1134 transitions. [2019-09-05 11:31:14,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-09-05 11:31:14,840 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:31:14,841 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 27, 27, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:31:14,841 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:31:14,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:31:14,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1525260818, now seen corresponding path program 25 times [2019-09-05 11:31:14,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:31:14,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:31:14,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:31:14,843 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:31:14,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:31:14,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:31:15,341 INFO L134 CoverageAnalysis]: Checked inductivity of 3078 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 2349 trivial. 0 not checked. [2019-09-05 11:31:15,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:31:15,341 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:31:15,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:31:15,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:31:15,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 938 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-05 11:31:15,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:31:15,571 INFO L134 CoverageAnalysis]: Checked inductivity of 3078 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 2349 trivial. 0 not checked. [2019-09-05 11:31:15,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:31:15,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-09-05 11:31:15,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-05 11:31:15,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-05 11:31:15,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-05 11:31:15,577 INFO L87 Difference]: Start difference. First operand 783 states and 1134 transitions. Second operand 31 states. [2019-09-05 11:31:16,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:31:16,300 INFO L93 Difference]: Finished difference Result 1828 states and 2713 transitions. [2019-09-05 11:31:16,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-05 11:31:16,301 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 283 [2019-09-05 11:31:16,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:31:16,306 INFO L225 Difference]: With dead ends: 1828 [2019-09-05 11:31:16,306 INFO L226 Difference]: Without dead ends: 1106 [2019-09-05 11:31:16,308 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-05 11:31:16,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2019-09-05 11:31:16,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 806. [2019-09-05 11:31:16,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2019-09-05 11:31:16,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1167 transitions. [2019-09-05 11:31:16,480 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1167 transitions. Word has length 283 [2019-09-05 11:31:16,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:31:16,480 INFO L475 AbstractCegarLoop]: Abstraction has 806 states and 1167 transitions. [2019-09-05 11:31:16,481 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-05 11:31:16,481 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1167 transitions. [2019-09-05 11:31:16,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-09-05 11:31:16,484 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:31:16,484 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 28, 28, 28, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:31:16,484 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:31:16,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:31:16,485 INFO L82 PathProgramCache]: Analyzing trace with hash -2005584197, now seen corresponding path program 26 times [2019-09-05 11:31:16,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:31:16,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:31:16,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:31:16,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:31:16,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:31:16,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:31:17,020 INFO L134 CoverageAnalysis]: Checked inductivity of 3278 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 2494 trivial. 0 not checked. [2019-09-05 11:31:17,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:31:17,021 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:31:17,031 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:31:17,171 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:31:17,171 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:31:17,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 961 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-05 11:31:17,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:31:17,251 INFO L134 CoverageAnalysis]: Checked inductivity of 3278 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 2494 trivial. 0 not checked. [2019-09-05 11:31:17,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:31:17,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-09-05 11:31:17,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-05 11:31:17,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-05 11:31:17,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-05 11:31:17,257 INFO L87 Difference]: Start difference. First operand 806 states and 1167 transitions. Second operand 32 states. [2019-09-05 11:31:18,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:31:18,210 INFO L93 Difference]: Finished difference Result 1872 states and 2777 transitions. [2019-09-05 11:31:18,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-05 11:31:18,211 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 290 [2019-09-05 11:31:18,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:31:18,216 INFO L225 Difference]: With dead ends: 1872 [2019-09-05 11:31:18,216 INFO L226 Difference]: Without dead ends: 1129 [2019-09-05 11:31:18,221 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-05 11:31:18,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2019-09-05 11:31:18,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 829. [2019-09-05 11:31:18,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 829 states. [2019-09-05 11:31:18,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1200 transitions. [2019-09-05 11:31:18,398 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1200 transitions. Word has length 290 [2019-09-05 11:31:18,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:31:18,398 INFO L475 AbstractCegarLoop]: Abstraction has 829 states and 1200 transitions. [2019-09-05 11:31:18,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-05 11:31:18,398 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1200 transitions. [2019-09-05 11:31:18,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-09-05 11:31:18,402 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:31:18,402 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 29, 29, 29, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:31:18,402 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:31:18,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:31:18,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1657425078, now seen corresponding path program 27 times [2019-09-05 11:31:18,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:31:18,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:31:18,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:31:18,404 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:31:18,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:31:18,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:31:18,870 INFO L134 CoverageAnalysis]: Checked inductivity of 3485 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 2644 trivial. 0 not checked. [2019-09-05 11:31:18,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:31:18,871 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:31:18,881 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:31:19,047 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-09-05 11:31:19,047 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:31:19,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-05 11:31:19,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:31:19,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:31:19,478 INFO L134 CoverageAnalysis]: Checked inductivity of 3485 backedges. 252 proven. 310 refuted. 0 times theorem prover too weak. 2923 trivial. 0 not checked. [2019-09-05 11:31:19,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:31:19,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 17] total 47 [2019-09-05 11:31:19,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-05 11:31:19,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-05 11:31:19,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=590, Invalid=1572, Unknown=0, NotChecked=0, Total=2162 [2019-09-05 11:31:19,483 INFO L87 Difference]: Start difference. First operand 829 states and 1200 transitions. Second operand 47 states. [2019-09-05 11:31:52,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:31:52,300 INFO L93 Difference]: Finished difference Result 7713 states and 11497 transitions. [2019-09-05 11:31:52,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 375 states. [2019-09-05 11:31:52,301 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 297 [2019-09-05 11:31:52,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:31:52,323 INFO L225 Difference]: With dead ends: 7713 [2019-09-05 11:31:52,323 INFO L226 Difference]: Without dead ends: 6946 [2019-09-05 11:31:52,334 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 699 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 416 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81558 ImplicationChecksByTransitivity, 18.2s TimeCoverageRelationStatistics Valid=47453, Invalid=126853, Unknown=0, NotChecked=0, Total=174306 [2019-09-05 11:31:52,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6946 states. [2019-09-05 11:31:52,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6946 to 869. [2019-09-05 11:31:52,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 869 states. [2019-09-05 11:31:52,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1260 transitions. [2019-09-05 11:31:52,593 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1260 transitions. Word has length 297 [2019-09-05 11:31:52,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:31:52,593 INFO L475 AbstractCegarLoop]: Abstraction has 869 states and 1260 transitions. [2019-09-05 11:31:52,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-05 11:31:52,593 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1260 transitions. [2019-09-05 11:31:52,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-09-05 11:31:52,597 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:31:52,597 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 30, 30, 30, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:31:52,597 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:31:52,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:31:52,598 INFO L82 PathProgramCache]: Analyzing trace with hash -262696805, now seen corresponding path program 28 times [2019-09-05 11:31:52,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:31:52,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:31:52,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:31:52,599 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:31:52,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:31:52,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:31:53,152 INFO L134 CoverageAnalysis]: Checked inductivity of 3810 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 2910 trivial. 0 not checked. [2019-09-05 11:31:53,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:31:53,152 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:31:53,162 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:31:53,305 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:31:53,305 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:31:53,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 1036 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-05 11:31:53,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:31:53,362 INFO L134 CoverageAnalysis]: Checked inductivity of 3810 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 2910 trivial. 0 not checked. [2019-09-05 11:31:53,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:31:53,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-09-05 11:31:53,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-05 11:31:53,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-05 11:31:53,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-05 11:31:53,367 INFO L87 Difference]: Start difference. First operand 869 states and 1260 transitions. Second operand 34 states. [2019-09-05 11:31:54,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:31:54,334 INFO L93 Difference]: Finished difference Result 2028 states and 3013 transitions. [2019-09-05 11:31:54,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-05 11:31:54,334 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 313 [2019-09-05 11:31:54,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:31:54,339 INFO L225 Difference]: With dead ends: 2028 [2019-09-05 11:31:54,339 INFO L226 Difference]: Without dead ends: 1226 [2019-09-05 11:31:54,341 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 313 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-05 11:31:54,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2019-09-05 11:31:54,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 892. [2019-09-05 11:31:54,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 892 states. [2019-09-05 11:31:54,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1293 transitions. [2019-09-05 11:31:54,538 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1293 transitions. Word has length 313 [2019-09-05 11:31:54,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:31:54,539 INFO L475 AbstractCegarLoop]: Abstraction has 892 states and 1293 transitions. [2019-09-05 11:31:54,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-05 11:31:54,539 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1293 transitions. [2019-09-05 11:31:54,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-05 11:31:54,542 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:31:54,543 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 31, 31, 31, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:31:54,543 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:31:54,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:31:54,544 INFO L82 PathProgramCache]: Analyzing trace with hash -194030796, now seen corresponding path program 29 times [2019-09-05 11:31:54,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:31:54,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:31:54,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:31:54,545 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:31:54,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:31:54,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:31:55,185 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 3071 trivial. 0 not checked. [2019-09-05 11:31:55,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:31:55,186 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:31:55,198 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 11:31:57,072 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2019-09-05 11:31:57,073 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:31:57,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 1059 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-05 11:31:57,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:31:57,147 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 3071 trivial. 0 not checked. [2019-09-05 11:31:57,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:31:57,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-09-05 11:31:57,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-05 11:31:57,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-05 11:31:57,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-05 11:31:57,155 INFO L87 Difference]: Start difference. First operand 892 states and 1293 transitions. Second operand 35 states. [2019-09-05 11:31:58,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:31:58,326 INFO L93 Difference]: Finished difference Result 2072 states and 3077 transitions. [2019-09-05 11:31:58,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-05 11:31:58,326 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 320 [2019-09-05 11:31:58,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:31:58,330 INFO L225 Difference]: With dead ends: 2072 [2019-09-05 11:31:58,330 INFO L226 Difference]: Without dead ends: 1249 [2019-09-05 11:31:58,333 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-05 11:31:58,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2019-09-05 11:31:58,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 915. [2019-09-05 11:31:58,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 915 states. [2019-09-05 11:31:58,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1326 transitions. [2019-09-05 11:31:58,573 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1326 transitions. Word has length 320 [2019-09-05 11:31:58,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:31:58,573 INFO L475 AbstractCegarLoop]: Abstraction has 915 states and 1326 transitions. [2019-09-05 11:31:58,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-05 11:31:58,574 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1326 transitions. [2019-09-05 11:31:58,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-09-05 11:31:58,577 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:31:58,578 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 32, 32, 32, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:31:58,578 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:31:58,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:31:58,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1303073911, now seen corresponding path program 30 times [2019-09-05 11:31:58,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:31:58,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:31:58,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:31:58,579 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:31:58,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:31:58,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:31:59,319 INFO L134 CoverageAnalysis]: Checked inductivity of 4261 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 3237 trivial. 0 not checked. [2019-09-05 11:31:59,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:31:59,319 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:31:59,333 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 11:32:00,601 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 23 check-sat command(s) [2019-09-05 11:32:00,601 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:32:00,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 852 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-05 11:32:00,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:32:00,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:32:01,011 INFO L134 CoverageAnalysis]: Checked inductivity of 4261 backedges. 404 proven. 280 refuted. 0 times theorem prover too weak. 3577 trivial. 0 not checked. [2019-09-05 11:32:01,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:32:01,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 16] total 49 [2019-09-05 11:32:01,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-05 11:32:01,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-05 11:32:01,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=678, Invalid=1674, Unknown=0, NotChecked=0, Total=2352 [2019-09-05 11:32:01,018 INFO L87 Difference]: Start difference. First operand 915 states and 1326 transitions. Second operand 49 states. [2019-09-05 11:32:39,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:32:39,312 INFO L93 Difference]: Finished difference Result 9143 states and 13637 transitions. [2019-09-05 11:32:39,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 444 states. [2019-09-05 11:32:39,313 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 327 [2019-09-05 11:32:39,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:32:39,324 INFO L225 Difference]: With dead ends: 9143 [2019-09-05 11:32:39,325 INFO L226 Difference]: Without dead ends: 8296 [2019-09-05 11:32:39,337 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1142 GetRequests, 685 SyntacticMatches, 3 SemanticMatches, 454 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104694 ImplicationChecksByTransitivity, 19.9s TimeCoverageRelationStatistics Valid=56395, Invalid=151085, Unknown=0, NotChecked=0, Total=207480 [2019-09-05 11:32:39,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8296 states. [2019-09-05 11:32:39,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8296 to 955. [2019-09-05 11:32:39,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 955 states. [2019-09-05 11:32:39,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 1386 transitions. [2019-09-05 11:32:39,602 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 1386 transitions. Word has length 327 [2019-09-05 11:32:39,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:32:39,602 INFO L475 AbstractCegarLoop]: Abstraction has 955 states and 1386 transitions. [2019-09-05 11:32:39,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-05 11:32:39,602 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1386 transitions. [2019-09-05 11:32:39,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2019-09-05 11:32:39,606 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:32:39,606 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 33, 33, 33, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:32:39,606 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:32:39,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:32:39,607 INFO L82 PathProgramCache]: Analyzing trace with hash 126573250, now seen corresponding path program 31 times [2019-09-05 11:32:39,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:32:39,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:32:39,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:32:39,608 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:32:39,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:32:39,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:32:40,350 INFO L134 CoverageAnalysis]: Checked inductivity of 4620 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 3531 trivial. 0 not checked. [2019-09-05 11:32:40,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:32:40,350 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:32:40,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:32:40,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:32:40,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 1134 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-05 11:32:40,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:32:40,594 INFO L134 CoverageAnalysis]: Checked inductivity of 4620 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 3531 trivial. 0 not checked. [2019-09-05 11:32:40,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:32:40,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2019-09-05 11:32:40,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-05 11:32:40,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-05 11:32:40,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-09-05 11:32:40,609 INFO L87 Difference]: Start difference. First operand 955 states and 1386 transitions. Second operand 37 states. [2019-09-05 11:32:41,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:32:41,676 INFO L93 Difference]: Finished difference Result 2228 states and 3313 transitions. [2019-09-05 11:32:41,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-05 11:32:41,676 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 343 [2019-09-05 11:32:41,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:32:41,679 INFO L225 Difference]: With dead ends: 2228 [2019-09-05 11:32:41,679 INFO L226 Difference]: Without dead ends: 1346 [2019-09-05 11:32:41,682 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-09-05 11:32:41,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2019-09-05 11:32:41,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 978. [2019-09-05 11:32:41,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 978 states. [2019-09-05 11:32:41,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 1419 transitions. [2019-09-05 11:32:41,865 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 1419 transitions. Word has length 343 [2019-09-05 11:32:41,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:32:41,865 INFO L475 AbstractCegarLoop]: Abstraction has 978 states and 1419 transitions. [2019-09-05 11:32:41,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-05 11:32:41,865 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1419 transitions. [2019-09-05 11:32:41,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-09-05 11:32:41,867 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:32:41,868 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 34, 34, 34, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:32:41,868 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:32:41,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:32:41,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1228797479, now seen corresponding path program 32 times [2019-09-05 11:32:41,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:32:41,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:32:41,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:32:41,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:32:41,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:32:41,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:32:42,730 INFO L134 CoverageAnalysis]: Checked inductivity of 4864 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 3708 trivial. 0 not checked. [2019-09-05 11:32:42,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:32:42,730 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:32:42,763 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:32:42,922 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:32:42,922 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:32:42,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 1157 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-05 11:32:42,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:32:43,016 INFO L134 CoverageAnalysis]: Checked inductivity of 4864 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 3708 trivial. 0 not checked. [2019-09-05 11:32:43,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:32:43,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2019-09-05 11:32:43,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-05 11:32:43,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-05 11:32:43,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-05 11:32:43,022 INFO L87 Difference]: Start difference. First operand 978 states and 1419 transitions. Second operand 38 states. [2019-09-05 11:32:44,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:32:44,374 INFO L93 Difference]: Finished difference Result 2272 states and 3377 transitions. [2019-09-05 11:32:44,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-05 11:32:44,374 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 350 [2019-09-05 11:32:44,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:32:44,377 INFO L225 Difference]: With dead ends: 2272 [2019-09-05 11:32:44,377 INFO L226 Difference]: Without dead ends: 1369 [2019-09-05 11:32:44,379 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-05 11:32:44,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2019-09-05 11:32:44,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 1001. [2019-09-05 11:32:44,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1001 states. [2019-09-05 11:32:44,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1452 transitions. [2019-09-05 11:32:44,546 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1452 transitions. Word has length 350 [2019-09-05 11:32:44,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:32:44,546 INFO L475 AbstractCegarLoop]: Abstraction has 1001 states and 1452 transitions. [2019-09-05 11:32:44,546 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-05 11:32:44,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1452 transitions. [2019-09-05 11:32:44,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-09-05 11:32:44,550 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:32:44,550 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 35, 35, 35, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:32:44,551 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:32:44,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:32:44,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1832168734, now seen corresponding path program 33 times [2019-09-05 11:32:44,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:32:44,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:32:44,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:32:44,552 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:32:44,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:32:44,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:32:45,277 INFO L134 CoverageAnalysis]: Checked inductivity of 5115 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 3890 trivial. 0 not checked. [2019-09-05 11:32:45,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:32:45,277 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:32:45,291 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:32:45,582 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-09-05 11:32:45,583 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:32:45,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 651 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-05 11:32:45,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:32:45,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:32:46,156 INFO L134 CoverageAnalysis]: Checked inductivity of 5115 backedges. 477 proven. 341 refuted. 0 times theorem prover too weak. 4297 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (36)] Exception during sending of exit command (exit): Stream closed [2019-09-05 11:32:46,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:32:46,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 17] total 53 [2019-09-05 11:32:46,172 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-05 11:32:46,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-05 11:32:46,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=799, Invalid=1957, Unknown=0, NotChecked=0, Total=2756 [2019-09-05 11:32:46,173 INFO L87 Difference]: Start difference. First operand 1001 states and 1452 transitions. Second operand 53 states. [2019-09-05 11:33:38,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:33:38,820 INFO L93 Difference]: Finished difference Result 10693 states and 15957 transitions. [2019-09-05 11:33:38,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 520 states. [2019-09-05 11:33:38,821 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 357 [2019-09-05 11:33:38,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:33:38,831 INFO L225 Difference]: With dead ends: 10693 [2019-09-05 11:33:38,831 INFO L226 Difference]: Without dead ends: 9766 [2019-09-05 11:33:38,842 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1318 GetRequests, 723 SyntacticMatches, 64 SemanticMatches, 531 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168313 ImplicationChecksByTransitivity, 27.5s TimeCoverageRelationStatistics Valid=76713, Invalid=206843, Unknown=0, NotChecked=0, Total=283556 [2019-09-05 11:33:38,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9766 states. [2019-09-05 11:33:39,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9766 to 1041. [2019-09-05 11:33:39,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1041 states. [2019-09-05 11:33:39,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 1512 transitions. [2019-09-05 11:33:39,159 INFO L78 Accepts]: Start accepts. Automaton has 1041 states and 1512 transitions. Word has length 357 [2019-09-05 11:33:39,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:33:39,159 INFO L475 AbstractCegarLoop]: Abstraction has 1041 states and 1512 transitions. [2019-09-05 11:33:39,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-05 11:33:39,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1041 states and 1512 transitions. [2019-09-05 11:33:39,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2019-09-05 11:33:39,162 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:33:39,162 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 36, 36, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:33:39,162 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:33:39,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:33:39,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1946314671, now seen corresponding path program 34 times [2019-09-05 11:33:39,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:33:39,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:33:39,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:33:39,163 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:33:39,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:33:39,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:33:39,956 INFO L134 CoverageAnalysis]: Checked inductivity of 5508 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 4212 trivial. 0 not checked. [2019-09-05 11:33:39,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:33:39,956 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:33:40,013 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:33:40,184 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:33:40,185 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:33:40,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 1232 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-05 11:33:40,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:33:40,300 INFO L134 CoverageAnalysis]: Checked inductivity of 5508 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 4212 trivial. 0 not checked. [2019-09-05 11:33:40,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:33:40,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 40 [2019-09-05 11:33:40,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-05 11:33:40,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-05 11:33:40,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-05 11:33:40,316 INFO L87 Difference]: Start difference. First operand 1041 states and 1512 transitions. Second operand 40 states. [2019-09-05 11:33:41,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:33:41,440 INFO L93 Difference]: Finished difference Result 2428 states and 3613 transitions. [2019-09-05 11:33:41,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-05 11:33:41,440 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 373 [2019-09-05 11:33:41,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:33:41,443 INFO L225 Difference]: With dead ends: 2428 [2019-09-05 11:33:41,443 INFO L226 Difference]: Without dead ends: 1466 [2019-09-05 11:33:41,446 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 373 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-05 11:33:41,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2019-09-05 11:33:41,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 1064. [2019-09-05 11:33:41,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1064 states. [2019-09-05 11:33:41,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1545 transitions. [2019-09-05 11:33:41,691 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1545 transitions. Word has length 373 [2019-09-05 11:33:41,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:33:41,691 INFO L475 AbstractCegarLoop]: Abstraction has 1064 states and 1545 transitions. [2019-09-05 11:33:41,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-05 11:33:41,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1545 transitions. [2019-09-05 11:33:41,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2019-09-05 11:33:41,695 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:33:41,695 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 37, 37, 37, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:33:41,695 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:33:41,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:33:41,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1272023776, now seen corresponding path program 35 times [2019-09-05 11:33:41,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:33:41,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:33:41,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:33:41,696 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:33:41,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:33:41,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:33:42,563 INFO L134 CoverageAnalysis]: Checked inductivity of 5774 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 4405 trivial. 0 not checked. [2019-09-05 11:33:42,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:33:42,564 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:33:42,574 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 11:33:44,351 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 38 check-sat command(s) [2019-09-05 11:33:44,352 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:33:44,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 1255 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-05 11:33:44,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:33:44,597 INFO L134 CoverageAnalysis]: Checked inductivity of 5774 backedges. 0 proven. 3799 refuted. 0 times theorem prover too weak. 1975 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (38)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 11:33:44,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:33:44,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2019-09-05 11:33:44,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-05 11:33:44,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-05 11:33:44,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-05 11:33:44,619 INFO L87 Difference]: Start difference. First operand 1064 states and 1545 transitions. Second operand 41 states. [2019-09-05 11:33:46,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:33:46,095 INFO L93 Difference]: Finished difference Result 2472 states and 3677 transitions. [2019-09-05 11:33:46,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-05 11:33:46,096 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 380 [2019-09-05 11:33:46,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:33:46,098 INFO L225 Difference]: With dead ends: 2472 [2019-09-05 11:33:46,098 INFO L226 Difference]: Without dead ends: 1489 [2019-09-05 11:33:46,100 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 380 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-05 11:33:46,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1489 states. [2019-09-05 11:33:46,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1489 to 1087. [2019-09-05 11:33:46,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1087 states. [2019-09-05 11:33:46,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1087 states to 1087 states and 1578 transitions. [2019-09-05 11:33:46,310 INFO L78 Accepts]: Start accepts. Automaton has 1087 states and 1578 transitions. Word has length 380 [2019-09-05 11:33:46,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:33:46,311 INFO L475 AbstractCegarLoop]: Abstraction has 1087 states and 1578 transitions. [2019-09-05 11:33:46,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-05 11:33:46,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 1578 transitions. [2019-09-05 11:33:46,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2019-09-05 11:33:46,314 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:33:46,314 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 38, 38, 38, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:33:46,314 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:33:46,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:33:46,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1846908789, now seen corresponding path program 36 times [2019-09-05 11:33:46,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:33:46,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:33:46,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:33:46,316 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:33:46,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:33:46,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:33:47,351 INFO L134 CoverageAnalysis]: Checked inductivity of 6047 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 4603 trivial. 0 not checked. [2019-09-05 11:33:47,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:33:47,351 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:33:47,372 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:33:50,550 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2019-09-05 11:33:50,551 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:33:50,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 1002 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-05 11:33:50,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:33:50,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:33:51,037 INFO L134 CoverageAnalysis]: Checked inductivity of 6047 backedges. 556 proven. 408 refuted. 0 times theorem prover too weak. 5083 trivial. 0 not checked. [2019-09-05 11:33:51,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:33:51,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 18] total 57 [2019-09-05 11:33:51,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-05 11:33:51,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-05 11:33:51,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=930, Invalid=2262, Unknown=0, NotChecked=0, Total=3192 [2019-09-05 11:33:51,045 INFO L87 Difference]: Start difference. First operand 1087 states and 1578 transitions. Second operand 57 states. [2019-09-05 11:34:59,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:34:59,695 INFO L93 Difference]: Finished difference Result 12363 states and 18457 transitions. [2019-09-05 11:34:59,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 602 states. [2019-09-05 11:34:59,696 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 387 [2019-09-05 11:34:59,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:34:59,709 INFO L225 Difference]: With dead ends: 12363 [2019-09-05 11:34:59,710 INFO L226 Difference]: Without dead ends: 11356 [2019-09-05 11:34:59,724 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1506 GetRequests, 825 SyntacticMatches, 67 SemanticMatches, 614 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228803 ImplicationChecksByTransitivity, 33.5s TimeCoverageRelationStatistics Valid=102059, Invalid=276781, Unknown=0, NotChecked=0, Total=378840 [2019-09-05 11:34:59,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11356 states. [2019-09-05 11:35:00,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11356 to 1127. [2019-09-05 11:35:00,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1127 states. [2019-09-05 11:35:00,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 1127 states and 1638 transitions. [2019-09-05 11:35:00,029 INFO L78 Accepts]: Start accepts. Automaton has 1127 states and 1638 transitions. Word has length 387 [2019-09-05 11:35:00,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:35:00,030 INFO L475 AbstractCegarLoop]: Abstraction has 1127 states and 1638 transitions. [2019-09-05 11:35:00,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-05 11:35:00,030 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 1638 transitions. [2019-09-05 11:35:00,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2019-09-05 11:35:00,033 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:35:00,033 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 39, 39, 39, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:35:00,033 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:35:00,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:35:00,034 INFO L82 PathProgramCache]: Analyzing trace with hash 866795926, now seen corresponding path program 37 times [2019-09-05 11:35:00,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:35:00,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:35:00,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:35:00,034 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:35:00,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:35:00,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:35:01,001 INFO L134 CoverageAnalysis]: Checked inductivity of 6474 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 4953 trivial. 0 not checked. [2019-09-05 11:35:01,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:35:01,002 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:35:01,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:35:01,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:35:01,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 1330 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-05 11:35:01,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:35:01,298 INFO L134 CoverageAnalysis]: Checked inductivity of 6474 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 4953 trivial. 0 not checked. [2019-09-05 11:35:01,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:35:01,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 43 [2019-09-05 11:35:01,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-05 11:35:01,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-05 11:35:01,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-09-05 11:35:01,304 INFO L87 Difference]: Start difference. First operand 1127 states and 1638 transitions. Second operand 43 states. [2019-09-05 11:35:02,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:35:02,671 INFO L93 Difference]: Finished difference Result 2628 states and 3913 transitions. [2019-09-05 11:35:02,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-05 11:35:02,671 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 403 [2019-09-05 11:35:02,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:35:02,675 INFO L225 Difference]: With dead ends: 2628 [2019-09-05 11:35:02,675 INFO L226 Difference]: Without dead ends: 1586 [2019-09-05 11:35:02,678 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 403 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-09-05 11:35:02,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2019-09-05 11:35:03,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1150. [2019-09-05 11:35:03,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1150 states. [2019-09-05 11:35:03,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1671 transitions. [2019-09-05 11:35:03,192 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1671 transitions. Word has length 403 [2019-09-05 11:35:03,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:35:03,192 INFO L475 AbstractCegarLoop]: Abstraction has 1150 states and 1671 transitions. [2019-09-05 11:35:03,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-05 11:35:03,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1671 transitions. [2019-09-05 11:35:03,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2019-09-05 11:35:03,197 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:35:03,198 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 40, 40, 40, 40, 40, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:35:03,198 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:35:03,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:35:03,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1739021203, now seen corresponding path program 38 times [2019-09-05 11:35:03,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:35:03,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:35:03,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:35:03,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:35:03,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:35:03,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:35:04,030 INFO L134 CoverageAnalysis]: Checked inductivity of 6762 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 5162 trivial. 0 not checked. [2019-09-05 11:35:04,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:35:04,030 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:35:04,040 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:35:04,230 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:35:04,230 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:35:04,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 1353 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-05 11:35:04,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:35:04,314 INFO L134 CoverageAnalysis]: Checked inductivity of 6762 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 5162 trivial. 0 not checked. [2019-09-05 11:35:04,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:35:04,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 44 [2019-09-05 11:35:04,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-05 11:35:04,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-05 11:35:04,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-05 11:35:04,324 INFO L87 Difference]: Start difference. First operand 1150 states and 1671 transitions. Second operand 44 states. [2019-09-05 11:35:05,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:35:05,746 INFO L93 Difference]: Finished difference Result 2672 states and 3977 transitions. [2019-09-05 11:35:05,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-05 11:35:05,747 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 410 [2019-09-05 11:35:05,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:35:05,749 INFO L225 Difference]: With dead ends: 2672 [2019-09-05 11:35:05,749 INFO L226 Difference]: Without dead ends: 1609 [2019-09-05 11:35:05,752 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 410 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-05 11:35:05,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1609 states. [2019-09-05 11:35:06,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1609 to 1173. [2019-09-05 11:35:06,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1173 states. [2019-09-05 11:35:06,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1704 transitions. [2019-09-05 11:35:06,017 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1704 transitions. Word has length 410 [2019-09-05 11:35:06,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:35:06,017 INFO L475 AbstractCegarLoop]: Abstraction has 1173 states and 1704 transitions. [2019-09-05 11:35:06,017 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-05 11:35:06,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1704 transitions. [2019-09-05 11:35:06,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2019-09-05 11:35:06,020 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:35:06,021 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 41, 41, 41, 41, 41, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:35:06,021 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:35:06,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:35:06,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1199435534, now seen corresponding path program 39 times [2019-09-05 11:35:06,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:35:06,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:35:06,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:35:06,022 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:35:06,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:35:06,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:35:06,938 INFO L134 CoverageAnalysis]: Checked inductivity of 7057 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 5376 trivial. 0 not checked. [2019-09-05 11:35:06,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:35:06,939 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:35:06,951 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:35:07,461 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-05 11:35:07,461 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:35:07,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 755 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-05 11:35:07,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:35:07,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:35:08,135 INFO L134 CoverageAnalysis]: Checked inductivity of 7057 backedges. 520 proven. 602 refuted. 0 times theorem prover too weak. 5935 trivial. 0 not checked. [2019-09-05 11:35:08,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:35:08,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 21] total 63 [2019-09-05 11:35:08,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-05 11:35:08,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-05 11:35:08,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1102, Invalid=2804, Unknown=0, NotChecked=0, Total=3906 [2019-09-05 11:35:08,142 INFO L87 Difference]: Start difference. First operand 1173 states and 1704 transitions. Second operand 63 states. [2019-09-05 11:36:37,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:36:37,245 INFO L93 Difference]: Finished difference Result 14153 states and 21137 transitions. [2019-09-05 11:36:37,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 691 states. [2019-09-05 11:36:37,245 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 417 [2019-09-05 11:36:37,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:36:37,261 INFO L225 Difference]: With dead ends: 14153 [2019-09-05 11:36:37,262 INFO L226 Difference]: Without dead ends: 13066 [2019-09-05 11:36:37,281 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1147 GetRequests, 399 SyntacticMatches, 0 SemanticMatches, 748 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295069 ImplicationChecksByTransitivity, 44.6s TimeCoverageRelationStatistics Valid=150471, Invalid=411279, Unknown=0, NotChecked=0, Total=561750 [2019-09-05 11:36:37,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13066 states. [2019-09-05 11:36:37,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13066 to 1213. [2019-09-05 11:36:37,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1213 states. [2019-09-05 11:36:37,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1213 states to 1213 states and 1764 transitions. [2019-09-05 11:36:37,636 INFO L78 Accepts]: Start accepts. Automaton has 1213 states and 1764 transitions. Word has length 417 [2019-09-05 11:36:37,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:36:37,637 INFO L475 AbstractCegarLoop]: Abstraction has 1213 states and 1764 transitions. [2019-09-05 11:36:37,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-05 11:36:37,637 INFO L276 IsEmpty]: Start isEmpty. Operand 1213 states and 1764 transitions. [2019-09-05 11:36:37,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2019-09-05 11:36:37,642 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:36:37,642 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 42, 42, 42, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:36:37,643 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:36:37,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:36:37,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1074518211, now seen corresponding path program 40 times [2019-09-05 11:36:37,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:36:37,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:36:37,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:37,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:36:37,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:37,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:36:38,515 INFO L134 CoverageAnalysis]: Checked inductivity of 7518 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 5754 trivial. 0 not checked. [2019-09-05 11:36:38,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:36:38,516 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:36:38,527 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:36:38,727 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:36:38,728 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:36:38,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 1428 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-05 11:36:38,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:36:38,810 INFO L134 CoverageAnalysis]: Checked inductivity of 7518 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 5754 trivial. 0 not checked. [2019-09-05 11:36:38,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:36:38,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 46 [2019-09-05 11:36:38,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-05 11:36:38,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-05 11:36:38,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-05 11:36:38,816 INFO L87 Difference]: Start difference. First operand 1213 states and 1764 transitions. Second operand 46 states. [2019-09-05 11:36:40,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:36:40,704 INFO L93 Difference]: Finished difference Result 2828 states and 4213 transitions. [2019-09-05 11:36:40,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-05 11:36:40,704 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 433 [2019-09-05 11:36:40,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:36:40,708 INFO L225 Difference]: With dead ends: 2828 [2019-09-05 11:36:40,708 INFO L226 Difference]: Without dead ends: 1706 [2019-09-05 11:36:40,711 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 433 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-05 11:36:40,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2019-09-05 11:36:41,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1236. [2019-09-05 11:36:41,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1236 states. [2019-09-05 11:36:41,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1236 states to 1236 states and 1797 transitions. [2019-09-05 11:36:41,025 INFO L78 Accepts]: Start accepts. Automaton has 1236 states and 1797 transitions. Word has length 433 [2019-09-05 11:36:41,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:36:41,025 INFO L475 AbstractCegarLoop]: Abstraction has 1236 states and 1797 transitions. [2019-09-05 11:36:41,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-05 11:36:41,025 INFO L276 IsEmpty]: Start isEmpty. Operand 1236 states and 1797 transitions. [2019-09-05 11:36:41,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2019-09-05 11:36:41,030 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:36:41,030 INFO L399 BasicCegarLoop]: trace histogram [43, 43, 43, 43, 43, 43, 43, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:36:41,031 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:36:41,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:36:41,031 INFO L82 PathProgramCache]: Analyzing trace with hash 835197068, now seen corresponding path program 41 times [2019-09-05 11:36:41,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:36:41,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:36:41,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:41,032 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:36:41,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:41,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:36:41,919 INFO L134 CoverageAnalysis]: Checked inductivity of 7828 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 5979 trivial. 0 not checked. [2019-09-05 11:36:41,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:36:41,919 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:36:41,935 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 11:36:45,951 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 44 check-sat command(s) [2019-09-05 11:36:45,951 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:36:45,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 1451 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-05 11:36:45,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:36:46,067 INFO L134 CoverageAnalysis]: Checked inductivity of 7828 backedges. 0 proven. 5146 refuted. 0 times theorem prover too weak. 2682 trivial. 0 not checked. [2019-09-05 11:36:46,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:36:46,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 47 [2019-09-05 11:36:46,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-05 11:36:46,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-05 11:36:46,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-09-05 11:36:46,079 INFO L87 Difference]: Start difference. First operand 1236 states and 1797 transitions. Second operand 47 states. [2019-09-05 11:36:47,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:36:47,738 INFO L93 Difference]: Finished difference Result 2872 states and 4277 transitions. [2019-09-05 11:36:47,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-05 11:36:47,739 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 440 [2019-09-05 11:36:47,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:36:47,741 INFO L225 Difference]: With dead ends: 2872 [2019-09-05 11:36:47,741 INFO L226 Difference]: Without dead ends: 1729 [2019-09-05 11:36:47,743 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 440 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-09-05 11:36:47,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1729 states. [2019-09-05 11:36:48,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1729 to 1259. [2019-09-05 11:36:48,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1259 states. [2019-09-05 11:36:48,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1259 states to 1259 states and 1830 transitions. [2019-09-05 11:36:48,124 INFO L78 Accepts]: Start accepts. Automaton has 1259 states and 1830 transitions. Word has length 440 [2019-09-05 11:36:48,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:36:48,125 INFO L475 AbstractCegarLoop]: Abstraction has 1259 states and 1830 transitions. [2019-09-05 11:36:48,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-05 11:36:48,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1259 states and 1830 transitions. [2019-09-05 11:36:48,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2019-09-05 11:36:48,129 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:36:48,130 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 44, 44, 44, 44, 44, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:36:48,130 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:36:48,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:36:48,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1263310495, now seen corresponding path program 42 times [2019-09-05 11:36:48,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:36:48,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:36:48,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:48,131 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:36:48,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:48,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:36:49,072 INFO L134 CoverageAnalysis]: Checked inductivity of 8145 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 6209 trivial. 0 not checked. [2019-09-05 11:36:49,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:36:49,072 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:36:49,083 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 11:36:55,413 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2019-09-05 11:36:55,414 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:36:55,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 1152 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-05 11:36:55,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:36:55,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:36:56,173 INFO L134 CoverageAnalysis]: Checked inductivity of 8145 backedges. 602 proven. 690 refuted. 0 times theorem prover too weak. 6853 trivial. 0 not checked. [2019-09-05 11:36:56,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:36:56,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 22] total 67 [2019-09-05 11:36:56,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-09-05 11:36:56,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-09-05 11:36:56,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1255, Invalid=3167, Unknown=0, NotChecked=0, Total=4422 [2019-09-05 11:36:56,182 INFO L87 Difference]: Start difference. First operand 1259 states and 1830 transitions. Second operand 67 states. [2019-09-05 11:37:52,069 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 13 [2019-09-05 11:38:52,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:38:52,146 INFO L93 Difference]: Finished difference Result 16063 states and 23997 transitions. [2019-09-05 11:38:52,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 785 states. [2019-09-05 11:38:52,147 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 447 [2019-09-05 11:38:52,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:38:52,166 INFO L225 Difference]: With dead ends: 16063 [2019-09-05 11:38:52,166 INFO L226 Difference]: Without dead ends: 14896 [2019-09-05 11:38:52,191 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1274 GetRequests, 428 SyntacticMatches, 0 SemanticMatches, 846 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382919 ImplicationChecksByTransitivity, 55.1s TimeCoverageRelationStatistics Valid=191773, Invalid=526483, Unknown=0, NotChecked=0, Total=718256 [2019-09-05 11:38:52,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14896 states. [2019-09-05 11:38:52,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14896 to 1299. [2019-09-05 11:38:52,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1299 states. [2019-09-05 11:38:52,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1299 states to 1299 states and 1890 transitions. [2019-09-05 11:38:52,634 INFO L78 Accepts]: Start accepts. Automaton has 1299 states and 1890 transitions. Word has length 447 [2019-09-05 11:38:52,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:38:52,634 INFO L475 AbstractCegarLoop]: Abstraction has 1299 states and 1890 transitions. [2019-09-05 11:38:52,634 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-09-05 11:38:52,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1299 states and 1890 transitions. [2019-09-05 11:38:52,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2019-09-05 11:38:52,638 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:38:52,638 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 45, 45, 45, 45, 45, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:38:52,638 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:38:52,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:38:52,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1854270870, now seen corresponding path program 43 times [2019-09-05 11:38:52,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:38:52,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:38:52,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:38:52,639 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:38:52,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:38:52,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:38:53,683 INFO L134 CoverageAnalysis]: Checked inductivity of 8640 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 6615 trivial. 0 not checked. [2019-09-05 11:38:53,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:38:53,683 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:38:53,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:38:53,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:38:53,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 1526 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-05 11:38:53,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:38:54,011 INFO L134 CoverageAnalysis]: Checked inductivity of 8640 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 6615 trivial. 0 not checked. [2019-09-05 11:38:54,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:38:54,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 49 [2019-09-05 11:38:54,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-05 11:38:54,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-05 11:38:54,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-09-05 11:38:54,017 INFO L87 Difference]: Start difference. First operand 1299 states and 1890 transitions. Second operand 49 states. [2019-09-05 11:38:56,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:38:56,132 INFO L93 Difference]: Finished difference Result 3028 states and 4513 transitions. [2019-09-05 11:38:56,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-05 11:38:56,132 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 463 [2019-09-05 11:38:56,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:38:56,135 INFO L225 Difference]: With dead ends: 3028 [2019-09-05 11:38:56,136 INFO L226 Difference]: Without dead ends: 1826 [2019-09-05 11:38:56,138 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 463 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-09-05 11:38:56,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1826 states. [2019-09-05 11:38:56,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1826 to 1322. [2019-09-05 11:38:56,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1322 states. [2019-09-05 11:38:56,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 1923 transitions. [2019-09-05 11:38:56,519 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 1923 transitions. Word has length 463 [2019-09-05 11:38:56,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:38:56,520 INFO L475 AbstractCegarLoop]: Abstraction has 1322 states and 1923 transitions. [2019-09-05 11:38:56,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-05 11:38:56,520 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1923 transitions. [2019-09-05 11:38:56,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2019-09-05 11:38:56,523 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:38:56,524 INFO L399 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 46, 46, 46, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:38:56,524 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:38:56,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:38:56,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1744201471, now seen corresponding path program 44 times [2019-09-05 11:38:56,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:38:56,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:38:56,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:38:56,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:38:56,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:38:56,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:38:57,499 INFO L134 CoverageAnalysis]: Checked inductivity of 8972 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 6856 trivial. 0 not checked. [2019-09-05 11:38:57,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:38:57,499 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:38:57,510 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:38:57,733 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:38:57,733 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:38:57,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 1549 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-05 11:38:57,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:38:57,827 INFO L134 CoverageAnalysis]: Checked inductivity of 8972 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 6856 trivial. 0 not checked. [2019-09-05 11:38:57,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:38:57,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 50 [2019-09-05 11:38:57,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-05 11:38:57,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-05 11:38:57,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-09-05 11:38:57,833 INFO L87 Difference]: Start difference. First operand 1322 states and 1923 transitions. Second operand 50 states. [2019-09-05 11:38:59,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:38:59,975 INFO L93 Difference]: Finished difference Result 3072 states and 4577 transitions. [2019-09-05 11:38:59,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-05 11:38:59,975 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 470 [2019-09-05 11:38:59,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:38:59,979 INFO L225 Difference]: With dead ends: 3072 [2019-09-05 11:38:59,979 INFO L226 Difference]: Without dead ends: 1849 [2019-09-05 11:38:59,981 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 470 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-09-05 11:38:59,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1849 states. [2019-09-05 11:39:00,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1849 to 1345. [2019-09-05 11:39:00,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1345 states. [2019-09-05 11:39:00,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 1956 transitions. [2019-09-05 11:39:00,389 INFO L78 Accepts]: Start accepts. Automaton has 1345 states and 1956 transitions. Word has length 470 [2019-09-05 11:39:00,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:39:00,390 INFO L475 AbstractCegarLoop]: Abstraction has 1345 states and 1956 transitions. [2019-09-05 11:39:00,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-05 11:39:00,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 1956 transitions. [2019-09-05 11:39:00,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2019-09-05 11:39:00,394 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:39:00,394 INFO L399 BasicCegarLoop]: trace histogram [47, 47, 47, 47, 47, 47, 47, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:39:00,394 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:39:00,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:39:00,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1520116026, now seen corresponding path program 45 times [2019-09-05 11:39:00,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:39:00,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:39:00,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:39:00,395 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:39:00,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:39:00,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:39:01,456 INFO L134 CoverageAnalysis]: Checked inductivity of 9311 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 7102 trivial. 0 not checked. [2019-09-05 11:39:01,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:39:01,457 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:39:01,467 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:39:02,219 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-09-05 11:39:02,219 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:39:02,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 859 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-05 11:39:02,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:39:02,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:39:03,147 INFO L134 CoverageAnalysis]: Checked inductivity of 9311 backedges. 690 proven. 784 refuted. 0 times theorem prover too weak. 7837 trivial. 0 not checked. [2019-09-05 11:39:03,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:39:03,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 23] total 71 [2019-09-05 11:39:03,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-09-05 11:39:03,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-09-05 11:39:03,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1418, Invalid=3552, Unknown=0, NotChecked=0, Total=4970 [2019-09-05 11:39:03,154 INFO L87 Difference]: Start difference. First operand 1345 states and 1956 transitions. Second operand 71 states. [2019-09-05 11:40:22,461 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 13 [2019-09-05 11:41:35,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:41:35,495 INFO L93 Difference]: Finished difference Result 18093 states and 27037 transitions. [2019-09-05 11:41:35,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 885 states. [2019-09-05 11:41:35,495 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 477 [2019-09-05 11:41:35,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:41:35,517 INFO L225 Difference]: With dead ends: 18093 [2019-09-05 11:41:35,517 INFO L226 Difference]: Without dead ends: 16846 [2019-09-05 11:41:35,550 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1407 GetRequests, 457 SyntacticMatches, 0 SemanticMatches, 950 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 491779 ImplicationChecksByTransitivity, 66.1s TimeCoverageRelationStatistics Valid=241013, Invalid=664339, Unknown=0, NotChecked=0, Total=905352 [2019-09-05 11:41:35,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16846 states. [2019-09-05 11:41:36,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16846 to 1385. [2019-09-05 11:41:36,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1385 states. [2019-09-05 11:41:36,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 2016 transitions. [2019-09-05 11:41:36,070 INFO L78 Accepts]: Start accepts. Automaton has 1385 states and 2016 transitions. Word has length 477 [2019-09-05 11:41:36,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:41:36,070 INFO L475 AbstractCegarLoop]: Abstraction has 1385 states and 2016 transitions. [2019-09-05 11:41:36,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-09-05 11:41:36,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 2016 transitions. [2019-09-05 11:41:36,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2019-09-05 11:41:36,075 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:41:36,075 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 48, 48, 48, 48, 48, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:41:36,075 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:41:36,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:41:36,075 INFO L82 PathProgramCache]: Analyzing trace with hash 202302423, now seen corresponding path program 46 times [2019-09-05 11:41:36,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:41:36,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:41:36,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:41:36,076 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:41:36,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:41:36,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:41:37,271 INFO L134 CoverageAnalysis]: Checked inductivity of 9840 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 7536 trivial. 0 not checked. [2019-09-05 11:41:37,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:41:37,271 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:41:37,282 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:41:37,515 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:41:37,515 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:41:37,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 1624 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-05 11:41:37,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:41:37,619 INFO L134 CoverageAnalysis]: Checked inductivity of 9840 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 7536 trivial. 0 not checked. [2019-09-05 11:41:37,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:41:37,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 52 [2019-09-05 11:41:37,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-05 11:41:37,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-05 11:41:37,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 11:41:37,625 INFO L87 Difference]: Start difference. First operand 1385 states and 2016 transitions. Second operand 52 states. [2019-09-05 11:41:40,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:41:40,504 INFO L93 Difference]: Finished difference Result 3228 states and 4813 transitions. [2019-09-05 11:41:40,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-05 11:41:40,504 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 493 [2019-09-05 11:41:40,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:41:40,509 INFO L225 Difference]: With dead ends: 3228 [2019-09-05 11:41:40,509 INFO L226 Difference]: Without dead ends: 1946 [2019-09-05 11:41:40,512 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 543 GetRequests, 493 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 11:41:40,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1946 states. [2019-09-05 11:41:40,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1946 to 1408. [2019-09-05 11:41:40,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1408 states. [2019-09-05 11:41:40,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1408 states to 1408 states and 2049 transitions. [2019-09-05 11:41:40,973 INFO L78 Accepts]: Start accepts. Automaton has 1408 states and 2049 transitions. Word has length 493 [2019-09-05 11:41:40,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:41:40,973 INFO L475 AbstractCegarLoop]: Abstraction has 1408 states and 2049 transitions. [2019-09-05 11:41:40,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-05 11:41:40,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1408 states and 2049 transitions. [2019-09-05 11:41:40,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2019-09-05 11:41:40,978 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:41:40,978 INFO L399 BasicCegarLoop]: trace histogram [49, 49, 49, 49, 49, 49, 49, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:41:40,978 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:41:40,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:41:40,978 INFO L82 PathProgramCache]: Analyzing trace with hash -643040200, now seen corresponding path program 47 times [2019-09-05 11:41:40,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:41:40,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:41:40,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:41:40,979 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:41:40,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:41:41,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:41:42,201 INFO L134 CoverageAnalysis]: Checked inductivity of 10194 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 7793 trivial. 0 not checked. [2019-09-05 11:41:42,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:41:42,201 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:41:42,212 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 11:42:18,767 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 50 check-sat command(s) [2019-09-05 11:42:18,767 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:42:18,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 1647 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-05 11:42:18,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:42:18,897 INFO L134 CoverageAnalysis]: Checked inductivity of 10194 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 7793 trivial. 0 not checked. [2019-09-05 11:42:18,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:42:18,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 53 [2019-09-05 11:42:18,915 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-05 11:42:18,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-05 11:42:18,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-09-05 11:42:18,916 INFO L87 Difference]: Start difference. First operand 1408 states and 2049 transitions. Second operand 53 states. [2019-09-05 11:42:21,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:42:21,287 INFO L93 Difference]: Finished difference Result 3272 states and 4877 transitions. [2019-09-05 11:42:21,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-05 11:42:21,288 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 500 [2019-09-05 11:42:21,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:42:21,292 INFO L225 Difference]: With dead ends: 3272 [2019-09-05 11:42:21,292 INFO L226 Difference]: Without dead ends: 1969 [2019-09-05 11:42:21,295 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 551 GetRequests, 500 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-09-05 11:42:21,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-09-05 11:42:21,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1431. [2019-09-05 11:42:21,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1431 states. [2019-09-05 11:42:21,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1431 states and 2082 transitions. [2019-09-05 11:42:21,766 INFO L78 Accepts]: Start accepts. Automaton has 1431 states and 2082 transitions. Word has length 500 [2019-09-05 11:42:21,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:42:21,766 INFO L475 AbstractCegarLoop]: Abstraction has 1431 states and 2082 transitions. [2019-09-05 11:42:21,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-05 11:42:21,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 2082 transitions. [2019-09-05 11:42:21,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2019-09-05 11:42:21,770 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:42:21,770 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 50, 50, 50, 50, 50, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:42:21,771 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:42:21,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:42:21,771 INFO L82 PathProgramCache]: Analyzing trace with hash 2142035635, now seen corresponding path program 48 times [2019-09-05 11:42:21,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:42:21,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:42:21,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:21,772 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:42:21,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:42:21,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:42:22,989 INFO L134 CoverageAnalysis]: Checked inductivity of 10555 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 8055 trivial. 0 not checked. [2019-09-05 11:42:22,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:42:22,990 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:42:23,003 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE