/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/dll-simple-white-blue-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 19:22:27,413 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 19:22:27,416 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 19:22:27,433 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 19:22:27,433 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 19:22:27,435 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 19:22:27,437 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 19:22:27,450 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 19:22:27,451 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 19:22:27,453 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 19:22:27,455 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 19:22:27,457 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 19:22:27,457 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 19:22:27,460 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 19:22:27,461 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 19:22:27,462 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 19:22:27,464 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 19:22:27,465 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 19:22:27,466 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 19:22:27,473 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 19:22:27,476 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 19:22:27,477 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 19:22:27,478 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 19:22:27,479 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 19:22:27,483 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 19:22:27,483 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 19:22:27,483 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 19:22:27,485 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 19:22:27,485 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 19:22:27,488 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 19:22:27,489 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 19:22:27,489 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 19:22:27,490 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 19:22:27,491 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 19:22:27,494 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 19:22:27,494 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 19:22:27,495 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 19:22:27,495 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 19:22:27,495 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 19:22:27,496 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 19:22:27,500 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 19:22:27,501 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:27,521 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 19:22:27,522 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 19:22:27,524 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 19:22:27,525 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 19:22:27,525 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 19:22:27,525 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 19:22:27,525 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 19:22:27,526 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 19:22:27,526 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 19:22:27,526 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 19:22:27,527 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 19:22:27,527 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 19:22:27,528 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 19:22:27,528 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 19:22:27,528 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 19:22:27,528 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 19:22:27,529 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 19:22:27,529 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 19:22:27,529 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 19:22:27,529 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 19:22:27,529 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 19:22:27,530 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 19:22:27,530 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 19:22:27,530 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 19:22:27,530 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 19:22:27,531 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 19:22:27,531 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 19:22:27,531 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 19:22:27,531 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 19:22:27,842 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 19:22:27,860 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 19:22:27,863 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 19:22:27,864 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 19:22:27,865 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 19:22:27,865 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-simple-white-blue-2.i [2019-11-06 19:22:27,925 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72496ce6a/f6b39daf9abd4497975bdd634045ce28/FLAG6c0b1ff92 [2019-11-06 19:22:28,529 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 19:22:28,530 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-simple-white-blue-2.i [2019-11-06 19:22:28,542 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72496ce6a/f6b39daf9abd4497975bdd634045ce28/FLAG6c0b1ff92 [2019-11-06 19:22:28,788 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72496ce6a/f6b39daf9abd4497975bdd634045ce28 [2019-11-06 19:22:28,797 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 19:22:28,799 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 19:22:28,799 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 19:22:28,800 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 19:22:28,803 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 19:22:28,804 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:22:28" (1/1) ... [2019-11-06 19:22:28,806 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fae9e20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:22:28, skipping insertion in model container [2019-11-06 19:22:28,806 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:22:28" (1/1) ... [2019-11-06 19:22:28,812 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 19:22:28,856 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 19:22:29,317 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 19:22:29,328 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 19:22:29,383 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 19:22:29,435 INFO L192 MainTranslator]: Completed translation [2019-11-06 19:22:29,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:22:29 WrapperNode [2019-11-06 19:22:29,436 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 19:22:29,437 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 19:22:29,437 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 19:22:29,437 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 19:22:29,448 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:29" (1/1) ... [2019-11-06 19:22:29,448 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:29" (1/1) ... [2019-11-06 19:22:29,473 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:29" (1/1) ... [2019-11-06 19:22:29,473 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:29" (1/1) ... [2019-11-06 19:22:29,495 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:29" (1/1) ... [2019-11-06 19:22:29,502 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:29" (1/1) ... [2019-11-06 19:22:29,505 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:29" (1/1) ... [2019-11-06 19:22:29,511 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 19:22:29,512 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 19:22:29,512 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 19:22:29,512 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 19:22:29,513 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:22:29" (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:29,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 19:22:29,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 19:22:29,569 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 19:22:29,569 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-06 19:22:29,570 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-06 19:22:29,570 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-06 19:22:29,570 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-06 19:22:29,570 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-06 19:22:29,570 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-06 19:22:29,570 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-06 19:22:29,571 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-06 19:22:29,571 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-06 19:22:29,572 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-06 19:22:29,572 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-06 19:22:29,572 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-06 19:22:29,572 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-06 19:22:29,572 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-06 19:22:29,572 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-06 19:22:29,573 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-06 19:22:29,573 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-06 19:22:29,573 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-06 19:22:29,573 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-06 19:22:29,573 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-06 19:22:29,573 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-06 19:22:29,574 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-06 19:22:29,574 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-06 19:22:29,574 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-06 19:22:29,574 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-06 19:22:29,574 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-06 19:22:29,575 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-06 19:22:29,575 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-06 19:22:29,575 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-06 19:22:29,575 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-06 19:22:29,575 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-06 19:22:29,575 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-06 19:22:29,575 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-06 19:22:29,576 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-06 19:22:29,576 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-06 19:22:29,576 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-06 19:22:29,576 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-06 19:22:29,576 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-06 19:22:29,576 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-06 19:22:29,576 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-06 19:22:29,577 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-06 19:22:29,577 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-06 19:22:29,577 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-06 19:22:29,577 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-06 19:22:29,577 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-06 19:22:29,577 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-06 19:22:29,578 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-06 19:22:29,578 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-06 19:22:29,578 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-06 19:22:29,578 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-06 19:22:29,578 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-06 19:22:29,578 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-06 19:22:29,578 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-06 19:22:29,579 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-06 19:22:29,579 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-06 19:22:29,579 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-06 19:22:29,579 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-06 19:22:29,579 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-06 19:22:29,579 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-06 19:22:29,579 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-06 19:22:29,580 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-06 19:22:29,580 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-06 19:22:29,580 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-06 19:22:29,580 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-06 19:22:29,580 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-06 19:22:29,580 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-06 19:22:29,580 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-06 19:22:29,581 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-06 19:22:29,581 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-06 19:22:29,581 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-06 19:22:29,581 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-06 19:22:29,581 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-06 19:22:29,581 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-06 19:22:29,582 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-06 19:22:29,582 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-06 19:22:29,582 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-06 19:22:29,582 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-06 19:22:29,582 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-06 19:22:29,582 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-06 19:22:29,583 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-06 19:22:29,583 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-06 19:22:29,583 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-06 19:22:29,583 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-06 19:22:29,583 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-06 19:22:29,583 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-06 19:22:29,584 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-06 19:22:29,584 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-06 19:22:29,584 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-06 19:22:29,584 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-06 19:22:29,584 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-06 19:22:29,584 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-06 19:22:29,584 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-06 19:22:29,585 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-06 19:22:29,585 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-06 19:22:29,585 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-06 19:22:29,585 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-06 19:22:29,585 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-06 19:22:29,585 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-06 19:22:29,586 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-06 19:22:29,586 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-06 19:22:29,586 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-06 19:22:29,586 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-06 19:22:29,586 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-06 19:22:29,586 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 19:22:29,586 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 19:22:29,586 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 19:22:29,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-06 19:22:29,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-06 19:22:29,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-06 19:22:29,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-06 19:22:29,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-06 19:22:29,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-06 19:22:29,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 19:22:29,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 19:22:30,165 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 19:22:30,165 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-06 19:22:30,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:22:30 BoogieIcfgContainer [2019-11-06 19:22:30,167 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 19:22:30,168 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 19:22:30,168 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 19:22:30,172 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 19:22:30,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:22:28" (1/3) ... [2019-11-06 19:22:30,173 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b09f232 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:22:30, skipping insertion in model container [2019-11-06 19:22:30,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:22:29" (2/3) ... [2019-11-06 19:22:30,173 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b09f232 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:22:30, skipping insertion in model container [2019-11-06 19:22:30,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:22:30" (3/3) ... [2019-11-06 19:22:30,175 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-simple-white-blue-2.i [2019-11-06 19:22:30,185 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 19:22:30,193 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 19:22:30,205 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 19:22:30,229 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 19:22:30,230 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 19:22:30,230 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 19:22:30,230 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 19:22:30,230 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 19:22:30,230 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 19:22:30,231 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 19:22:30,231 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 19:22:30,249 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-11-06 19:22:30,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-06 19:22:30,255 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:22:30,257 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:22:30,259 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:22:30,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:22:30,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1881548223, now seen corresponding path program 1 times [2019-11-06 19:22:30,274 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:22:30,274 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924599401] [2019-11-06 19:22:30,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:22:30,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:22:30,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:22:30,464 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:30,465 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924599401] [2019-11-06 19:22:30,466 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:22:30,466 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 19:22:30,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287757670] [2019-11-06 19:22:30,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 19:22:30,473 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:22:30,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 19:22:30,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 19:22:30,490 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states. [2019-11-06 19:22:30,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:22:30,639 INFO L93 Difference]: Finished difference Result 55 states and 84 transitions. [2019-11-06 19:22:30,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 19:22:30,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-06 19:22:30,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:22:30,654 INFO L225 Difference]: With dead ends: 55 [2019-11-06 19:22:30,654 INFO L226 Difference]: Without dead ends: 24 [2019-11-06 19:22:30,664 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 19:22:30,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-11-06 19:22:30,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-11-06 19:22:30,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-06 19:22:30,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2019-11-06 19:22:30,710 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 15 [2019-11-06 19:22:30,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:22:30,710 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2019-11-06 19:22:30,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 19:22:30,711 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2019-11-06 19:22:30,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-06 19:22:30,711 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:22:30,712 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:22:30,712 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:22:30,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:22:30,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1899192242, now seen corresponding path program 1 times [2019-11-06 19:22:30,713 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:22:30,713 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772004680] [2019-11-06 19:22:30,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:22:30,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:22:30,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:22:31,003 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:31,003 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772004680] [2019-11-06 19:22:31,003 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:22:31,004 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-06 19:22:31,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700201392] [2019-11-06 19:22:31,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-06 19:22:31,006 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:22:31,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-06 19:22:31,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-06 19:22:31,007 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand 8 states. [2019-11-06 19:22:31,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:22:31,382 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2019-11-06 19:22:31,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-06 19:22:31,383 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-11-06 19:22:31,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:22:31,387 INFO L225 Difference]: With dead ends: 48 [2019-11-06 19:22:31,387 INFO L226 Difference]: Without dead ends: 46 [2019-11-06 19:22:31,390 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-11-06 19:22:31,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-06 19:22:31,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 30. [2019-11-06 19:22:31,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-06 19:22:31,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2019-11-06 19:22:31,409 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 17 [2019-11-06 19:22:31,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:22:31,410 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-11-06 19:22:31,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-06 19:22:31,410 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2019-11-06 19:22:31,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-06 19:22:31,412 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:22:31,412 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:22:31,413 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:22:31,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:22:31,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1740484627, now seen corresponding path program 1 times [2019-11-06 19:22:31,413 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:22:31,414 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780041115] [2019-11-06 19:22:31,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:22:31,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:22:31,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:22:31,641 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:22:31,642 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780041115] [2019-11-06 19:22:31,643 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915842150] [2019-11-06 19:22:31,643 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:22:31,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:22:31,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-06 19:22:31,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:22:31,854 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:22:31,855 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:31,874 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:31,883 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:31,884 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:31,886 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:31,888 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2019-11-06 19:22:31,889 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:31,907 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:31,913 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:31,914 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:31,916 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:31,918 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2019-11-06 19:22:31,919 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:31,933 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:31,934 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:22:31,934 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:64, output treesize:41 [2019-11-06 19:22:32,025 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:32,026 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:22:32,026 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:32,078 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:32,097 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 34 treesize of output 21 [2019-11-06 19:22:32,098 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:32,134 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:32,141 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:22:32,166 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:32,173 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:32,174 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:32,175 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:32,178 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 46 [2019-11-06 19:22:32,179 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:32,208 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:32,215 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:32,220 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 37 [2019-11-06 19:22:32,221 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:32,251 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:32,252 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:22:32,253 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:109, output treesize:78 [2019-11-06 19:22:32,428 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:32,498 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:32,498 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 92 treesize of output 134 [2019-11-06 19:22:32,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:32,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:32,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:32,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:32,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:32,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:32,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:32,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:32,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:32,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:32,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:32,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:32,526 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:22:32,569 INFO L567 ElimStorePlain]: treesize reduction 58, result has 45.8 percent of original size [2019-11-06 19:22:32,592 INFO L341 Elim1Store]: treesize reduction 10, result has 63.0 percent of original size [2019-11-06 19:22:32,593 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 35 [2019-11-06 19:22:32,594 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:32,601 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:32,602 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:22:32,602 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:108, output treesize:7 [2019-11-06 19:22:32,608 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:22:32,608 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 19:22:32,609 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2019-11-06 19:22:32,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108659367] [2019-11-06 19:22:32,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-06 19:22:32,610 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:22:32,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-06 19:22:32,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-11-06 19:22:32,611 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 12 states. [2019-11-06 19:22:33,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:22:33,643 INFO L93 Difference]: Finished difference Result 108 states and 135 transitions. [2019-11-06 19:22:33,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-06 19:22:33,643 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2019-11-06 19:22:33,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:22:33,645 INFO L225 Difference]: With dead ends: 108 [2019-11-06 19:22:33,645 INFO L226 Difference]: Without dead ends: 93 [2019-11-06 19:22:33,646 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2019-11-06 19:22:33,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-11-06 19:22:33,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 48. [2019-11-06 19:22:33,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-06 19:22:33,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 62 transitions. [2019-11-06 19:22:33,657 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 62 transitions. Word has length 19 [2019-11-06 19:22:33,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:22:33,657 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 62 transitions. [2019-11-06 19:22:33,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-06 19:22:33,657 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 62 transitions. [2019-11-06 19:22:33,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-06 19:22:33,658 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:22:33,659 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:22:33,861 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:22:33,862 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:22:33,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:22:33,863 INFO L82 PathProgramCache]: Analyzing trace with hash -928390504, now seen corresponding path program 2 times [2019-11-06 19:22:33,863 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:22:33,864 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397726026] [2019-11-06 19:22:33,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:22:33,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:22:33,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:22:33,990 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-06 19:22:33,991 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397726026] [2019-11-06 19:22:33,991 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:22:33,991 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-06 19:22:33,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339986215] [2019-11-06 19:22:33,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-06 19:22:33,992 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:22:33,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-06 19:22:33,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-06 19:22:33,993 INFO L87 Difference]: Start difference. First operand 48 states and 62 transitions. Second operand 7 states. [2019-11-06 19:22:34,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:22:34,164 INFO L93 Difference]: Finished difference Result 63 states and 78 transitions. [2019-11-06 19:22:34,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 19:22:34,166 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-11-06 19:22:34,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:22:34,168 INFO L225 Difference]: With dead ends: 63 [2019-11-06 19:22:34,168 INFO L226 Difference]: Without dead ends: 50 [2019-11-06 19:22:34,168 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-06 19:22:34,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-06 19:22:34,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2019-11-06 19:22:34,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-06 19:22:34,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2019-11-06 19:22:34,181 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 21 [2019-11-06 19:22:34,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:22:34,182 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2019-11-06 19:22:34,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-06 19:22:34,182 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2019-11-06 19:22:34,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-06 19:22:34,183 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:22:34,183 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] [2019-11-06 19:22:34,183 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:22:34,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:22:34,184 INFO L82 PathProgramCache]: Analyzing trace with hash 507319878, now seen corresponding path program 1 times [2019-11-06 19:22:34,184 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:22:34,184 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644402678] [2019-11-06 19:22:34,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:22:34,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:22:34,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:22:34,286 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:34,286 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644402678] [2019-11-06 19:22:34,286 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:22:34,286 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 19:22:34,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176051093] [2019-11-06 19:22:34,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 19:22:34,287 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:22:34,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 19:22:34,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-06 19:22:34,288 INFO L87 Difference]: Start difference. First operand 45 states and 57 transitions. Second operand 6 states. [2019-11-06 19:22:34,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:22:34,531 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2019-11-06 19:22:34,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 19:22:34,531 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-11-06 19:22:34,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:22:34,532 INFO L225 Difference]: With dead ends: 75 [2019-11-06 19:22:34,533 INFO L226 Difference]: Without dead ends: 63 [2019-11-06 19:22:34,533 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-06 19:22:34,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-06 19:22:34,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 49. [2019-11-06 19:22:34,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-06 19:22:34,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 61 transitions. [2019-11-06 19:22:34,540 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 61 transitions. Word has length 21 [2019-11-06 19:22:34,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:22:34,541 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 61 transitions. [2019-11-06 19:22:34,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 19:22:34,541 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 61 transitions. [2019-11-06 19:22:34,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-06 19:22:34,542 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:22:34,542 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] [2019-11-06 19:22:34,542 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:22:34,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:22:34,543 INFO L82 PathProgramCache]: Analyzing trace with hash -302026748, now seen corresponding path program 1 times [2019-11-06 19:22:34,543 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:22:34,543 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741518787] [2019-11-06 19:22:34,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:22:34,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:22:34,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:22:34,675 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:34,675 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741518787] [2019-11-06 19:22:34,676 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:22:34,676 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-06 19:22:34,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513594292] [2019-11-06 19:22:34,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-06 19:22:34,677 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:22:34,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-06 19:22:34,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-06 19:22:34,677 INFO L87 Difference]: Start difference. First operand 49 states and 61 transitions. Second operand 9 states. [2019-11-06 19:22:35,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:22:35,033 INFO L93 Difference]: Finished difference Result 92 states and 115 transitions. [2019-11-06 19:22:35,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-06 19:22:35,033 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-11-06 19:22:35,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:22:35,035 INFO L225 Difference]: With dead ends: 92 [2019-11-06 19:22:35,035 INFO L226 Difference]: Without dead ends: 63 [2019-11-06 19:22:35,036 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-11-06 19:22:35,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-06 19:22:35,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 45. [2019-11-06 19:22:35,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-06 19:22:35,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2019-11-06 19:22:35,043 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 21 [2019-11-06 19:22:35,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:22:35,043 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2019-11-06 19:22:35,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-06 19:22:35,044 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2019-11-06 19:22:35,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-06 19:22:35,044 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:22:35,045 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:22:35,045 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:22:35,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:22:35,045 INFO L82 PathProgramCache]: Analyzing trace with hash 699636199, now seen corresponding path program 1 times [2019-11-06 19:22:35,045 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:22:35,046 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287669131] [2019-11-06 19:22:35,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:22:35,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:22:35,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:22:35,232 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:22:35,232 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287669131] [2019-11-06 19:22:35,233 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525353088] [2019-11-06 19:22:35,233 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:22:35,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:22:35,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 62 conjunts are in the unsatisfiable core [2019-11-06 19:22:35,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:22:35,351 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:22:35,352 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:35,366 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:35,367 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:22:35,367 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-11-06 19:22:35,414 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:35,414 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:22:35,415 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:35,581 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2019-11-06 19:22:35,582 INFO L567 ElimStorePlain]: treesize reduction 14, result has 98.3 percent of original size [2019-11-06 19:22:35,585 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_32|], 2=[|v_#memory_$Pointer$.base_35|, |v_#memory_$Pointer$.offset_35|], 8=[|v_#memory_$Pointer$.base_37|, |v_#memory_$Pointer$.offset_37|]} [2019-11-06 19:22:35,626 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:35,627 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 0 case distinctions, treesize of input 188 treesize of output 65 [2019-11-06 19:22:35,628 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:35,697 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:35,701 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:22:35,755 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:35,764 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:22:35,804 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:35,807 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:35,877 INFO L341 Elim1Store]: treesize reduction 268, result has 30.4 percent of original size [2019-11-06 19:22:35,878 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 2 case distinctions, treesize of input 220 treesize of output 287 [2019-11-06 19:22:35,878 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:35,980 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-11-06 19:22:35,981 INFO L567 ElimStorePlain]: treesize reduction 72, result has 76.3 percent of original size [2019-11-06 19:22:35,998 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:36,001 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 50 [2019-11-06 19:22:36,002 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:36,048 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:36,050 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:22:36,050 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:812, output treesize:88 [2019-11-06 19:22:36,127 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:36,127 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 20 treesize of output 30 [2019-11-06 19:22:36,128 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:36,239 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-11-06 19:22:36,240 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:36,242 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_33|], 4=[|v_#memory_$Pointer$.base_36|, |v_#memory_$Pointer$.offset_36|, |v_#memory_int_34|], 7=[|v_#memory_$Pointer$.base_38|, |v_#memory_$Pointer$.offset_38|]} [2019-11-06 19:22:36,246 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:22:36,334 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:36,338 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:22:36,405 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:36,411 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:22:36,473 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:36,499 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:36,500 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:36,502 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:36,503 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2019-11-06 19:22:36,504 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:36,586 INFO L567 ElimStorePlain]: treesize reduction 8, result has 94.4 percent of original size [2019-11-06 19:22:36,601 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:36,601 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:36,602 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:36,605 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:36,606 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 19:22:36,632 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:36,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, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 85 treesize of output 121 [2019-11-06 19:22:36,634 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:36,740 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2019-11-06 19:22:36,740 INFO L567 ElimStorePlain]: treesize reduction 76, result has 64.2 percent of original size [2019-11-06 19:22:36,745 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:36,746 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:36,747 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:36,749 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:36,750 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:36,753 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 64 [2019-11-06 19:22:36,754 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:36,809 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:36,811 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:22:36,811 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 8 variables, input treesize:202, output treesize:144 [2019-11-06 19:22:37,141 INFO L341 Elim1Store]: treesize reduction 16, result has 69.2 percent of original size [2019-11-06 19:22:37,142 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 14 case distinctions, treesize of input 162 treesize of output 111 [2019-11-06 19:22:37,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:37,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:37,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:37,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:37,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:37,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:37,148 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:22:37,206 INFO L567 ElimStorePlain]: treesize reduction 24, result has 76.7 percent of original size [2019-11-06 19:22:37,210 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:37,242 INFO L341 Elim1Store]: treesize reduction 12, result has 70.7 percent of original size [2019-11-06 19:22:37,243 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 5 case distinctions, treesize of input 61 treesize of output 60 [2019-11-06 19:22:37,244 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:37,253 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:37,254 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 19:22:37,254 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:183, output treesize:30 [2019-11-06 19:22:37,309 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:37,310 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 30 treesize of output 30 [2019-11-06 19:22:37,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:37,311 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:37,323 INFO L567 ElimStorePlain]: treesize reduction 4, result has 80.0 percent of original size [2019-11-06 19:22:37,324 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:22:37,324 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:34, output treesize:3 [2019-11-06 19:22:37,349 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:22:37,350 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 19:22:37,350 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 18 [2019-11-06 19:22:37,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237626848] [2019-11-06 19:22:37,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-06 19:22:37,351 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:22:37,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-06 19:22:37,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-11-06 19:22:37,351 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand 18 states. [2019-11-06 19:22:38,763 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-11-06 19:22:39,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:22:39,139 INFO L93 Difference]: Finished difference Result 126 states and 153 transitions. [2019-11-06 19:22:39,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-06 19:22:39,140 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 22 [2019-11-06 19:22:39,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:22:39,142 INFO L225 Difference]: With dead ends: 126 [2019-11-06 19:22:39,142 INFO L226 Difference]: Without dead ends: 124 [2019-11-06 19:22:39,143 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=150, Invalid=972, Unknown=0, NotChecked=0, Total=1122 [2019-11-06 19:22:39,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-11-06 19:22:39,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 61. [2019-11-06 19:22:39,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-06 19:22:39,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2019-11-06 19:22:39,153 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 22 [2019-11-06 19:22:39,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:22:39,153 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2019-11-06 19:22:39,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-06 19:22:39,153 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2019-11-06 19:22:39,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-06 19:22:39,154 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:22:39,154 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] [2019-11-06 19:22:39,358 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:22:39,359 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:22:39,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:22:39,360 INFO L82 PathProgramCache]: Analyzing trace with hash -981767607, now seen corresponding path program 1 times [2019-11-06 19:22:39,360 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:22:39,360 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278311046] [2019-11-06 19:22:39,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:22:39,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:22:39,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:22:39,470 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:22:39,470 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278311046] [2019-11-06 19:22:39,470 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:22:39,475 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-06 19:22:39,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45642575] [2019-11-06 19:22:39,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-06 19:22:39,476 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:22:39,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-06 19:22:39,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-06 19:22:39,476 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand 8 states. [2019-11-06 19:22:39,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:22:39,708 INFO L93 Difference]: Finished difference Result 85 states and 104 transitions. [2019-11-06 19:22:39,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-06 19:22:39,709 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-11-06 19:22:39,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:22:39,710 INFO L225 Difference]: With dead ends: 85 [2019-11-06 19:22:39,710 INFO L226 Difference]: Without dead ends: 68 [2019-11-06 19:22:39,711 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-06 19:22:39,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-06 19:22:39,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 58. [2019-11-06 19:22:39,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-06 19:22:39,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 70 transitions. [2019-11-06 19:22:39,728 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 70 transitions. Word has length 23 [2019-11-06 19:22:39,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:22:39,729 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 70 transitions. [2019-11-06 19:22:39,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-06 19:22:39,729 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2019-11-06 19:22:39,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-06 19:22:39,733 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:22:39,733 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] [2019-11-06 19:22:39,733 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:22:39,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:22:39,734 INFO L82 PathProgramCache]: Analyzing trace with hash -762999237, now seen corresponding path program 1 times [2019-11-06 19:22:39,734 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:22:39,734 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111794024] [2019-11-06 19:22:39,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:22:39,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:22:40,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:22:40,135 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:22:40,135 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111794024] [2019-11-06 19:22:40,136 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047691584] [2019-11-06 19:22:40,136 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:22:40,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:22:40,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 48 conjunts are in the unsatisfiable core [2019-11-06 19:22:40,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:22:40,273 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:22:40,274 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:40,280 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:40,280 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:22:40,280 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-06 19:22:40,341 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:40,341 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:22:40,342 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:40,411 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:40,415 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_35|], 2=[|v_#memory_$Pointer$.base_39|, |v_#memory_$Pointer$.offset_39|], 8=[|v_#memory_$Pointer$.base_41|, |v_#memory_$Pointer$.offset_41|]} [2019-11-06 19:22:40,430 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:40,432 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 0 case distinctions, treesize of input 188 treesize of output 65 [2019-11-06 19:22:40,432 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:40,477 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:40,482 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:22:40,516 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:40,521 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:22:40,547 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:40,550 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:40,620 INFO L341 Elim1Store]: treesize reduction 268, result has 30.4 percent of original size [2019-11-06 19:22:40,621 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 2 case distinctions, treesize of input 220 treesize of output 287 [2019-11-06 19:22:40,621 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:40,694 INFO L567 ElimStorePlain]: treesize reduction 72, result has 75.3 percent of original size [2019-11-06 19:22:40,697 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:40,702 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 50 [2019-11-06 19:22:40,702 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:40,727 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:40,728 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:22:40,728 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:803, output treesize:71 [2019-11-06 19:22:40,835 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_40|, |v_#memory_$Pointer$.offset_40|], 2=[|v_#memory_int_38|], 4=[|v_#memory_int_36|], 10=[|v_#memory_$Pointer$.base_42|, |v_#memory_$Pointer$.offset_42|]} [2019-11-06 19:22:40,845 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:22:40,848 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:40,918 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:40,925 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:22:40,925 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:40,971 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:40,979 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 27 treesize of output 15 [2019-11-06 19:22:40,980 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:41,014 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:41,021 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:41,022 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 32 treesize of output 24 [2019-11-06 19:22:41,023 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:41,056 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:41,079 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:41,079 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 4 new quantified variables, introduced 5 case distinctions, treesize of input 71 treesize of output 62 [2019-11-06 19:22:41,080 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:41,124 INFO L567 ElimStorePlain]: treesize reduction 24, result has 74.2 percent of original size [2019-11-06 19:22:41,131 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-06 19:22:41,131 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:41,145 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:41,146 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:22:41,146 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:148, output treesize:44 [2019-11-06 19:22:41,189 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_37|], 6=[|v_#memory_int_39|], 9=[|v_#memory_$Pointer$.offset_43|, |v_#memory_$Pointer$.base_43|]} [2019-11-06 19:22:41,194 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:22:41,232 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:41,236 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:41,239 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 36 [2019-11-06 19:22:41,240 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:41,266 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:41,282 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:41,283 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 63 treesize of output 31 [2019-11-06 19:22:41,284 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:41,305 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:41,308 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:41,353 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:41,354 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 111 [2019-11-06 19:22:41,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:22:41,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:41,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:41,357 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-11-06 19:22:41,426 INFO L567 ElimStorePlain]: treesize reduction 173, result has 28.2 percent of original size [2019-11-06 19:22:41,427 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:22:41,427 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:192, output treesize:58 [2019-11-06 19:22:41,522 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:41,522 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 40 [2019-11-06 19:22:41,523 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:41,565 INFO L567 ElimStorePlain]: treesize reduction 12, result has 77.8 percent of original size [2019-11-06 19:22:41,568 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:22:41,569 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:41,590 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:41,591 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 19:22:41,591 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:72, output treesize:24 [2019-11-06 19:22:41,626 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 24 treesize of output 10 [2019-11-06 19:22:41,626 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:41,630 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:41,631 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:22:41,631 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:28, output treesize:3 [2019-11-06 19:22:41,658 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:22:41,659 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 19:22:41,659 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2019-11-06 19:22:41,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091192248] [2019-11-06 19:22:41,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-06 19:22:41,660 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:22:41,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-06 19:22:41,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2019-11-06 19:22:41,660 INFO L87 Difference]: Start difference. First operand 58 states and 70 transitions. Second operand 19 states. [2019-11-06 19:22:42,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:22:42,880 INFO L93 Difference]: Finished difference Result 90 states and 109 transitions. [2019-11-06 19:22:42,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-06 19:22:42,881 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2019-11-06 19:22:42,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:22:42,882 INFO L225 Difference]: With dead ends: 90 [2019-11-06 19:22:42,882 INFO L226 Difference]: Without dead ends: 88 [2019-11-06 19:22:42,883 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2019-11-06 19:22:42,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-11-06 19:22:42,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 61. [2019-11-06 19:22:42,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-06 19:22:42,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 74 transitions. [2019-11-06 19:22:42,893 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 74 transitions. Word has length 24 [2019-11-06 19:22:42,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:22:42,893 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 74 transitions. [2019-11-06 19:22:42,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-06 19:22:42,894 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 74 transitions. [2019-11-06 19:22:42,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-06 19:22:42,895 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:22:42,895 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:22:43,098 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:22:43,099 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:22:43,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:22:43,099 INFO L82 PathProgramCache]: Analyzing trace with hash -596219703, now seen corresponding path program 2 times [2019-11-06 19:22:43,099 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:22:43,100 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571814257] [2019-11-06 19:22:43,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:22:43,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:22:43,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:22:43,244 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:22:43,245 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571814257] [2019-11-06 19:22:43,245 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319776211] [2019-11-06 19:22:43,245 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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:22:43,426 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-06 19:22:43,427 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 19:22:43,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 57 conjunts are in the unsatisfiable core [2019-11-06 19:22:43,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:22:43,440 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:22:43,440 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:43,449 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:43,450 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:22:43,450 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-11-06 19:22:43,526 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:43,526 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:22:43,530 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:43,680 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-11-06 19:22:43,681 INFO L567 ElimStorePlain]: treesize reduction 14, result has 97.8 percent of original size [2019-11-06 19:22:43,684 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_44|, |v_#memory_$Pointer$.base_44|], 8=[|v_#memory_$Pointer$.base_46|, |v_#memory_$Pointer$.offset_46|]} [2019-11-06 19:22:43,689 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:22:43,728 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:43,731 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:22:43,766 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:43,769 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:43,832 INFO L341 Elim1Store]: treesize reduction 268, result has 30.4 percent of original size [2019-11-06 19:22:43,833 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 2 case distinctions, treesize of input 183 treesize of output 250 [2019-11-06 19:22:43,833 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:43,905 INFO L567 ElimStorePlain]: treesize reduction 72, result has 73.0 percent of original size [2019-11-06 19:22:43,908 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:43,913 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 43 [2019-11-06 19:22:43,913 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:43,942 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:43,943 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:22:43,944 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:624, output treesize:77 [2019-11-06 19:22:44,006 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:44,006 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 20 treesize of output 30 [2019-11-06 19:22:44,007 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:44,061 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:44,063 INFO L392 ElimStorePlain]: Different costs {4=[|v_#memory_$Pointer$.base_45|, |v_#memory_$Pointer$.offset_45|], 7=[|v_#memory_$Pointer$.base_47|, |v_#memory_$Pointer$.offset_47|]} [2019-11-06 19:22:44,067 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:22:44,111 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:44,118 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:22:44,150 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:44,155 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:44,156 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:44,157 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:44,160 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:44,161 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 19:22:44,186 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:44,187 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 82 treesize of output 118 [2019-11-06 19:22:44,188 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:44,274 INFO L567 ElimStorePlain]: treesize reduction 76, result has 60.6 percent of original size [2019-11-06 19:22:44,278 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:44,279 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:44,280 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:44,281 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:44,283 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 64 [2019-11-06 19:22:44,284 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:44,318 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:44,319 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:22:44,320 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:152, output treesize:132 [2019-11-06 19:22:44,656 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-11-06 19:22:44,657 INFO L341 Elim1Store]: treesize reduction 16, result has 87.5 percent of original size [2019-11-06 19:22:44,657 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 11 new quantified variables, introduced 20 case distinctions, treesize of input 173 treesize of output 188 [2019-11-06 19:22:44,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:44,818 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 19:22:44,871 INFO L567 ElimStorePlain]: treesize reduction 133, result has 33.2 percent of original size [2019-11-06 19:22:44,886 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:44,887 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 49 [2019-11-06 19:22:44,888 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:44,895 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:44,895 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:22:44,896 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:187, output treesize:7 [2019-11-06 19:22:44,903 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:22:44,903 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 19:22:44,903 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2019-11-06 19:22:44,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300040743] [2019-11-06 19:22:44,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-06 19:22:44,904 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:22:44,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-06 19:22:44,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-11-06 19:22:44,905 INFO L87 Difference]: Start difference. First operand 61 states and 74 transitions. Second operand 16 states. [2019-11-06 19:22:46,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:22:46,278 INFO L93 Difference]: Finished difference Result 125 states and 150 transitions. [2019-11-06 19:22:46,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-06 19:22:46,278 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-11-06 19:22:46,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:22:46,279 INFO L225 Difference]: With dead ends: 125 [2019-11-06 19:22:46,279 INFO L226 Difference]: Without dead ends: 100 [2019-11-06 19:22:46,280 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2019-11-06 19:22:46,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-06 19:22:46,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 76. [2019-11-06 19:22:46,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-06 19:22:46,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 93 transitions. [2019-11-06 19:22:46,310 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 93 transitions. Word has length 25 [2019-11-06 19:22:46,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:22:46,310 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 93 transitions. [2019-11-06 19:22:46,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-06 19:22:46,310 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2019-11-06 19:22:46,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-06 19:22:46,311 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:22:46,311 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 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:46,515 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:22:46,515 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:22:46,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:22:46,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1594698048, now seen corresponding path program 1 times [2019-11-06 19:22:46,516 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:22:46,516 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677007158] [2019-11-06 19:22:46,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:22:46,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:22:46,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:22:46,763 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:22:46,763 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677007158] [2019-11-06 19:22:46,763 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845459568] [2019-11-06 19:22:46,764 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:22:46,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:22:46,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 46 conjunts are in the unsatisfiable core [2019-11-06 19:22:46,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:22:46,883 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:22:46,883 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:46,888 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:46,888 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:22:46,888 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-06 19:22:46,914 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:46,915 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:22:46,915 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:46,949 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:46,951 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_48|, |v_#memory_$Pointer$.offset_48|], 8=[|v_#memory_$Pointer$.base_50|, |v_#memory_$Pointer$.offset_50|]} [2019-11-06 19:22:46,954 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:22:46,985 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:46,990 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:22:47,008 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:47,011 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:47,065 INFO L341 Elim1Store]: treesize reduction 268, result has 30.4 percent of original size [2019-11-06 19:22:47,066 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 2 case distinctions, treesize of input 183 treesize of output 250 [2019-11-06 19:22:47,067 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:47,115 INFO L567 ElimStorePlain]: treesize reduction 72, result has 71.7 percent of original size [2019-11-06 19:22:47,118 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:47,122 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 43 [2019-11-06 19:22:47,123 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:47,143 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:47,144 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:22:47,144 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:615, output treesize:60 [2019-11-06 19:22:47,211 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_49|, |v_#memory_$Pointer$.offset_49|], 26=[|v_#memory_$Pointer$.base_51|, |v_#memory_$Pointer$.offset_51|]} [2019-11-06 19:22:47,214 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:22:47,259 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:47,262 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:22:47,301 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:47,305 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:47,499 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-11-06 19:22:47,499 INFO L341 Elim1Store]: treesize reduction 64, result has 70.8 percent of original size [2019-11-06 19:22:47,500 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 79 treesize of output 201 [2019-11-06 19:22:47,502 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:47,603 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 48 [2019-11-06 19:22:47,603 INFO L567 ElimStorePlain]: treesize reduction 140, result has 38.6 percent of original size [2019-11-06 19:22:47,608 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:47,609 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 43 [2019-11-06 19:22:47,610 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:47,638 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:47,638 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:22:47,639 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:146, output treesize:56 [2019-11-06 19:22:47,699 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:47,817 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2019-11-06 19:22:47,817 INFO L341 Elim1Store]: treesize reduction 30, result has 76.9 percent of original size [2019-11-06 19:22:47,818 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 6 case distinctions, treesize of input 163 treesize of output 173 [2019-11-06 19:22:47,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:47,823 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:47,898 INFO L567 ElimStorePlain]: treesize reduction 72, result has 63.3 percent of original size [2019-11-06 19:22:47,909 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:47,911 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 48 [2019-11-06 19:22:47,912 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:47,933 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:47,933 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:22:47,934 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:170, output treesize:78 [2019-11-06 19:22:48,112 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:48,163 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:48,163 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 92 treesize of output 134 [2019-11-06 19:22:48,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:48,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:48,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:48,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:48,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:48,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:48,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:48,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:48,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:48,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:48,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:48,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:48,173 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:22:48,207 INFO L567 ElimStorePlain]: treesize reduction 72, result has 40.5 percent of original size [2019-11-06 19:22:48,225 INFO L341 Elim1Store]: treesize reduction 10, result has 63.0 percent of original size [2019-11-06 19:22:48,225 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 35 [2019-11-06 19:22:48,226 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:48,230 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:48,230 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:22:48,231 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:108, output treesize:7 [2019-11-06 19:22:48,236 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:22:48,236 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 19:22:48,236 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 17 [2019-11-06 19:22:48,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461191239] [2019-11-06 19:22:48,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-06 19:22:48,240 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:22:48,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-06 19:22:48,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2019-11-06 19:22:48,241 INFO L87 Difference]: Start difference. First operand 76 states and 93 transitions. Second operand 17 states. [2019-11-06 19:22:49,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:22:49,530 INFO L93 Difference]: Finished difference Result 110 states and 133 transitions. [2019-11-06 19:22:49,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-06 19:22:49,530 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 26 [2019-11-06 19:22:49,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:22:49,532 INFO L225 Difference]: With dead ends: 110 [2019-11-06 19:22:49,532 INFO L226 Difference]: Without dead ends: 99 [2019-11-06 19:22:49,533 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2019-11-06 19:22:49,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-06 19:22:49,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 75. [2019-11-06 19:22:49,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-06 19:22:49,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 91 transitions. [2019-11-06 19:22:49,555 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 91 transitions. Word has length 26 [2019-11-06 19:22:49,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:22:49,555 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 91 transitions. [2019-11-06 19:22:49,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-06 19:22:49,555 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 91 transitions. [2019-11-06 19:22:49,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-06 19:22:49,556 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:22:49,556 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 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:49,766 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:22:49,766 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:22:49,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:22:49,767 INFO L82 PathProgramCache]: Analyzing trace with hash 969578388, now seen corresponding path program 1 times [2019-11-06 19:22:49,767 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:22:49,767 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957455893] [2019-11-06 19:22:49,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:22:49,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:22:50,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:22:50,053 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:22:50,053 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957455893] [2019-11-06 19:22:50,053 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145910958] [2019-11-06 19:22:50,054 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:22:50,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:22:50,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-06 19:22:50,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:22:50,196 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:22:50,196 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:50,215 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:50,219 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:22:50,219 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:50,227 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:50,227 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:22:50,228 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:21 [2019-11-06 19:22:50,298 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:50,299 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:22:50,299 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:50,361 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:50,363 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_44|, |v_#memory_$Pointer$.base_53|, |v_#memory_int_41|], 4=[|v_#memory_int_42|], 8=[|v_#memory_$Pointer$.base_54|]} [2019-11-06 19:22:50,376 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:50,386 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 25 treesize of output 13 [2019-11-06 19:22:50,386 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:50,431 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:50,435 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:22:50,461 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:50,470 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 29 treesize of output 13 [2019-11-06 19:22:50,470 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:50,491 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:50,496 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:50,498 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:50,499 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 52 [2019-11-06 19:22:50,500 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:50,517 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:50,519 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:50,565 INFO L341 Elim1Store]: treesize reduction 45, result has 51.6 percent of original size [2019-11-06 19:22:50,566 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 2 case distinctions, treesize of input 47 treesize of output 71 [2019-11-06 19:22:50,566 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:50,611 INFO L567 ElimStorePlain]: treesize reduction 16, result has 81.0 percent of original size [2019-11-06 19:22:50,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:22:50,614 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 19:22:50,614 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:396, output treesize:68 [2019-11-06 19:22:50,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:22:50,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:22:54,804 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:54,804 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 35 [2019-11-06 19:22:54,804 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:54,817 INFO L567 ElimStorePlain]: treesize reduction 12, result has 65.7 percent of original size [2019-11-06 19:22:54,818 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:22:54,818 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:23 [2019-11-06 19:22:54,850 INFO L392 ElimStorePlain]: Different costs {4=[|v_#memory_int_43|], 6=[|v_#memory_int_45|]} [2019-11-06 19:22:54,876 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:22:54,888 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:54,920 INFO L341 Elim1Store]: treesize reduction 69, result has 31.7 percent of original size [2019-11-06 19:22:54,920 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 47 [2019-11-06 19:22:54,920 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:54,933 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:54,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:22:54,935 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-06 19:22:54,935 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:58, output treesize:45 [2019-11-06 19:22:54,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:22:54,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:22:55,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:22:55,076 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 28 treesize of output 10 [2019-11-06 19:22:55,076 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:55,080 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:55,081 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:22:55,081 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2019-11-06 19:22:55,109 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:22:55,110 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 19:22:55,110 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-11-06 19:22:55,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757271257] [2019-11-06 19:22:55,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-06 19:22:55,111 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:22:55,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-06 19:22:55,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=259, Unknown=2, NotChecked=0, Total=306 [2019-11-06 19:22:55,112 INFO L87 Difference]: Start difference. First operand 75 states and 91 transitions. Second operand 18 states. [2019-11-06 19:22:57,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:22:57,273 INFO L93 Difference]: Finished difference Result 122 states and 151 transitions. [2019-11-06 19:22:57,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-06 19:22:57,273 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 26 [2019-11-06 19:22:57,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:22:57,278 INFO L225 Difference]: With dead ends: 122 [2019-11-06 19:22:57,278 INFO L226 Difference]: Without dead ends: 116 [2019-11-06 19:22:57,279 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=151, Invalid=717, Unknown=2, NotChecked=0, Total=870 [2019-11-06 19:22:57,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-11-06 19:22:57,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 90. [2019-11-06 19:22:57,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-06 19:22:57,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 112 transitions. [2019-11-06 19:22:57,300 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 112 transitions. Word has length 26 [2019-11-06 19:22:57,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:22:57,301 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 112 transitions. [2019-11-06 19:22:57,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-06 19:22:57,301 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 112 transitions. [2019-11-06 19:22:57,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-06 19:22:57,308 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:22:57,308 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 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:57,515 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:22:57,515 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:22:57,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:22:57,516 INFO L82 PathProgramCache]: Analyzing trace with hash 2113648800, now seen corresponding path program 2 times [2019-11-06 19:22:57,516 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:22:57,516 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706692532] [2019-11-06 19:22:57,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:22:57,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:22:58,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:22:58,023 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:22:58,023 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706692532] [2019-11-06 19:22:58,023 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480701152] [2019-11-06 19:22:58,024 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:22:58,158 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-06 19:22:58,158 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 19:22:58,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 73 conjunts are in the unsatisfiable core [2019-11-06 19:22:58,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:22:58,176 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:22:58,177 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:58,183 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:58,184 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:22:58,184 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-11-06 19:22:58,223 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:58,224 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:22:58,224 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:58,452 WARN L191 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2019-11-06 19:22:58,452 INFO L567 ElimStorePlain]: treesize reduction 14, result has 94.8 percent of original size [2019-11-06 19:22:58,460 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_46|], 2=[|v_#memory_$Pointer$.offset_53|, |v_#memory_$Pointer$.base_55|], 8=[|v_#memory_$Pointer$.base_58|, |v_#memory_$Pointer$.offset_56|]} [2019-11-06 19:22:58,475 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:58,477 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 0 case distinctions, treesize of input 20 treesize of output 9 [2019-11-06 19:22:58,477 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:58,567 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:58,570 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:22:58,665 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:58,668 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:22:58,721 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:58,726 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:58,736 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:58,744 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:58,746 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:58,748 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 19:22:58,750 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:58,760 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:58,761 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 50 [2019-11-06 19:22:58,761 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:58,846 INFO L567 ElimStorePlain]: treesize reduction 16, result has 90.6 percent of original size [2019-11-06 19:22:58,849 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:58,864 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:58,903 INFO L341 Elim1Store]: treesize reduction 3, result has 93.5 percent of original size [2019-11-06 19:22:58,903 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 1 case distinctions, treesize of input 68 treesize of output 69 [2019-11-06 19:22:58,904 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:58,984 INFO L567 ElimStorePlain]: treesize reduction 35, result has 72.7 percent of original size [2019-11-06 19:22:58,985 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:22:58,985 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:258, output treesize:72 [2019-11-06 19:22:59,121 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:59,121 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 20 treesize of output 30 [2019-11-06 19:22:59,122 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:59,464 WARN L191 SmtUtils]: Spent 341.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-11-06 19:22:59,464 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:59,468 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_47|, |v_#memory_int_51|], 2=[|v_#memory_$Pointer$.base_56|, |v_#memory_$Pointer$.offset_54|], 4=[|v_#memory_int_48|], 24=[|v_#memory_$Pointer$.base_59|, |v_#memory_$Pointer$.offset_57|]} [2019-11-06 19:22:59,494 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:00,011 WARN L191 SmtUtils]: Spent 516.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-11-06 19:23:00,012 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:00,054 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 26 [2019-11-06 19:23:00,055 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:00,276 WARN L191 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-11-06 19:23:00,277 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:00,282 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:00,444 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-06 19:23:00,444 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:00,448 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:00,595 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-11-06 19:23:00,595 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:00,607 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:00,609 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:00,610 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 343 treesize of output 138 [2019-11-06 19:23:00,611 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:00,714 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-11-06 19:23:00,714 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:00,898 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-11-06 19:23:00,899 INFO L341 Elim1Store]: treesize reduction 117, result has 52.6 percent of original size [2019-11-06 19:23:00,899 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 6 new quantified variables, introduced 9 case distinctions, treesize of input 438 treesize of output 374 [2019-11-06 19:23:00,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:00,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:00,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:00,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:00,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:00,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:00,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:00,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:00,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:00,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:00,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:00,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:00,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:00,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:00,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:00,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:00,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:00,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:00,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:00,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:00,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:00,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:00,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:00,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:00,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:00,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:00,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:00,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:00,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:00,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:00,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:00,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:00,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:00,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:00,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:00,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:00,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:00,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:00,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:00,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:00,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:00,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:00,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:00,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:00,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:00,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:00,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:00,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:00,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:00,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:00,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:00,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:00,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:00,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:00,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:00,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:00,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:00,980 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 16 xjuncts. [2019-11-06 19:23:02,049 WARN L191 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 220 DAG size of output: 60 [2019-11-06 19:23:02,050 INFO L567 ElimStorePlain]: treesize reduction 14967, result has 2.7 percent of original size [2019-11-06 19:23:02,054 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:02,059 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:02,061 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:02,066 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 136 [2019-11-06 19:23:02,067 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:02,123 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:02,126 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 7 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:02,126 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 9 variables, input treesize:1491, output treesize:109 [2019-11-06 19:23:02,285 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_57|, |v_#memory_$Pointer$.offset_55|], 4=[|v_#memory_int_49|], 5=[|v_#memory_int_52|], 20=[|v_#memory_$Pointer$.offset_58|, |v_#memory_$Pointer$.base_60|]} [2019-11-06 19:23:02,294 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:02,294 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:02,411 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-11-06 19:23:02,411 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:02,422 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:02,422 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:02,529 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-11-06 19:23:02,530 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:02,535 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:02,630 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:02,641 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:02,642 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:02,644 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:02,646 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2019-11-06 19:23:02,646 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:02,798 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2019-11-06 19:23:02,799 INFO L567 ElimStorePlain]: treesize reduction 4, result has 97.4 percent of original size [2019-11-06 19:23:02,808 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:02,810 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:02,812 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:02,813 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:02,815 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 19 [2019-11-06 19:23:02,815 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:02,864 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:02,872 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:02,873 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:02,896 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:02,896 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 59 treesize of output 50 [2019-11-06 19:23:02,897 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:02,971 INFO L567 ElimStorePlain]: treesize reduction 20, result has 73.0 percent of original size [2019-11-06 19:23:02,972 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 6 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:02,972 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:186, output treesize:54 [2019-11-06 19:23:03,049 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_50|], 9=[|v_#memory_$Pointer$.offset_59|, |v_#memory_$Pointer$.base_61|], 11=[|v_#memory_int_53|]} [2019-11-06 19:23:03,054 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:03,162 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-11-06 19:23:03,162 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:03,171 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:03,174 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:03,175 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 31 [2019-11-06 19:23:03,175 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:03,244 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:03,250 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:03,251 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 19:23:03,267 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:03,268 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 141 treesize of output 102 [2019-11-06 19:23:03,269 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:03,364 INFO L567 ElimStorePlain]: treesize reduction 18, result has 87.2 percent of original size [2019-11-06 19:23:03,373 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:03,376 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:03,378 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:03,379 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 19:23:03,380 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 19:23:03,413 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:03,413 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 100 [2019-11-06 19:23:03,415 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:03,498 INFO L567 ElimStorePlain]: treesize reduction 78, result has 52.1 percent of original size [2019-11-06 19:23:03,498 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:03,499 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:210, output treesize:76 [2019-11-06 19:23:03,647 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:03,647 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 32 [2019-11-06 19:23:03,648 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:03,663 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:03,667 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:03,667 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 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,668 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:03,679 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:03,679 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:03,680 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:85, output treesize:33 [2019-11-06 19:23:03,728 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:03,728 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 2 case distinctions, treesize of input 29 treesize of output 29 [2019-11-06 19:23:03,729 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:03,737 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:03,738 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:03,738 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:3 [2019-11-06 19:23:03,768 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:03,768 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 19:23:03,768 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2019-11-06 19:23:03,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386187938] [2019-11-06 19:23:03,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-06 19:23:03,769 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:03,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-06 19:23:03,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2019-11-06 19:23:03,770 INFO L87 Difference]: Start difference. First operand 90 states and 112 transitions. Second operand 20 states. [2019-11-06 19:23:05,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:05,767 INFO L93 Difference]: Finished difference Result 160 states and 197 transitions. [2019-11-06 19:23:05,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-06 19:23:05,767 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 26 [2019-11-06 19:23:05,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:05,768 INFO L225 Difference]: With dead ends: 160 [2019-11-06 19:23:05,768 INFO L226 Difference]: Without dead ends: 158 [2019-11-06 19:23:05,769 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=220, Invalid=970, Unknown=0, NotChecked=0, Total=1190 [2019-11-06 19:23:05,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-06 19:23:05,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 98. [2019-11-06 19:23:05,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-06 19:23:05,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 123 transitions. [2019-11-06 19:23:05,781 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 123 transitions. Word has length 26 [2019-11-06 19:23:05,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:05,782 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 123 transitions. [2019-11-06 19:23:05,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-06 19:23:05,782 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 123 transitions. [2019-11-06 19:23:05,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-06 19:23:05,783 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:05,783 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 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,995 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:23:05,996 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:05,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:05,996 INFO L82 PathProgramCache]: Analyzing trace with hash -590882554, now seen corresponding path program 1 times [2019-11-06 19:23:05,996 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:05,997 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731602091] [2019-11-06 19:23:05,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:06,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:06,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:06,162 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:06,163 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731602091] [2019-11-06 19:23:06,163 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919459732] [2019-11-06 19:23:06,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:23:06,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:06,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-06 19:23:06,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:23:06,276 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:06,277 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:06,281 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:06,281 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:06,281 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-06 19:23:06,323 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:06,324 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:06,324 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.