/usr/bin/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/forester-heap/sll-01-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 19:22:55,147 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 19:22:55,150 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 19:22:55,165 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 19:22:55,166 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 19:22:55,168 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 19:22:55,170 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 19:22:55,178 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 19:22:55,180 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 19:22:55,181 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 19:22:55,182 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 19:22:55,183 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 19:22:55,183 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 19:22:55,184 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 19:22:55,185 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 19:22:55,186 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 19:22:55,186 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 19:22:55,187 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 19:22:55,189 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 19:22:55,191 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 19:22:55,192 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 19:22:55,193 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 19:22:55,194 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 19:22:55,195 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 19:22:55,197 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 19:22:55,197 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 19:22:55,197 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 19:22:55,198 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 19:22:55,198 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 19:22:55,199 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 19:22:55,200 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 19:22:55,200 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 19:22:55,201 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 19:22:55,202 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 19:22:55,203 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 19:22:55,203 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 19:22:55,203 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 19:22:55,204 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 19:22:55,204 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 19:22:55,205 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 19:22:55,206 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 19:22:55,206 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-11-06 19:22:55,225 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 19:22:55,225 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 19:22:55,227 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 19:22:55,227 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 19:22:55,227 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 19:22:55,227 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 19:22:55,228 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 19:22:55,228 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 19:22:55,228 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 19:22:55,228 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 19:22:55,228 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 19:22:55,228 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 19:22:55,229 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 19:22:55,229 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 19:22:55,229 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 19:22:55,229 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 19:22:55,229 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 19:22:55,230 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 19:22:55,230 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 19:22:55,230 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 19:22:55,230 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 19:22:55,230 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 19:22:55,231 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 19:22:55,231 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 19:22:55,231 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 19:22:55,231 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 19:22:55,231 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 19:22:55,232 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 19:22:55,232 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 19:22:55,499 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 19:22:55,511 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 19:22:55,514 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 19:22:55,515 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 19:22:55,516 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 19:22:55,517 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-01-1.i [2019-11-06 19:22:55,597 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a77c6a672/043a77a3347c4ff4889bd69c2d87b7b1/FLAGe0b1dda3c [2019-11-06 19:22:56,103 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 19:22:56,104 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-01-1.i [2019-11-06 19:22:56,127 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a77c6a672/043a77a3347c4ff4889bd69c2d87b7b1/FLAGe0b1dda3c [2019-11-06 19:22:56,425 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a77c6a672/043a77a3347c4ff4889bd69c2d87b7b1 [2019-11-06 19:22:56,435 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 19:22:56,436 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 19:22:56,438 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 19:22:56,438 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 19:22:56,441 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 19:22:56,442 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:22:56" (1/1) ... [2019-11-06 19:22:56,445 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5932816 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:22:56, skipping insertion in model container [2019-11-06 19:22:56,445 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:22:56" (1/1) ... [2019-11-06 19:22:56,453 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 19:22:56,509 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 19:22:56,922 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 19:22:56,931 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 19:22:56,975 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 19:22:57,026 INFO L192 MainTranslator]: Completed translation [2019-11-06 19:22:57,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:22:57 WrapperNode [2019-11-06 19:22:57,027 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 19:22:57,028 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 19:22:57,028 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 19:22:57,028 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 19:22:57,042 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:22:57" (1/1) ... [2019-11-06 19:22:57,042 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:22:57" (1/1) ... [2019-11-06 19:22:57,059 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:22:57" (1/1) ... [2019-11-06 19:22:57,060 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:22:57" (1/1) ... [2019-11-06 19:22:57,081 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:22:57" (1/1) ... [2019-11-06 19:22:57,097 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:22:57" (1/1) ... [2019-11-06 19:22:57,101 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:22:57" (1/1) ... [2019-11-06 19:22:57,108 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 19:22:57,108 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 19:22:57,109 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 19:22:57,109 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 19:22:57,110 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:22:57" (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-11-06 19:22:57,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 19:22:57,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 19:22:57,183 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 19:22:57,183 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-06 19:22:57,183 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-06 19:22:57,184 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-06 19:22:57,184 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-06 19:22:57,184 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-06 19:22:57,185 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-06 19:22:57,186 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-06 19:22:57,186 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-06 19:22:57,186 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-06 19:22:57,187 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-06 19:22:57,187 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-06 19:22:57,188 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-06 19:22:57,188 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-06 19:22:57,191 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-06 19:22:57,191 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-06 19:22:57,191 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-06 19:22:57,191 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-06 19:22:57,191 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-06 19:22:57,192 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-06 19:22:57,192 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-06 19:22:57,192 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-06 19:22:57,192 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-06 19:22:57,192 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-06 19:22:57,192 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-06 19:22:57,192 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-06 19:22:57,193 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-06 19:22:57,193 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-06 19:22:57,193 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-06 19:22:57,193 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-06 19:22:57,193 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-06 19:22:57,193 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-06 19:22:57,193 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-06 19:22:57,194 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-06 19:22:57,194 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-06 19:22:57,194 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-06 19:22:57,194 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-06 19:22:57,194 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-06 19:22:57,194 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-06 19:22:57,195 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-06 19:22:57,195 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-06 19:22:57,195 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-06 19:22:57,196 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-06 19:22:57,196 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-06 19:22:57,196 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-06 19:22:57,196 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-06 19:22:57,196 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-06 19:22:57,196 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-06 19:22:57,196 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-06 19:22:57,197 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-06 19:22:57,197 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-06 19:22:57,197 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-06 19:22:57,197 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-06 19:22:57,197 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-06 19:22:57,197 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-06 19:22:57,197 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-06 19:22:57,198 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-06 19:22:57,198 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-06 19:22:57,198 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-06 19:22:57,198 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-06 19:22:57,198 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-06 19:22:57,198 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-06 19:22:57,198 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-06 19:22:57,199 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-06 19:22:57,199 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-06 19:22:57,199 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-06 19:22:57,200 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-06 19:22:57,200 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-06 19:22:57,201 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-06 19:22:57,201 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-06 19:22:57,201 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-06 19:22:57,201 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-06 19:22:57,202 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-06 19:22:57,202 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-06 19:22:57,202 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-06 19:22:57,202 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-06 19:22:57,203 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-06 19:22:57,203 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-06 19:22:57,203 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-06 19:22:57,203 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-06 19:22:57,204 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-06 19:22:57,204 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-06 19:22:57,204 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-06 19:22:57,204 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-06 19:22:57,204 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-06 19:22:57,205 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-06 19:22:57,206 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-06 19:22:57,206 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-06 19:22:57,206 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-06 19:22:57,207 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-06 19:22:57,207 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-06 19:22:57,207 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-06 19:22:57,207 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-06 19:22:57,208 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-06 19:22:57,208 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-06 19:22:57,208 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-06 19:22:57,208 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-06 19:22:57,208 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-06 19:22:57,208 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-06 19:22:57,208 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-06 19:22:57,209 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-06 19:22:57,209 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-06 19:22:57,209 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-06 19:22:57,209 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-06 19:22:57,209 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 19:22:57,209 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 19:22:57,209 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 19:22:57,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-06 19:22:57,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-06 19:22:57,210 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-06 19:22:57,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-06 19:22:57,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 19:22:57,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 19:22:57,924 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 19:22:57,924 INFO L284 CfgBuilder]: Removed 30 assume(true) statements. [2019-11-06 19:22:57,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:22:57 BoogieIcfgContainer [2019-11-06 19:22:57,926 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 19:22:57,927 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 19:22:57,927 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 19:22:57,930 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 19:22:57,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:22:56" (1/3) ... [2019-11-06 19:22:57,931 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28a317f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:22:57, skipping insertion in model container [2019-11-06 19:22:57,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:22:57" (2/3) ... [2019-11-06 19:22:57,932 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28a317f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:22:57, skipping insertion in model container [2019-11-06 19:22:57,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:22:57" (3/3) ... [2019-11-06 19:22:57,934 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-01-1.i [2019-11-06 19:22:57,943 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 19:22:57,952 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2019-11-06 19:22:57,963 INFO L249 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2019-11-06 19:22:57,989 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 19:22:57,989 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 19:22:57,989 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 19:22:57,989 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 19:22:57,990 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 19:22:57,990 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 19:22:57,990 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 19:22:57,990 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 19:22:58,012 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states. [2019-11-06 19:22:58,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-06 19:22:58,019 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:22:58,020 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:22:58,023 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:22:58,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:22:58,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1861454184, now seen corresponding path program 1 times [2019-11-06 19:22:58,039 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:22:58,039 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33071822] [2019-11-06 19:22:58,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:22:58,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:22:58,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:22:58,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:22:58,250 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33071822] [2019-11-06 19:22:58,251 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:22:58,251 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 19:22:58,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941433718] [2019-11-06 19:22:58,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 19:22:58,259 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:22:58,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 19:22:58,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 19:22:58,276 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 4 states. [2019-11-06 19:22:58,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:22:58,589 INFO L93 Difference]: Finished difference Result 186 states and 302 transitions. [2019-11-06 19:22:58,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 19:22:58,591 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-06 19:22:58,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:22:58,602 INFO L225 Difference]: With dead ends: 186 [2019-11-06 19:22:58,602 INFO L226 Difference]: Without dead ends: 99 [2019-11-06 19:22:58,606 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 19:22:58,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-06 19:22:58,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 81. [2019-11-06 19:22:58,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-06 19:22:58,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2019-11-06 19:22:58,653 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 8 [2019-11-06 19:22:58,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:22:58,653 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2019-11-06 19:22:58,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 19:22:58,653 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2019-11-06 19:22:58,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-06 19:22:58,654 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:22:58,654 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:22:58,655 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:22:58,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:22:58,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1461031906, now seen corresponding path program 1 times [2019-11-06 19:22:58,656 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:22:58,656 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462523033] [2019-11-06 19:22:58,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:22:58,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:22:58,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:22:58,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:22:58,728 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462523033] [2019-11-06 19:22:58,728 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:22:58,728 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 19:22:58,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110748768] [2019-11-06 19:22:58,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 19:22:58,730 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:22:58,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 19:22:58,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 19:22:58,731 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand 4 states. [2019-11-06 19:22:58,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:22:58,907 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2019-11-06 19:22:58,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 19:22:58,907 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-06 19:22:58,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:22:58,909 INFO L225 Difference]: With dead ends: 84 [2019-11-06 19:22:58,909 INFO L226 Difference]: Without dead ends: 82 [2019-11-06 19:22:58,910 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 19:22:58,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-11-06 19:22:58,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-11-06 19:22:58,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-06 19:22:58,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2019-11-06 19:22:58,921 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 14 [2019-11-06 19:22:58,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:22:58,921 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2019-11-06 19:22:58,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 19:22:58,922 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2019-11-06 19:22:58,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-06 19:22:58,922 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:22:58,922 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:22:58,923 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:22:58,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:22:58,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1461033828, now seen corresponding path program 1 times [2019-11-06 19:22:58,924 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:22:58,924 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703449524] [2019-11-06 19:22:58,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:22:58,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:22:59,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:22:59,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:22:59,029 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703449524] [2019-11-06 19:22:59,029 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:22:59,030 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 19:22:59,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464094591] [2019-11-06 19:22:59,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 19:22:59,032 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:22:59,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 19:22:59,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-06 19:22:59,033 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand 5 states. [2019-11-06 19:22:59,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:22:59,221 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2019-11-06 19:22:59,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 19:22:59,222 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-06 19:22:59,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:22:59,223 INFO L225 Difference]: With dead ends: 83 [2019-11-06 19:22:59,223 INFO L226 Difference]: Without dead ends: 81 [2019-11-06 19:22:59,224 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-06 19:22:59,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-11-06 19:22:59,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2019-11-06 19:22:59,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-06 19:22:59,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2019-11-06 19:22:59,232 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 14 [2019-11-06 19:22:59,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:22:59,232 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 88 transitions. [2019-11-06 19:22:59,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 19:22:59,233 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2019-11-06 19:22:59,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-06 19:22:59,233 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:22:59,233 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:22:59,234 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:22:59,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:22:59,235 INFO L82 PathProgramCache]: Analyzing trace with hash 177734485, now seen corresponding path program 1 times [2019-11-06 19:22:59,235 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:22:59,235 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319884327] [2019-11-06 19:22:59,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:22:59,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:22:59,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:22:59,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:22:59,324 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319884327] [2019-11-06 19:22:59,324 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:22:59,324 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 19:22:59,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989501410] [2019-11-06 19:22:59,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 19:22:59,327 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:22:59,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 19:22:59,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 19:22:59,330 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. Second operand 4 states. [2019-11-06 19:22:59,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:22:59,506 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2019-11-06 19:22:59,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 19:22:59,507 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-11-06 19:22:59,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:22:59,508 INFO L225 Difference]: With dead ends: 82 [2019-11-06 19:22:59,508 INFO L226 Difference]: Without dead ends: 78 [2019-11-06 19:22:59,509 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 19:22:59,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-06 19:22:59,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75. [2019-11-06 19:22:59,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-06 19:22:59,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2019-11-06 19:22:59,517 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 19 [2019-11-06 19:22:59,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:22:59,518 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2019-11-06 19:22:59,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 19:22:59,518 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2019-11-06 19:22:59,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-06 19:22:59,519 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:22:59,519 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:22:59,520 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:22:59,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:22:59,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1214805939, now seen corresponding path program 1 times [2019-11-06 19:22:59,520 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:22:59,521 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204126323] [2019-11-06 19:22:59,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:22:59,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:22:59,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:22:59,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:22:59,623 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204126323] [2019-11-06 19:22:59,623 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:22:59,628 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 19:22:59,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178242294] [2019-11-06 19:22:59,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 19:22:59,629 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:22:59,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 19:22:59,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-06 19:22:59,630 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand 6 states. [2019-11-06 19:22:59,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:22:59,837 INFO L93 Difference]: Finished difference Result 134 states and 148 transitions. [2019-11-06 19:22:59,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 19:22:59,838 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-11-06 19:22:59,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:22:59,840 INFO L225 Difference]: With dead ends: 134 [2019-11-06 19:22:59,840 INFO L226 Difference]: Without dead ends: 114 [2019-11-06 19:22:59,840 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-06 19:22:59,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-06 19:22:59,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 74. [2019-11-06 19:22:59,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-06 19:22:59,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2019-11-06 19:22:59,848 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 20 [2019-11-06 19:22:59,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:22:59,848 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2019-11-06 19:22:59,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 19:22:59,849 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2019-11-06 19:22:59,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-06 19:22:59,850 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:22:59,850 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:22:59,850 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:22:59,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:22:59,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1924122782, now seen corresponding path program 1 times [2019-11-06 19:22:59,852 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:22:59,852 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326629382] [2019-11-06 19:22:59,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:22:59,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:22:59,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:22:59,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:22:59,914 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326629382] [2019-11-06 19:22:59,914 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:22:59,914 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 19:22:59,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195568555] [2019-11-06 19:22:59,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 19:22:59,916 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:22:59,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 19:22:59,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 19:22:59,917 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand 4 states. [2019-11-06 19:23:00,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:00,037 INFO L93 Difference]: Finished difference Result 139 states and 157 transitions. [2019-11-06 19:23:00,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 19:23:00,039 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-06 19:23:00,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:00,040 INFO L225 Difference]: With dead ends: 139 [2019-11-06 19:23:00,040 INFO L226 Difference]: Without dead ends: 98 [2019-11-06 19:23:00,041 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 19:23:00,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-06 19:23:00,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 77. [2019-11-06 19:23:00,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-06 19:23:00,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2019-11-06 19:23:00,053 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 24 [2019-11-06 19:23:00,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:00,054 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2019-11-06 19:23:00,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 19:23:00,056 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2019-11-06 19:23:00,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-06 19:23:00,057 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:00,057 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:23:00,058 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:00,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:00,058 INFO L82 PathProgramCache]: Analyzing trace with hash -481740404, now seen corresponding path program 1 times [2019-11-06 19:23:00,058 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:00,058 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264552743] [2019-11-06 19:23:00,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:00,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:00,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:00,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:00,122 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264552743] [2019-11-06 19:23:00,123 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:23:00,123 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 19:23:00,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318281557] [2019-11-06 19:23:00,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 19:23:00,124 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:00,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 19:23:00,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 19:23:00,125 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand 4 states. [2019-11-06 19:23:00,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:00,243 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2019-11-06 19:23:00,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 19:23:00,244 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-11-06 19:23:00,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:00,245 INFO L225 Difference]: With dead ends: 77 [2019-11-06 19:23:00,245 INFO L226 Difference]: Without dead ends: 75 [2019-11-06 19:23:00,245 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 19:23:00,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-06 19:23:00,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-11-06 19:23:00,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-06 19:23:00,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2019-11-06 19:23:00,251 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 25 [2019-11-06 19:23:00,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:00,251 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2019-11-06 19:23:00,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 19:23:00,252 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2019-11-06 19:23:00,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-06 19:23:00,252 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:00,253 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:23:00,253 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:00,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:00,254 INFO L82 PathProgramCache]: Analyzing trace with hash -611625627, now seen corresponding path program 1 times [2019-11-06 19:23:00,254 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:00,254 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548645431] [2019-11-06 19:23:00,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:00,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:00,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:00,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:00,338 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548645431] [2019-11-06 19:23:00,338 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:23:00,338 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 19:23:00,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765016884] [2019-11-06 19:23:00,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 19:23:00,339 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:00,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 19:23:00,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-06 19:23:00,340 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand 5 states. [2019-11-06 19:23:00,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:00,482 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2019-11-06 19:23:00,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 19:23:00,483 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-11-06 19:23:00,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:00,484 INFO L225 Difference]: With dead ends: 76 [2019-11-06 19:23:00,484 INFO L226 Difference]: Without dead ends: 74 [2019-11-06 19:23:00,485 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-06 19:23:00,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-06 19:23:00,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-11-06 19:23:00,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-06 19:23:00,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2019-11-06 19:23:00,490 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 27 [2019-11-06 19:23:00,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:00,490 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2019-11-06 19:23:00,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 19:23:00,490 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2019-11-06 19:23:00,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-06 19:23:00,491 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:00,491 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:23:00,492 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:00,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:00,492 INFO L82 PathProgramCache]: Analyzing trace with hash -2038545261, now seen corresponding path program 1 times [2019-11-06 19:23:00,493 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:00,493 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062564433] [2019-11-06 19:23:00,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:00,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:00,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:00,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:00,546 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062564433] [2019-11-06 19:23:00,546 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:23:00,546 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 19:23:00,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387030765] [2019-11-06 19:23:00,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 19:23:00,547 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:00,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 19:23:00,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 19:23:00,548 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand 5 states. [2019-11-06 19:23:00,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:00,743 INFO L93 Difference]: Finished difference Result 187 states and 212 transitions. [2019-11-06 19:23:00,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 19:23:00,744 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-11-06 19:23:00,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:00,745 INFO L225 Difference]: With dead ends: 187 [2019-11-06 19:23:00,745 INFO L226 Difference]: Without dead ends: 126 [2019-11-06 19:23:00,746 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 19:23:00,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-11-06 19:23:00,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 75. [2019-11-06 19:23:00,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-06 19:23:00,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2019-11-06 19:23:00,751 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 28 [2019-11-06 19:23:00,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:00,752 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2019-11-06 19:23:00,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 19:23:00,752 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2019-11-06 19:23:00,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-06 19:23:00,753 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:00,753 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:23:00,754 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:00,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:00,754 INFO L82 PathProgramCache]: Analyzing trace with hash 668074133, now seen corresponding path program 1 times [2019-11-06 19:23:00,754 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:00,754 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293879776] [2019-11-06 19:23:00,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:00,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:00,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:00,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:00,832 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293879776] [2019-11-06 19:23:00,832 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:23:00,832 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-06 19:23:00,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077351495] [2019-11-06 19:23:00,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-06 19:23:00,833 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:00,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-06 19:23:00,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-06 19:23:00,834 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand 7 states. [2019-11-06 19:23:01,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:01,104 INFO L93 Difference]: Finished difference Result 179 states and 203 transitions. [2019-11-06 19:23:01,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-06 19:23:01,104 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2019-11-06 19:23:01,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:01,106 INFO L225 Difference]: With dead ends: 179 [2019-11-06 19:23:01,106 INFO L226 Difference]: Without dead ends: 137 [2019-11-06 19:23:01,108 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-06 19:23:01,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-11-06 19:23:01,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 85. [2019-11-06 19:23:01,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-06 19:23:01,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 96 transitions. [2019-11-06 19:23:01,114 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 96 transitions. Word has length 28 [2019-11-06 19:23:01,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:01,114 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 96 transitions. [2019-11-06 19:23:01,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-06 19:23:01,115 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 96 transitions. [2019-11-06 19:23:01,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-06 19:23:01,116 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:01,116 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:23:01,116 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:01,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:01,117 INFO L82 PathProgramCache]: Analyzing trace with hash 567478293, now seen corresponding path program 1 times [2019-11-06 19:23:01,117 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:01,117 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820841557] [2019-11-06 19:23:01,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:01,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:01,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:01,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:01,444 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820841557] [2019-11-06 19:23:01,444 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:23:01,444 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-06 19:23:01,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528867907] [2019-11-06 19:23:01,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 19:23:01,445 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:01,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 19:23:01,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-06 19:23:01,446 INFO L87 Difference]: Start difference. First operand 85 states and 96 transitions. Second operand 10 states. [2019-11-06 19:23:02,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:02,067 INFO L93 Difference]: Finished difference Result 174 states and 195 transitions. [2019-11-06 19:23:02,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-06 19:23:02,068 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2019-11-06 19:23:02,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:02,069 INFO L225 Difference]: With dead ends: 174 [2019-11-06 19:23:02,069 INFO L226 Difference]: Without dead ends: 172 [2019-11-06 19:23:02,070 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2019-11-06 19:23:02,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-11-06 19:23:02,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 104. [2019-11-06 19:23:02,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-06 19:23:02,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 120 transitions. [2019-11-06 19:23:02,078 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 120 transitions. Word has length 28 [2019-11-06 19:23:02,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:02,078 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 120 transitions. [2019-11-06 19:23:02,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 19:23:02,078 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 120 transitions. [2019-11-06 19:23:02,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-06 19:23:02,079 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:02,080 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:23:02,080 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:02,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:02,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1429819819, now seen corresponding path program 1 times [2019-11-06 19:23:02,081 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:02,081 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981716453] [2019-11-06 19:23:02,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:02,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:02,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:02,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 19:23:02,145 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981716453] [2019-11-06 19:23:02,145 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:23:02,146 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 19:23:02,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917585160] [2019-11-06 19:23:02,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 19:23:02,146 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:02,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 19:23:02,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-06 19:23:02,147 INFO L87 Difference]: Start difference. First operand 104 states and 120 transitions. Second operand 6 states. [2019-11-06 19:23:02,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:02,340 INFO L93 Difference]: Finished difference Result 150 states and 172 transitions. [2019-11-06 19:23:02,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 19:23:02,340 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-11-06 19:23:02,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:02,342 INFO L225 Difference]: With dead ends: 150 [2019-11-06 19:23:02,342 INFO L226 Difference]: Without dead ends: 132 [2019-11-06 19:23:02,342 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-06 19:23:02,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-11-06 19:23:02,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 124. [2019-11-06 19:23:02,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-11-06 19:23:02,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 147 transitions. [2019-11-06 19:23:02,351 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 147 transitions. Word has length 30 [2019-11-06 19:23:02,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:02,351 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 147 transitions. [2019-11-06 19:23:02,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 19:23:02,351 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 147 transitions. [2019-11-06 19:23:02,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-06 19:23:02,352 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:02,353 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:23:02,353 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:02,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:02,353 INFO L82 PathProgramCache]: Analyzing trace with hash -753501909, now seen corresponding path program 1 times [2019-11-06 19:23:02,354 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:02,354 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511966484] [2019-11-06 19:23:02,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:02,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:02,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:02,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 19:23:02,393 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511966484] [2019-11-06 19:23:02,393 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:23:02,393 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 19:23:02,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783761502] [2019-11-06 19:23:02,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 19:23:02,394 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:02,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 19:23:02,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 19:23:02,395 INFO L87 Difference]: Start difference. First operand 124 states and 147 transitions. Second operand 4 states. [2019-11-06 19:23:02,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:02,517 INFO L93 Difference]: Finished difference Result 124 states and 147 transitions. [2019-11-06 19:23:02,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 19:23:02,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-11-06 19:23:02,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:02,519 INFO L225 Difference]: With dead ends: 124 [2019-11-06 19:23:02,519 INFO L226 Difference]: Without dead ends: 122 [2019-11-06 19:23:02,520 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 19:23:02,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-11-06 19:23:02,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2019-11-06 19:23:02,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-11-06 19:23:02,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 145 transitions. [2019-11-06 19:23:02,527 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 145 transitions. Word has length 30 [2019-11-06 19:23:02,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:02,528 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 145 transitions. [2019-11-06 19:23:02,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 19:23:02,528 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 145 transitions. [2019-11-06 19:23:02,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-06 19:23:02,529 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:02,529 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:23:02,530 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:02,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:02,530 INFO L82 PathProgramCache]: Analyzing trace with hash 758661948, now seen corresponding path program 1 times [2019-11-06 19:23:02,530 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:02,530 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272266465] [2019-11-06 19:23:02,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:02,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:02,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:02,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:02,796 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272266465] [2019-11-06 19:23:02,796 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:23:02,797 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-06 19:23:02,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057464808] [2019-11-06 19:23:02,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 19:23:02,798 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:02,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 19:23:02,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-06 19:23:02,798 INFO L87 Difference]: Start difference. First operand 122 states and 145 transitions. Second operand 10 states. [2019-11-06 19:23:03,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:03,407 INFO L93 Difference]: Finished difference Result 200 states and 228 transitions. [2019-11-06 19:23:03,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-06 19:23:03,409 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2019-11-06 19:23:03,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:03,410 INFO L225 Difference]: With dead ends: 200 [2019-11-06 19:23:03,410 INFO L226 Difference]: Without dead ends: 198 [2019-11-06 19:23:03,410 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2019-11-06 19:23:03,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-11-06 19:23:03,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 129. [2019-11-06 19:23:03,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-11-06 19:23:03,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 152 transitions. [2019-11-06 19:23:03,422 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 152 transitions. Word has length 31 [2019-11-06 19:23:03,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:03,422 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 152 transitions. [2019-11-06 19:23:03,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 19:23:03,422 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 152 transitions. [2019-11-06 19:23:03,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-06 19:23:03,423 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:03,424 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:23:03,424 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:03,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:03,424 INFO L82 PathProgramCache]: Analyzing trace with hash -999338862, now seen corresponding path program 1 times [2019-11-06 19:23:03,425 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:03,425 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065034237] [2019-11-06 19:23:03,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:03,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:03,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:03,496 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:03,496 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065034237] [2019-11-06 19:23:03,497 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676881126] [2019-11-06 19:23:03,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:23:03,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:03,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-06 19:23:03,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:23:03,680 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-06 19:23:03,680 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:03,692 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:03,697 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-06 19:23:03,697 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:03,709 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:03,709 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:03,709 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2019-11-06 19:23:03,741 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:03,743 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-11-06 19:23:03,744 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:03,755 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:03,758 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:03,759 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-11-06 19:23:03,759 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:03,773 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:03,773 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:03,774 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2019-11-06 19:23:03,844 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-06 19:23:03,845 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:03,851 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:03,855 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:03,855 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-06 19:23:03,856 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:03,860 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:03,861 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:03,861 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:7 [2019-11-06 19:23:03,868 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:03,868 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 19:23:03,868 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2019-11-06 19:23:03,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996641186] [2019-11-06 19:23:03,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-06 19:23:03,872 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:03,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-06 19:23:03,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-06 19:23:03,872 INFO L87 Difference]: Start difference. First operand 129 states and 152 transitions. Second operand 9 states. [2019-11-06 19:23:04,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:04,239 INFO L93 Difference]: Finished difference Result 218 states and 250 transitions. [2019-11-06 19:23:04,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-06 19:23:04,240 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-11-06 19:23:04,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:04,243 INFO L225 Difference]: With dead ends: 218 [2019-11-06 19:23:04,243 INFO L226 Difference]: Without dead ends: 158 [2019-11-06 19:23:04,243 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-11-06 19:23:04,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-06 19:23:04,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 120. [2019-11-06 19:23:04,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-06 19:23:04,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 137 transitions. [2019-11-06 19:23:04,252 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 137 transitions. Word has length 33 [2019-11-06 19:23:04,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:04,253 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 137 transitions. [2019-11-06 19:23:04,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-06 19:23:04,253 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 137 transitions. [2019-11-06 19:23:04,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-06 19:23:04,253 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:04,254 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:23:04,468 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:23:04,469 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:04,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:04,469 INFO L82 PathProgramCache]: Analyzing trace with hash -2072098386, now seen corresponding path program 1 times [2019-11-06 19:23:04,469 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:04,470 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439667995] [2019-11-06 19:23:04,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:04,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:04,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:04,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:04,660 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439667995] [2019-11-06 19:23:04,660 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496802831] [2019-11-06 19:23:04,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:23:04,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:04,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-06 19:23:04,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:23:04,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:04,905 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2019-11-06 19:23:04,906 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:04,909 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-06 19:23:04,910 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:04,921 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:04,925 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-11-06 19:23:04,925 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:04,928 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2019-11-06 19:23:04,929 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:04,933 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:04,933 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-06 19:23:04,934 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:47, output treesize:9 [2019-11-06 19:23:04,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:04,953 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-06 19:23:04,953 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2019-11-06 19:23:04,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180428526] [2019-11-06 19:23:04,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-06 19:23:04,953 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:04,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-06 19:23:04,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-11-06 19:23:04,954 INFO L87 Difference]: Start difference. First operand 120 states and 137 transitions. Second operand 7 states. [2019-11-06 19:23:05,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:05,358 INFO L93 Difference]: Finished difference Result 181 states and 200 transitions. [2019-11-06 19:23:05,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-06 19:23:05,359 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-11-06 19:23:05,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:05,360 INFO L225 Difference]: With dead ends: 181 [2019-11-06 19:23:05,360 INFO L226 Difference]: Without dead ends: 161 [2019-11-06 19:23:05,361 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2019-11-06 19:23:05,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-11-06 19:23:05,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 119. [2019-11-06 19:23:05,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-11-06 19:23:05,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 135 transitions. [2019-11-06 19:23:05,371 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 135 transitions. Word has length 33 [2019-11-06 19:23:05,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:05,371 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 135 transitions. [2019-11-06 19:23:05,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-06 19:23:05,371 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 135 transitions. [2019-11-06 19:23:05,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-06 19:23:05,372 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:05,372 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:23:05,577 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:23:05,578 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:05,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:05,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1941174974, now seen corresponding path program 1 times [2019-11-06 19:23:05,579 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:05,580 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379819527] [2019-11-06 19:23:05,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:05,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:05,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:05,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:05,619 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379819527] [2019-11-06 19:23:05,619 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:23:05,619 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 19:23:05,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830629476] [2019-11-06 19:23:05,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 19:23:05,620 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:05,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 19:23:05,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 19:23:05,620 INFO L87 Difference]: Start difference. First operand 119 states and 135 transitions. Second operand 4 states. [2019-11-06 19:23:05,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:05,783 INFO L93 Difference]: Finished difference Result 224 states and 258 transitions. [2019-11-06 19:23:05,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 19:23:05,784 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-06 19:23:05,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:05,785 INFO L225 Difference]: With dead ends: 224 [2019-11-06 19:23:05,785 INFO L226 Difference]: Without dead ends: 169 [2019-11-06 19:23:05,786 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 19:23:05,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-11-06 19:23:05,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 142. [2019-11-06 19:23:05,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-11-06 19:23:05,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 163 transitions. [2019-11-06 19:23:05,796 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 163 transitions. Word has length 35 [2019-11-06 19:23:05,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:05,796 INFO L462 AbstractCegarLoop]: Abstraction has 142 states and 163 transitions. [2019-11-06 19:23:05,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 19:23:05,796 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 163 transitions. [2019-11-06 19:23:05,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-06 19:23:05,797 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:05,797 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:23:05,797 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:05,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:05,798 INFO L82 PathProgramCache]: Analyzing trace with hash 930038423, now seen corresponding path program 1 times [2019-11-06 19:23:05,798 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:05,798 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402129643] [2019-11-06 19:23:05,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:05,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:05,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:05,893 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:05,893 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402129643] [2019-11-06 19:23:05,894 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801194792] [2019-11-06 19:23:05,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:23:05,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:05,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-06 19:23:06,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:23:06,024 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-06 19:23:06,025 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:06,029 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:06,029 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:06,030 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-06 19:23:06,111 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|], 2=[|#memory_$Pointer$.offset|]} [2019-11-06 19:23:06,119 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-06 19:23:06,120 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:06,128 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:06,132 INFO L341 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-11-06 19:23:06,132 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 10 [2019-11-06 19:23:06,133 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:06,136 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:06,137 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:06,137 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:7 [2019-11-06 19:23:06,141 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:06,141 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 19:23:06,141 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-11-06 19:23:06,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72732273] [2019-11-06 19:23:06,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-06 19:23:06,142 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:06,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-06 19:23:06,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-11-06 19:23:06,143 INFO L87 Difference]: Start difference. First operand 142 states and 163 transitions. Second operand 11 states. [2019-11-06 19:23:06,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:06,605 INFO L93 Difference]: Finished difference Result 264 states and 299 transitions. [2019-11-06 19:23:06,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-06 19:23:06,605 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2019-11-06 19:23:06,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:06,607 INFO L225 Difference]: With dead ends: 264 [2019-11-06 19:23:06,607 INFO L226 Difference]: Without dead ends: 233 [2019-11-06 19:23:06,608 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-11-06 19:23:06,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-11-06 19:23:06,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 169. [2019-11-06 19:23:06,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-11-06 19:23:06,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 200 transitions. [2019-11-06 19:23:06,618 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 200 transitions. Word has length 36 [2019-11-06 19:23:06,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:06,618 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 200 transitions. [2019-11-06 19:23:06,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-06 19:23:06,619 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 200 transitions. [2019-11-06 19:23:06,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-06 19:23:06,619 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:06,619 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:23:06,823 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:23:06,824 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:06,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:06,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1341973316, now seen corresponding path program 1 times [2019-11-06 19:23:06,825 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:06,825 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377512560] [2019-11-06 19:23:06,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:06,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:07,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:07,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:07,065 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377512560] [2019-11-06 19:23:07,065 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541934175] [2019-11-06 19:23:07,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:23:07,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:07,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-06 19:23:07,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:23:07,194 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-06 19:23:07,194 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:07,202 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:07,202 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:07,203 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-06 19:23:07,210 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-06 19:23:07,211 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:07,220 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:07,224 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-06 19:23:07,224 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:07,234 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:07,234 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:07,238 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2019-11-06 19:23:07,296 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:07,297 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-06 19:23:07,297 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:07,328 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:07,347 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:07,351 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2019-11-06 19:23:07,352 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:07,379 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:07,387 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:07,391 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2019-11-06 19:23:07,392 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:07,414 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:07,415 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:07,416 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:86, output treesize:47 [2019-11-06 19:23:07,460 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_38|], 12=[|v_#memory_$Pointer$.base_37|]} [2019-11-06 19:23:07,468 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:07,469 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2019-11-06 19:23:07,470 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:07,497 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:07,502 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:07,594 INFO L341 Elim1Store]: treesize reduction 46, result has 65.2 percent of original size [2019-11-06 19:23:07,595 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 74 treesize of output 124 [2019-11-06 19:23:07,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:07,603 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:07,651 INFO L567 ElimStorePlain]: treesize reduction 64, result has 54.9 percent of original size [2019-11-06 19:23:07,652 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:07,652 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:94, output treesize:78 [2019-11-06 19:23:07,779 INFO L392 ElimStorePlain]: Different costs {6=[|#memory_$Pointer$.offset|], 10=[|#memory_$Pointer$.base|]} [2019-11-06 19:23:07,784 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:07,785 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 13 [2019-11-06 19:23:07,785 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:07,797 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:07,859 INFO L341 Elim1Store]: treesize reduction 10, result has 84.1 percent of original size [2019-11-06 19:23:07,860 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 72 [2019-11-06 19:23:07,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:07,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:07,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:07,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:07,864 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:07,879 INFO L567 ElimStorePlain]: treesize reduction 26, result has 29.7 percent of original size [2019-11-06 19:23:07,879 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:07,879 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:85, output treesize:7 [2019-11-06 19:23:07,897 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:07,897 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 19:23:07,897 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 14 [2019-11-06 19:23:07,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658515152] [2019-11-06 19:23:07,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-06 19:23:07,898 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:07,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-06 19:23:07,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=139, Unknown=1, NotChecked=0, Total=182 [2019-11-06 19:23:07,899 INFO L87 Difference]: Start difference. First operand 169 states and 200 transitions. Second operand 14 states. [2019-11-06 19:23:09,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:09,264 INFO L93 Difference]: Finished difference Result 469 states and 550 transitions. [2019-11-06 19:23:09,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-06 19:23:09,266 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 40 [2019-11-06 19:23:09,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:09,269 INFO L225 Difference]: With dead ends: 469 [2019-11-06 19:23:09,269 INFO L226 Difference]: Without dead ends: 381 [2019-11-06 19:23:09,270 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=209, Invalid=658, Unknown=3, NotChecked=0, Total=870 [2019-11-06 19:23:09,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-11-06 19:23:09,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 203. [2019-11-06 19:23:09,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-11-06 19:23:09,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 240 transitions. [2019-11-06 19:23:09,284 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 240 transitions. Word has length 40 [2019-11-06 19:23:09,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:09,284 INFO L462 AbstractCegarLoop]: Abstraction has 203 states and 240 transitions. [2019-11-06 19:23:09,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-06 19:23:09,284 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 240 transitions. [2019-11-06 19:23:09,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-06 19:23:09,285 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:09,285 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:23:09,489 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:23:09,490 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:09,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:09,490 INFO L82 PathProgramCache]: Analyzing trace with hash -2026576836, now seen corresponding path program 1 times [2019-11-06 19:23:09,491 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:09,491 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611311440] [2019-11-06 19:23:09,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:09,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:10,007 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 35 [2019-11-06 19:23:10,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:10,475 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:10,475 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611311440] [2019-11-06 19:23:10,475 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923978017] [2019-11-06 19:23:10,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:23:10,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:10,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 41 conjunts are in the unsatisfiable core [2019-11-06 19:23:10,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:23:10,643 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-06 19:23:10,644 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:10,647 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:10,648 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:10,648 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-06 19:23:10,712 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:10,713 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-06 19:23:10,713 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:10,795 INFO L567 ElimStorePlain]: treesize reduction 14, result has 96.3 percent of original size [2019-11-06 19:23:10,800 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:10,822 INFO L341 Elim1Store]: treesize reduction 89, result has 7.3 percent of original size [2019-11-06 19:23:10,822 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 130 [2019-11-06 19:23:10,823 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:10,859 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:10,862 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:10,866 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 31 [2019-11-06 19:23:10,866 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:10,888 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:10,889 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:10,889 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:362, output treesize:91 [2019-11-06 19:23:11,041 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:11,041 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 32 [2019-11-06 19:23:11,042 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:11,088 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:11,095 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:11,101 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 19:23:11,144 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:11,144 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 100 treesize of output 147 [2019-11-06 19:23:11,147 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:11,269 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 43 [2019-11-06 19:23:11,269 INFO L567 ElimStorePlain]: treesize reduction 160, result has 42.9 percent of original size [2019-11-06 19:23:11,279 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:11,282 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:11,284 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 59 [2019-11-06 19:23:11,285 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:11,308 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:11,309 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:11,310 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:150, output treesize:100 [2019-11-06 19:23:11,384 INFO L392 ElimStorePlain]: Different costs {18=[|v_#memory_$Pointer$.offset_41|], 28=[|v_#memory_$Pointer$.base_40|]} [2019-11-06 19:23:11,387 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:11,389 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:11,392 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 72 [2019-11-06 19:23:11,393 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:11,434 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:11,439 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:11,441 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 19:23:11,648 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2019-11-06 19:23:11,649 INFO L341 Elim1Store]: treesize reduction 70, result has 71.1 percent of original size [2019-11-06 19:23:11,649 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 131 treesize of output 234 [2019-11-06 19:23:11,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:11,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:11,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:11,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:11,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:11,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:11,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:11,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:11,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:11,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:11,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:11,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:11,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:11,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:11,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:11,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:11,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:11,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:11,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:11,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:11,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:11,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:11,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:11,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:11,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:11,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:11,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:11,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:11,807 INFO L496 ElimStorePlain]: Start of recursive call 3: 57 dim-0 vars, End of recursive call: 57 dim-0 vars, and 11 xjuncts. [2019-11-06 19:23:18,738 WARN L191 SmtUtils]: Spent 6.93 s on a formula simplification. DAG size of input: 1156 DAG size of output: 655 [2019-11-06 19:23:18,739 INFO L567 ElimStorePlain]: treesize reduction 11464, result has 26.4 percent of original size [2019-11-06 19:23:18,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-11-06 19:23:18,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-06 19:23:18,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:18,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:18,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-06 19:23:18,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:18,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:18,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:18,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:18,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:18,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:18,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-06 19:23:18,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:18,765 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 27 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:18,766 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:151, output treesize:3512 [2019-11-06 19:23:18,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:18,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:19,352 WARN L191 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 467 DAG size of output: 44 [2019-11-06 19:23:19,507 INFO L392 ElimStorePlain]: Different costs {25=[|#memory_$Pointer$.offset|], 32=[|#memory_$Pointer$.base|]} [2019-11-06 19:23:19,517 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:19,518 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:19,529 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:19,529 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 53 [2019-11-06 19:23:19,530 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:19,546 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:19,719 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-11-06 19:23:19,719 INFO L341 Elim1Store]: treesize reduction 10, result has 92.4 percent of original size [2019-11-06 19:23:19,720 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 78 treesize of output 150 [2019-11-06 19:23:19,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:19,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:19,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:19,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:19,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:19,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:19,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:19,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:19,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:19,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:19,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:19,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:19,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:19,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:19,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:19,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:19,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:19,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:19,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:19,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:19,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:19,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:19,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:19,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:19,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:19,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:19,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:19,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:19,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:19,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:19,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:19,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:19,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:19,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:19,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:19,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:19,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:19,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:19,742 INFO L496 ElimStorePlain]: Start of recursive call 3: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:19,831 INFO L567 ElimStorePlain]: treesize reduction 208, result has 7.1 percent of original size [2019-11-06 19:23:19,831 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:19,832 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:154, output treesize:7 [2019-11-06 19:23:19,850 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:19,850 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 19:23:19,851 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10] total 24 [2019-11-06 19:23:19,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005098548] [2019-11-06 19:23:19,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-06 19:23:19,851 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:19,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-06 19:23:19,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=460, Unknown=1, NotChecked=0, Total=552 [2019-11-06 19:23:19,852 INFO L87 Difference]: Start difference. First operand 203 states and 240 transitions. Second operand 24 states. [2019-11-06 19:23:20,381 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-11-06 19:23:20,995 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 72 [2019-11-06 19:23:21,259 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2019-11-06 19:23:22,340 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-11-06 19:23:22,566 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 94 [2019-11-06 19:23:22,968 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-11-06 19:23:23,485 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-11-06 19:23:23,690 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-11-06 19:23:23,893 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 63 [2019-11-06 19:23:24,058 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 88 [2019-11-06 19:23:24,347 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 96 [2019-11-06 19:23:24,743 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 101 [2019-11-06 19:23:25,041 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2019-11-06 19:23:25,261 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-11-06 19:23:25,702 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 64 [2019-11-06 19:23:25,966 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 80 [2019-11-06 19:23:26,150 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 70 [2019-11-06 19:23:26,394 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 67 [2019-11-06 19:23:26,584 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-11-06 19:23:26,905 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-11-06 19:23:27,057 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-11-06 19:23:27,354 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 71 [2019-11-06 19:23:27,597 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-11-06 19:23:27,870 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-11-06 19:23:28,103 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-11-06 19:23:28,616 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 41 [2019-11-06 19:23:28,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:28,685 INFO L93 Difference]: Finished difference Result 742 states and 864 transitions. [2019-11-06 19:23:28,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-11-06 19:23:28,685 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 40 [2019-11-06 19:23:28,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:28,689 INFO L225 Difference]: With dead ends: 742 [2019-11-06 19:23:28,689 INFO L226 Difference]: Without dead ends: 740 [2019-11-06 19:23:28,692 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1713 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=1470, Invalid=4224, Unknown=6, NotChecked=0, Total=5700 [2019-11-06 19:23:28,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2019-11-06 19:23:28,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 269. [2019-11-06 19:23:28,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-11-06 19:23:28,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 322 transitions. [2019-11-06 19:23:28,712 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 322 transitions. Word has length 40 [2019-11-06 19:23:28,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:28,712 INFO L462 AbstractCegarLoop]: Abstraction has 269 states and 322 transitions. [2019-11-06 19:23:28,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-06 19:23:28,712 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 322 transitions. [2019-11-06 19:23:28,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-06 19:23:28,713 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:28,713 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:23:28,927 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:23:28,928 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:28,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:28,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1168199972, now seen corresponding path program 1 times [2019-11-06 19:23:28,929 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:28,929 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603788657] [2019-11-06 19:23:28,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:28,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:28,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:28,980 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:28,980 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603788657] [2019-11-06 19:23:28,982 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:23:28,982 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 19:23:28,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160860172] [2019-11-06 19:23:28,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 19:23:28,984 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:28,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 19:23:28,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-06 19:23:28,986 INFO L87 Difference]: Start difference. First operand 269 states and 322 transitions. Second operand 6 states. [2019-11-06 19:23:29,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:29,140 INFO L93 Difference]: Finished difference Result 345 states and 410 transitions. [2019-11-06 19:23:29,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 19:23:29,140 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-11-06 19:23:29,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:29,142 INFO L225 Difference]: With dead ends: 345 [2019-11-06 19:23:29,142 INFO L226 Difference]: Without dead ends: 209 [2019-11-06 19:23:29,145 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-06 19:23:29,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-11-06 19:23:29,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 202. [2019-11-06 19:23:29,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-11-06 19:23:29,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 233 transitions. [2019-11-06 19:23:29,157 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 233 transitions. Word has length 42 [2019-11-06 19:23:29,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:29,158 INFO L462 AbstractCegarLoop]: Abstraction has 202 states and 233 transitions. [2019-11-06 19:23:29,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 19:23:29,158 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 233 transitions. [2019-11-06 19:23:29,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-06 19:23:29,158 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:29,159 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:23:29,159 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:29,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:29,159 INFO L82 PathProgramCache]: Analyzing trace with hash 608870837, now seen corresponding path program 1 times [2019-11-06 19:23:29,159 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:29,160 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044548565] [2019-11-06 19:23:29,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:29,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:29,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:30,010 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:30,010 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044548565] [2019-11-06 19:23:30,010 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604027190] [2019-11-06 19:23:30,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:23:30,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:30,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 41 conjunts are in the unsatisfiable core [2019-11-06 19:23:30,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:23:30,131 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-06 19:23:30,131 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:30,140 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:30,140 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:30,140 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-06 19:23:30,194 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:30,195 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-06 19:23:30,196 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:30,284 INFO L567 ElimStorePlain]: treesize reduction 14, result has 96.3 percent of original size [2019-11-06 19:23:30,290 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:30,306 INFO L341 Elim1Store]: treesize reduction 89, result has 7.3 percent of original size [2019-11-06 19:23:30,306 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 130 [2019-11-06 19:23:30,307 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:30,331 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:30,334 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:30,337 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 31 [2019-11-06 19:23:30,337 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:30,357 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:30,358 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:30,359 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:362, output treesize:91 [2019-11-06 19:23:30,491 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:30,491 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 32 [2019-11-06 19:23:30,492 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:30,529 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:30,536 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:30,538 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 59 [2019-11-06 19:23:30,539 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:30,574 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:30,579 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:30,583 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 19:23:30,632 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:30,633 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 100 treesize of output 147 [2019-11-06 19:23:30,634 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:30,750 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 41 [2019-11-06 19:23:30,751 INFO L567 ElimStorePlain]: treesize reduction 160, result has 40.1 percent of original size [2019-11-06 19:23:30,751 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:30,751 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:150, output treesize:100 [2019-11-06 19:23:30,821 INFO L392 ElimStorePlain]: Different costs {18=[|v_#memory_$Pointer$.offset_44|], 28=[|v_#memory_$Pointer$.base_43|]} [2019-11-06 19:23:30,828 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:30,829 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:30,831 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 72 [2019-11-06 19:23:30,832 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:30,864 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:30,868 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:30,870 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 19:23:31,057 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2019-11-06 19:23:31,057 INFO L341 Elim1Store]: treesize reduction 70, result has 71.1 percent of original size [2019-11-06 19:23:31,058 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 131 treesize of output 234 [2019-11-06 19:23:31,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:31,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:31,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:31,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:31,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:31,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:31,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:31,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:31,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:31,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:31,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:31,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:31,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:31,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:31,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:31,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:31,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:31,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:31,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:31,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:31,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,140 INFO L496 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2019-11-06 19:23:31,451 WARN L191 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 77 [2019-11-06 19:23:31,451 INFO L567 ElimStorePlain]: treesize reduction 409, result has 44.4 percent of original size [2019-11-06 19:23:31,453 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:31,453 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:151, output treesize:389 [2019-11-06 19:23:31,758 INFO L392 ElimStorePlain]: Different costs {25=[|#memory_$Pointer$.offset|], 32=[|#memory_$Pointer$.base|]} [2019-11-06 19:23:31,763 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:31,764 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:31,777 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:31,778 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 49 [2019-11-06 19:23:31,778 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:31,793 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:31,929 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-11-06 19:23:31,930 INFO L341 Elim1Store]: treesize reduction 10, result has 92.4 percent of original size [2019-11-06 19:23:31,930 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 78 treesize of output 150 [2019-11-06 19:23:31,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:31,959 INFO L496 ElimStorePlain]: Start of recursive call 3: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:32,019 INFO L567 ElimStorePlain]: treesize reduction 248, result has 6.1 percent of original size [2019-11-06 19:23:32,019 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:32,020 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:150, output treesize:7 [2019-11-06 19:23:32,044 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:32,045 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 19:23:32,045 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10] total 23 [2019-11-06 19:23:32,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212724463] [2019-11-06 19:23:32,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-06 19:23:32,046 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:32,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-06 19:23:32,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=420, Unknown=1, NotChecked=0, Total=506 [2019-11-06 19:23:32,046 INFO L87 Difference]: Start difference. First operand 202 states and 233 transitions. Second operand 23 states. [2019-11-06 19:23:32,466 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2019-11-06 19:23:32,708 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2019-11-06 19:23:33,222 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 77 [2019-11-06 19:23:33,834 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 65 [2019-11-06 19:23:35,000 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 93 [2019-11-06 19:23:35,215 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 94 [2019-11-06 19:23:36,096 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 64 [2019-11-06 19:23:36,274 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 89 [2019-11-06 19:23:36,787 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 103