/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/list-properties/list-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 13:25:36,494 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 13:25:36,497 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 13:25:36,524 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 13:25:36,524 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 13:25:36,526 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 13:25:36,527 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 13:25:36,529 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 13:25:36,530 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 13:25:36,531 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 13:25:36,532 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 13:25:36,533 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 13:25:36,534 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 13:25:36,535 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 13:25:36,536 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 13:25:36,537 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 13:25:36,538 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 13:25:36,539 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 13:25:36,541 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 13:25:36,542 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 13:25:36,544 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 13:25:36,545 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 13:25:36,546 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 13:25:36,547 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 13:25:36,550 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 13:25:36,550 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 13:25:36,550 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 13:25:36,551 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 13:25:36,552 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 13:25:36,553 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 13:25:36,553 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 13:25:36,554 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 13:25:36,554 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 13:25:36,555 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 13:25:36,556 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 13:25:36,556 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 13:25:36,557 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 13:25:36,557 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 13:25:36,558 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 13:25:36,559 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 13:25:36,559 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 13:25:36,560 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-09-04 13:25:36,586 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 13:25:36,586 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 13:25:36,588 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-04 13:25:36,588 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-04 13:25:36,588 INFO L138 SettingsManager]: * Use SBE=true [2020-09-04 13:25:36,589 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 13:25:36,589 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 13:25:36,589 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 13:25:36,589 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 13:25:36,590 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 13:25:36,590 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 13:25:36,590 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 13:25:36,590 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 13:25:36,591 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 13:25:36,591 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 13:25:36,591 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 13:25:36,591 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 13:25:36,591 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 13:25:36,592 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-04 13:25:36,592 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 13:25:36,592 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 13:25:36,592 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 13:25:36,592 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 13:25:36,593 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-04 13:25:36,593 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-04 13:25:36,593 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-04 13:25:36,593 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-04 13:25:36,593 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 13:25:36,594 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-04 13:25:36,594 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-09-04 13:25:37,050 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 13:25:37,070 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 13:25:37,077 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 13:25:37,079 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 13:25:37,080 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 13:25:37,081 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/list-2.i [2020-09-04 13:25:37,178 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/ef763f375/4ad325f6b27e479484203bb42dc108f7/FLAGc945d4194 [2020-09-04 13:25:37,829 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 13:25:37,830 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/list-properties/list-2.i [2020-09-04 13:25:37,847 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/ef763f375/4ad325f6b27e479484203bb42dc108f7/FLAGc945d4194 [2020-09-04 13:25:38,081 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/ef763f375/4ad325f6b27e479484203bb42dc108f7 [2020-09-04 13:25:38,095 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 13:25:38,098 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 13:25:38,099 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 13:25:38,099 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 13:25:38,103 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 13:25:38,104 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 01:25:38" (1/1) ... [2020-09-04 13:25:38,109 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34d19aec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:25:38, skipping insertion in model container [2020-09-04 13:25:38,109 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 01:25:38" (1/1) ... [2020-09-04 13:25:38,118 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 13:25:38,166 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 13:25:38,635 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 13:25:38,651 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 13:25:38,700 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 13:25:38,762 INFO L208 MainTranslator]: Completed translation [2020-09-04 13:25:38,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:25:38 WrapperNode [2020-09-04 13:25:38,763 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 13:25:38,764 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 13:25:38,764 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 13:25:38,764 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 13:25:38,785 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:25:38" (1/1) ... [2020-09-04 13:25:38,785 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:25:38" (1/1) ... [2020-09-04 13:25:38,804 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:25:38" (1/1) ... [2020-09-04 13:25:38,805 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:25:38" (1/1) ... [2020-09-04 13:25:38,823 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:25:38" (1/1) ... [2020-09-04 13:25:38,830 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:25:38" (1/1) ... [2020-09-04 13:25:38,833 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:25:38" (1/1) ... [2020-09-04 13:25:38,840 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 13:25:38,840 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 13:25:38,841 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 13:25:38,841 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 13:25:38,848 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:25:38" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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 [2020-09-04 13:25:38,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 13:25:38,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 13:25:38,933 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-09-04 13:25:38,933 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-09-04 13:25:38,933 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2020-09-04 13:25:38,933 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2020-09-04 13:25:38,934 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2020-09-04 13:25:38,934 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2020-09-04 13:25:38,934 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 13:25:38,934 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 13:25:38,934 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 13:25:38,935 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-09-04 13:25:38,935 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-09-04 13:25:38,935 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-09-04 13:25:38,935 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-09-04 13:25:38,936 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-09-04 13:25:38,936 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-09-04 13:25:38,936 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-09-04 13:25:38,936 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-09-04 13:25:38,937 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-09-04 13:25:38,937 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-09-04 13:25:38,937 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-09-04 13:25:38,937 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-09-04 13:25:38,938 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-09-04 13:25:38,938 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-09-04 13:25:38,938 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-09-04 13:25:38,938 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-09-04 13:25:38,938 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-09-04 13:25:38,939 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-09-04 13:25:38,939 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2020-09-04 13:25:38,939 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2020-09-04 13:25:38,939 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2020-09-04 13:25:38,939 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-09-04 13:25:38,939 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-09-04 13:25:38,939 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-09-04 13:25:38,940 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-09-04 13:25:38,940 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-09-04 13:25:38,940 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-09-04 13:25:38,940 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-09-04 13:25:38,940 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-09-04 13:25:38,940 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-09-04 13:25:38,941 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-09-04 13:25:38,941 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-09-04 13:25:38,941 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-09-04 13:25:38,941 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-09-04 13:25:38,941 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-09-04 13:25:38,941 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-09-04 13:25:38,942 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-09-04 13:25:38,942 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-09-04 13:25:38,942 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-09-04 13:25:38,942 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-09-04 13:25:38,942 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-09-04 13:25:38,942 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-09-04 13:25:38,942 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-09-04 13:25:38,943 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-09-04 13:25:38,943 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-09-04 13:25:38,943 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-09-04 13:25:38,943 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-09-04 13:25:38,943 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-09-04 13:25:38,943 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-09-04 13:25:38,944 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-09-04 13:25:38,944 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-09-04 13:25:38,944 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-09-04 13:25:38,944 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-09-04 13:25:38,944 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-09-04 13:25:38,944 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-09-04 13:25:38,944 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-09-04 13:25:38,945 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-09-04 13:25:38,945 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-09-04 13:25:38,945 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-09-04 13:25:38,945 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-09-04 13:25:38,945 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-09-04 13:25:38,946 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-09-04 13:25:38,946 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-09-04 13:25:38,946 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-09-04 13:25:38,946 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-09-04 13:25:38,946 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-09-04 13:25:38,946 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-09-04 13:25:38,947 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-09-04 13:25:38,947 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-09-04 13:25:38,947 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-09-04 13:25:38,947 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-09-04 13:25:38,947 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-09-04 13:25:38,947 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-09-04 13:25:38,948 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-09-04 13:25:38,948 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-09-04 13:25:38,948 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-09-04 13:25:38,948 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-09-04 13:25:38,948 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-09-04 13:25:38,948 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-09-04 13:25:38,948 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-09-04 13:25:38,949 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-09-04 13:25:38,949 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-09-04 13:25:38,949 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-09-04 13:25:38,949 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-09-04 13:25:38,949 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-09-04 13:25:38,949 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-09-04 13:25:38,950 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-09-04 13:25:38,950 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-09-04 13:25:38,950 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-09-04 13:25:38,950 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-09-04 13:25:38,950 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-09-04 13:25:38,950 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-09-04 13:25:38,951 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-09-04 13:25:38,951 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-09-04 13:25:38,951 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-09-04 13:25:38,951 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-09-04 13:25:38,951 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-09-04 13:25:38,951 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-09-04 13:25:38,951 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-09-04 13:25:38,951 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-09-04 13:25:38,952 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-09-04 13:25:38,952 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-09-04 13:25:38,952 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-09-04 13:25:38,952 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-09-04 13:25:38,952 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-09-04 13:25:38,952 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-09-04 13:25:38,952 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-09-04 13:25:38,953 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2020-09-04 13:25:38,953 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 13:25:38,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-09-04 13:25:38,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-09-04 13:25:38,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-09-04 13:25:38,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-09-04 13:25:38,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-09-04 13:25:38,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 13:25:38,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 13:25:38,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-09-04 13:25:39,330 INFO L732 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2020-09-04 13:25:39,501 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 13:25:39,502 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-09-04 13:25:39,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 01:25:39 BoogieIcfgContainer [2020-09-04 13:25:39,507 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 13:25:39,508 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 13:25:39,508 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 13:25:39,512 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 13:25:39,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 01:25:38" (1/3) ... [2020-09-04 13:25:39,514 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@359b1505 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 01:25:39, skipping insertion in model container [2020-09-04 13:25:39,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:25:38" (2/3) ... [2020-09-04 13:25:39,514 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@359b1505 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 01:25:39, skipping insertion in model container [2020-09-04 13:25:39,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 01:25:39" (3/3) ... [2020-09-04 13:25:39,517 INFO L109 eAbstractionObserver]: Analyzing ICFG list-2.i [2020-09-04 13:25:39,529 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-09-04 13:25:39,540 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 13:25:39,563 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 13:25:39,590 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 13:25:39,590 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 13:25:39,590 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-09-04 13:25:39,591 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 13:25:39,591 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 13:25:39,591 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 13:25:39,591 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 13:25:39,591 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 13:25:39,615 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2020-09-04 13:25:39,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-09-04 13:25:39,623 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:39,624 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:25:39,625 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:39,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:39,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1613857984, now seen corresponding path program 1 times [2020-09-04 13:25:39,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:39,645 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604586300] [2020-09-04 13:25:39,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:39,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:39,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:39,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:39,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:39,874 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604586300] [2020-09-04 13:25:39,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:39,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:39,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232605212] [2020-09-04 13:25:39,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:39,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:39,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:39,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:39,906 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2020-09-04 13:25:40,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:40,031 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2020-09-04 13:25:40,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:40,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-09-04 13:25:40,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:40,044 INFO L225 Difference]: With dead ends: 56 [2020-09-04 13:25:40,045 INFO L226 Difference]: Without dead ends: 25 [2020-09-04 13:25:40,049 INFO L675 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 [2020-09-04 13:25:40,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-09-04 13:25:40,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-09-04 13:25:40,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-09-04 13:25:40,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2020-09-04 13:25:40,101 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 16 [2020-09-04 13:25:40,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:40,101 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2020-09-04 13:25:40,101 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:40,102 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2020-09-04 13:25:40,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-09-04 13:25:40,103 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:40,103 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:25:40,104 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 13:25:40,104 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:40,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:40,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1642379272, now seen corresponding path program 1 times [2020-09-04 13:25:40,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:40,105 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69808397] [2020-09-04 13:25:40,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:40,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:40,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:40,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:40,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:40,332 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69808397] [2020-09-04 13:25:40,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:40,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 13:25:40,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979104635] [2020-09-04 13:25:40,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 13:25:40,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:40,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 13:25:40,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-09-04 13:25:40,337 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 6 states. [2020-09-04 13:25:40,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:40,487 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2020-09-04 13:25:40,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 13:25:40,488 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-09-04 13:25:40,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:40,492 INFO L225 Difference]: With dead ends: 50 [2020-09-04 13:25:40,492 INFO L226 Difference]: Without dead ends: 46 [2020-09-04 13:25:40,493 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-09-04 13:25:40,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-09-04 13:25:40,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 34. [2020-09-04 13:25:40,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-09-04 13:25:40,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2020-09-04 13:25:40,503 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 20 [2020-09-04 13:25:40,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:40,504 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2020-09-04 13:25:40,504 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 13:25:40,504 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2020-09-04 13:25:40,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-04 13:25:40,505 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:40,505 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:25:40,506 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 13:25:40,506 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:40,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:40,507 INFO L82 PathProgramCache]: Analyzing trace with hash -2024806125, now seen corresponding path program 1 times [2020-09-04 13:25:40,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:40,507 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021912259] [2020-09-04 13:25:40,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:40,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:40,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:40,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:40,607 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:40,607 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021912259] [2020-09-04 13:25:40,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:40,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 13:25:40,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378587204] [2020-09-04 13:25:40,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 13:25:40,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:40,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 13:25:40,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-09-04 13:25:40,610 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand 6 states. [2020-09-04 13:25:40,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:40,751 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2020-09-04 13:25:40,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 13:25:40,752 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-09-04 13:25:40,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:40,754 INFO L225 Difference]: With dead ends: 52 [2020-09-04 13:25:40,754 INFO L226 Difference]: Without dead ends: 44 [2020-09-04 13:25:40,755 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-09-04 13:25:40,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-09-04 13:25:40,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 32. [2020-09-04 13:25:40,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-09-04 13:25:40,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2020-09-04 13:25:40,765 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 22 [2020-09-04 13:25:40,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:40,765 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2020-09-04 13:25:40,766 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 13:25:40,766 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2020-09-04 13:25:40,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-04 13:25:40,767 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:40,767 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:25:40,767 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 13:25:40,767 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:40,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:40,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1000103149, now seen corresponding path program 1 times [2020-09-04 13:25:40,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:40,769 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543329421] [2020-09-04 13:25:40,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:40,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:40,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:40,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:40,848 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:40,848 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543329421] [2020-09-04 13:25:40,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:40,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 13:25:40,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791605813] [2020-09-04 13:25:40,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 13:25:40,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:40,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 13:25:40,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-09-04 13:25:40,851 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 6 states. [2020-09-04 13:25:40,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:40,990 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2020-09-04 13:25:40,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 13:25:40,990 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-09-04 13:25:40,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:40,992 INFO L225 Difference]: With dead ends: 52 [2020-09-04 13:25:40,992 INFO L226 Difference]: Without dead ends: 41 [2020-09-04 13:25:40,993 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-09-04 13:25:40,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-09-04 13:25:40,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 29. [2020-09-04 13:25:40,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-09-04 13:25:40,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2020-09-04 13:25:40,998 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 22 [2020-09-04 13:25:40,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:40,999 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2020-09-04 13:25:40,999 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 13:25:40,999 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2020-09-04 13:25:41,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-09-04 13:25:41,000 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:41,000 INFO L422 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] [2020-09-04 13:25:41,001 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 13:25:41,001 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:41,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:41,001 INFO L82 PathProgramCache]: Analyzing trace with hash 422878047, now seen corresponding path program 1 times [2020-09-04 13:25:41,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:41,002 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896025876] [2020-09-04 13:25:41,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:41,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:41,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:41,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:41,165 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:41,166 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896025876] [2020-09-04 13:25:41,166 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823948078] [2020-09-04 13:25:41,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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 [2020-09-04 13:25:41,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:41,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 30 conjunts are in the unsatisfiable core [2020-09-04 13:25:41,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:25:41,387 INFO L384 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 [2020-09-04 13:25:41,388 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:41,395 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:41,396 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:25:41,396 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-09-04 13:25:41,488 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:41,489 INFO L384 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 [2020-09-04 13:25:41,490 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:41,502 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:41,508 INFO L384 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 [2020-09-04 13:25:41,509 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:41,522 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:41,522 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:25:41,523 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:21 [2020-09-04 13:25:41,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-09-04 13:25:41,560 INFO L384 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 27 treesize of output 11 [2020-09-04 13:25:41,561 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:41,569 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:41,570 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:25:41,570 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2020-09-04 13:25:41,623 INFO L384 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 19 treesize of output 18 [2020-09-04 13:25:41,625 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:41,635 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:41,639 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-04 13:25:41,639 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2020-09-04 13:25:41,696 INFO L384 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 [2020-09-04 13:25:41,697 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:41,702 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:41,706 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:25:41,706 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2020-09-04 13:25:41,711 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:41,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-04 13:25:41,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2020-09-04 13:25:41,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716451498] [2020-09-04 13:25:41,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 13:25:41,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:41,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 13:25:41,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2020-09-04 13:25:41,715 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 14 states. [2020-09-04 13:25:42,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:42,088 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2020-09-04 13:25:42,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 13:25:42,088 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2020-09-04 13:25:42,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:42,090 INFO L225 Difference]: With dead ends: 54 [2020-09-04 13:25:42,090 INFO L226 Difference]: Without dead ends: 48 [2020-09-04 13:25:42,091 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2020-09-04 13:25:42,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-09-04 13:25:42,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 36. [2020-09-04 13:25:42,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-09-04 13:25:42,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2020-09-04 13:25:42,097 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 24 [2020-09-04 13:25:42,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:42,097 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2020-09-04 13:25:42,097 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 13:25:42,098 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2020-09-04 13:25:42,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-09-04 13:25:42,098 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:42,099 INFO L422 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] [2020-09-04 13:25:42,312 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:25:42,313 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:42,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:42,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1286279711, now seen corresponding path program 1 times [2020-09-04 13:25:42,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:42,314 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312444199] [2020-09-04 13:25:42,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:42,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:42,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:42,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:42,443 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:42,443 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312444199] [2020-09-04 13:25:42,443 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635534214] [2020-09-04 13:25:42,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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 [2020-09-04 13:25:42,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:42,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 30 conjunts are in the unsatisfiable core [2020-09-04 13:25:42,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:25:42,549 INFO L384 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 [2020-09-04 13:25:42,550 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:42,555 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:42,555 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:25:42,556 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-09-04 13:25:42,602 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:42,602 INFO L384 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 [2020-09-04 13:25:42,603 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:42,613 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:42,619 INFO L384 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 [2020-09-04 13:25:42,620 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:42,629 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:42,630 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:25:42,630 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:21 [2020-09-04 13:25:42,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-09-04 13:25:42,663 INFO L384 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 27 treesize of output 11 [2020-09-04 13:25:42,664 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:42,670 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:42,671 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:25:42,671 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2020-09-04 13:25:42,719 INFO L384 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 19 treesize of output 18 [2020-09-04 13:25:42,720 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:42,729 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:42,732 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-04 13:25:42,732 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2020-09-04 13:25:42,781 INFO L384 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 [2020-09-04 13:25:42,783 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:42,788 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:42,790 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:25:42,790 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2020-09-04 13:25:42,794 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:42,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-04 13:25:42,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2020-09-04 13:25:42,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547303597] [2020-09-04 13:25:42,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 13:25:42,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:42,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 13:25:42,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2020-09-04 13:25:42,796 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 14 states. [2020-09-04 13:25:43,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:43,149 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2020-09-04 13:25:43,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 13:25:43,149 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2020-09-04 13:25:43,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:43,150 INFO L225 Difference]: With dead ends: 63 [2020-09-04 13:25:43,151 INFO L226 Difference]: Without dead ends: 59 [2020-09-04 13:25:43,151 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2020-09-04 13:25:43,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-09-04 13:25:43,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 47. [2020-09-04 13:25:43,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-09-04 13:25:43,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2020-09-04 13:25:43,158 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 24 [2020-09-04 13:25:43,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:43,159 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2020-09-04 13:25:43,159 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 13:25:43,159 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2020-09-04 13:25:43,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-09-04 13:25:43,160 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:43,160 INFO L422 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] [2020-09-04 13:25:43,364 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:25:43,365 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:43,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:43,366 INFO L82 PathProgramCache]: Analyzing trace with hash -562710342, now seen corresponding path program 1 times [2020-09-04 13:25:43,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:43,366 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505001159] [2020-09-04 13:25:43,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:43,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:43,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:43,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:43,598 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:43,601 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505001159] [2020-09-04 13:25:43,601 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941653568] [2020-09-04 13:25:43,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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 [2020-09-04 13:25:43,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:43,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 37 conjunts are in the unsatisfiable core [2020-09-04 13:25:43,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:25:43,704 INFO L384 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 [2020-09-04 13:25:43,704 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:43,709 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:43,710 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:25:43,710 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-09-04 13:25:43,736 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:43,737 INFO L384 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 [2020-09-04 13:25:43,738 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:43,747 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:43,748 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:25:43,748 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2020-09-04 13:25:43,765 INFO L384 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 11 treesize of output 7 [2020-09-04 13:25:43,765 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:43,786 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:43,795 INFO L384 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 11 treesize of output 7 [2020-09-04 13:25:43,795 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:43,813 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:43,815 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:25:43,815 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:26 [2020-09-04 13:25:43,838 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_int_22|], 2=[|v_#memory_$Pointer$.base_18|, |v_#memory_$Pointer$.offset_16|]} [2020-09-04 13:25:43,844 INFO L384 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 23 treesize of output 15 [2020-09-04 13:25:43,845 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:43,863 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:43,919 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:43,920 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 108 [2020-09-04 13:25:43,925 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-09-04 13:25:43,925 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-09-04 13:25:43,926 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:43,948 INFO L625 ElimStorePlain]: treesize reduction 36, result has 63.3 percent of original size [2020-09-04 13:25:43,953 INFO L384 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2020-09-04 13:25:43,954 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:43,962 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:43,962 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:25:43,963 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:105, output treesize:27 [2020-09-04 13:25:44,003 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2020-09-04 13:25:44,004 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:44,019 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:44,023 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 19 treesize of output 11 [2020-09-04 13:25:44,024 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:44,028 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:44,030 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:25:44,030 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:7 [2020-09-04 13:25:44,042 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-09-04 13:25:44,043 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:44,045 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:44,046 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:25:44,046 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-09-04 13:25:44,049 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:44,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-04 13:25:44,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11 [2020-09-04 13:25:44,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051369335] [2020-09-04 13:25:44,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 13:25:44,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:44,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 13:25:44,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-09-04 13:25:44,052 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand 11 states. [2020-09-04 13:25:44,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:44,380 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2020-09-04 13:25:44,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 13:25:44,381 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2020-09-04 13:25:44,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:44,382 INFO L225 Difference]: With dead ends: 67 [2020-09-04 13:25:44,383 INFO L226 Difference]: Without dead ends: 63 [2020-09-04 13:25:44,384 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2020-09-04 13:25:44,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-09-04 13:25:44,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 51. [2020-09-04 13:25:44,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-09-04 13:25:44,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2020-09-04 13:25:44,391 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 60 transitions. Word has length 26 [2020-09-04 13:25:44,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:44,391 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 60 transitions. [2020-09-04 13:25:44,392 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 13:25:44,392 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2020-09-04 13:25:44,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-09-04 13:25:44,393 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:44,393 INFO L422 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, 1] [2020-09-04 13:25:44,600 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:25:44,601 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:44,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:44,602 INFO L82 PathProgramCache]: Analyzing trace with hash 449917269, now seen corresponding path program 1 times [2020-09-04 13:25:44,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:44,604 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313216803] [2020-09-04 13:25:44,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:44,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:44,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:44,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:44,784 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:44,784 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313216803] [2020-09-04 13:25:44,785 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101384149] [2020-09-04 13:25:44,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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 [2020-09-04 13:25:44,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:44,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 36 conjunts are in the unsatisfiable core [2020-09-04 13:25:44,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:25:44,884 INFO L384 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 [2020-09-04 13:25:44,885 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:44,895 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:44,895 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:25:44,895 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-09-04 13:25:44,913 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:44,914 INFO L384 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 [2020-09-04 13:25:44,914 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:44,927 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:44,928 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:25:44,928 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2020-09-04 13:25:44,941 INFO L384 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 11 treesize of output 7 [2020-09-04 13:25:44,942 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:44,960 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:44,965 INFO L384 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 11 treesize of output 7 [2020-09-04 13:25:44,965 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:44,978 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:44,980 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:25:44,981 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:26 [2020-09-04 13:25:44,994 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_int_23|], 2=[|v_#memory_$Pointer$.base_20|, |v_#memory_$Pointer$.offset_18|]} [2020-09-04 13:25:44,999 INFO L384 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 23 treesize of output 15 [2020-09-04 13:25:45,000 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:45,014 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:45,036 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:45,037 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 108 [2020-09-04 13:25:45,039 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-09-04 13:25:45,040 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-09-04 13:25:45,040 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:45,062 INFO L625 ElimStorePlain]: treesize reduction 36, result has 63.3 percent of original size [2020-09-04 13:25:45,066 INFO L384 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2020-09-04 13:25:45,067 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:45,075 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:45,075 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:25:45,076 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:105, output treesize:27 [2020-09-04 13:25:45,113 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2020-09-04 13:25:45,115 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:45,124 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:45,128 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 19 treesize of output 11 [2020-09-04 13:25:45,130 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:45,137 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:45,139 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:25:45,139 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:7 [2020-09-04 13:25:45,147 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-09-04 13:25:45,148 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:45,153 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:45,154 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:25:45,154 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-09-04 13:25:45,176 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:45,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-04 13:25:45,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 12 [2020-09-04 13:25:45,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348352540] [2020-09-04 13:25:45,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 13:25:45,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:45,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 13:25:45,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-09-04 13:25:45,178 INFO L87 Difference]: Start difference. First operand 51 states and 60 transitions. Second operand 12 states. [2020-09-04 13:25:45,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:45,577 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2020-09-04 13:25:45,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 13:25:45,578 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2020-09-04 13:25:45,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:45,579 INFO L225 Difference]: With dead ends: 69 [2020-09-04 13:25:45,579 INFO L226 Difference]: Without dead ends: 59 [2020-09-04 13:25:45,580 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2020-09-04 13:25:45,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-09-04 13:25:45,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 42. [2020-09-04 13:25:45,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-09-04 13:25:45,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2020-09-04 13:25:45,589 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 28 [2020-09-04 13:25:45,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:45,589 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2020-09-04 13:25:45,589 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 13:25:45,589 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2020-09-04 13:25:45,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-09-04 13:25:45,590 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:45,590 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:25:45,794 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:25:45,795 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:45,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:45,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1474620245, now seen corresponding path program 2 times [2020-09-04 13:25:45,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:45,796 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463681091] [2020-09-04 13:25:45,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:45,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:45,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:45,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:45,978 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:45,978 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463681091] [2020-09-04 13:25:45,979 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906303525] [2020-09-04 13:25:45,979 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-2/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 [2020-09-04 13:25:46,075 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-09-04 13:25:46,075 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-04 13:25:46,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 36 conjunts are in the unsatisfiable core [2020-09-04 13:25:46,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:25:46,087 INFO L384 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 [2020-09-04 13:25:46,087 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:46,091 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:46,091 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:25:46,091 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-09-04 13:25:46,114 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:46,114 INFO L384 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 [2020-09-04 13:25:46,115 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:46,124 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:46,124 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:25:46,125 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2020-09-04 13:25:46,149 INFO L384 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 11 treesize of output 7 [2020-09-04 13:25:46,150 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:46,163 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:46,169 INFO L384 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 11 treesize of output 7 [2020-09-04 13:25:46,170 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:46,187 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:46,189 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:25:46,190 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:26 [2020-09-04 13:25:46,208 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_int_24|], 2=[|v_#memory_$Pointer$.base_22|, |v_#memory_$Pointer$.offset_20|]} [2020-09-04 13:25:46,212 INFO L384 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 23 treesize of output 15 [2020-09-04 13:25:46,212 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:46,227 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:46,255 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:46,256 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 108 [2020-09-04 13:25:46,258 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-09-04 13:25:46,259 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-09-04 13:25:46,259 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:46,290 INFO L625 ElimStorePlain]: treesize reduction 36, result has 63.3 percent of original size [2020-09-04 13:25:46,294 INFO L384 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2020-09-04 13:25:46,295 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:46,302 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:46,303 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:25:46,303 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:105, output treesize:27 [2020-09-04 13:25:46,337 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2020-09-04 13:25:46,338 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:46,346 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:46,349 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 19 treesize of output 11 [2020-09-04 13:25:46,350 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:46,360 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:46,362 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:25:46,362 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:7 [2020-09-04 13:25:46,367 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-09-04 13:25:46,367 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:46,369 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:46,369 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:25:46,369 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-09-04 13:25:46,390 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:46,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-04 13:25:46,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 12 [2020-09-04 13:25:46,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586206725] [2020-09-04 13:25:46,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 13:25:46,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:46,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 13:25:46,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-09-04 13:25:46,392 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 12 states. [2020-09-04 13:25:46,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:46,734 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2020-09-04 13:25:46,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 13:25:46,735 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2020-09-04 13:25:46,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:46,736 INFO L225 Difference]: With dead ends: 62 [2020-09-04 13:25:46,736 INFO L226 Difference]: Without dead ends: 49 [2020-09-04 13:25:46,737 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2020-09-04 13:25:46,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-09-04 13:25:46,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 37. [2020-09-04 13:25:46,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-09-04 13:25:46,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2020-09-04 13:25:46,742 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 28 [2020-09-04 13:25:46,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:46,742 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2020-09-04 13:25:46,742 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 13:25:46,743 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2020-09-04 13:25:46,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-09-04 13:25:46,743 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:46,744 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:25:46,952 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:25:46,953 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:46,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:46,953 INFO L82 PathProgramCache]: Analyzing trace with hash -149429434, now seen corresponding path program 2 times [2020-09-04 13:25:46,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:46,954 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685272923] [2020-09-04 13:25:46,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:46,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:47,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:47,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:47,187 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:47,188 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685272923] [2020-09-04 13:25:47,188 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824187448] [2020-09-04 13:25:47,188 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-2/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 [2020-09-04 13:25:47,315 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-09-04 13:25:47,315 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-04 13:25:47,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 40 conjunts are in the unsatisfiable core [2020-09-04 13:25:47,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:25:47,335 INFO L384 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 [2020-09-04 13:25:47,336 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:47,340 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:47,340 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:25:47,340 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-09-04 13:25:47,371 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:47,371 INFO L384 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 [2020-09-04 13:25:47,372 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:47,411 INFO L625 ElimStorePlain]: treesize reduction 14, result has 71.4 percent of original size [2020-09-04 13:25:47,417 INFO L384 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 11 treesize of output 7 [2020-09-04 13:25:47,417 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:47,433 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:47,433 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:25:47,434 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:31 [2020-09-04 13:25:47,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-09-04 13:25:47,481 INFO L384 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 27 treesize of output 11 [2020-09-04 13:25:47,482 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:47,492 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:47,492 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:25:47,493 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2020-09-04 13:25:47,545 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:47,546 INFO L384 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 16 treesize of output 26 [2020-09-04 13:25:47,547 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:47,561 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:47,566 INFO L384 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 19 treesize of output 18 [2020-09-04 13:25:47,567 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:47,581 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:47,582 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:25:47,582 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:30 [2020-09-04 13:25:47,646 INFO L350 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-09-04 13:25:47,646 INFO L384 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 1 case distinctions, treesize of input 34 treesize of output 21 [2020-09-04 13:25:47,647 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:47,660 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:47,663 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-04 13:25:47,663 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:30 [2020-09-04 13:25:47,760 INFO L384 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 26 treesize of output 28 [2020-09-04 13:25:47,761 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:47,781 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:47,787 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-09-04 13:25:47,789 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:37 [2020-09-04 13:25:47,859 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 29 treesize of output 13 [2020-09-04 13:25:47,860 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:47,867 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:47,869 INFO L545 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:25:47,869 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:41, output treesize:3 [2020-09-04 13:25:47,890 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:47,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-04 13:25:47,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 19 [2020-09-04 13:25:47,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922097405] [2020-09-04 13:25:47,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-09-04 13:25:47,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:47,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-09-04 13:25:47,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2020-09-04 13:25:47,893 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 19 states. [2020-09-04 13:25:50,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:50,624 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2020-09-04 13:25:50,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-09-04 13:25:50,625 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 28 [2020-09-04 13:25:50,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:50,626 INFO L225 Difference]: With dead ends: 73 [2020-09-04 13:25:50,627 INFO L226 Difference]: Without dead ends: 65 [2020-09-04 13:25:50,628 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=162, Invalid=768, Unknown=0, NotChecked=0, Total=930 [2020-09-04 13:25:50,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-09-04 13:25:50,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 55. [2020-09-04 13:25:50,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-09-04 13:25:50,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2020-09-04 13:25:50,637 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 28 [2020-09-04 13:25:50,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:50,637 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2020-09-04 13:25:50,637 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-09-04 13:25:50,638 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2020-09-04 13:25:50,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-09-04 13:25:50,638 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:50,639 INFO L422 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, 1, 1] [2020-09-04 13:25:50,846 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:25:50,847 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:50,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:50,848 INFO L82 PathProgramCache]: Analyzing trace with hash 150272518, now seen corresponding path program 1 times [2020-09-04 13:25:50,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:50,849 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684395279] [2020-09-04 13:25:50,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:50,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:51,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:51,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:51,066 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:51,066 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684395279] [2020-09-04 13:25:51,066 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15448970] [2020-09-04 13:25:51,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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 [2020-09-04 13:25:51,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:51,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 40 conjunts are in the unsatisfiable core [2020-09-04 13:25:51,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:25:51,198 INFO L384 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 [2020-09-04 13:25:51,198 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:51,203 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:51,204 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:25:51,204 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-09-04 13:25:51,242 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:51,243 INFO L384 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 [2020-09-04 13:25:51,244 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:51,284 INFO L625 ElimStorePlain]: treesize reduction 14, result has 71.4 percent of original size [2020-09-04 13:25:51,290 INFO L384 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 11 treesize of output 7 [2020-09-04 13:25:51,290 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:51,305 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:51,306 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:25:51,306 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:31 [2020-09-04 13:25:51,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-09-04 13:25:51,353 INFO L384 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 27 treesize of output 11 [2020-09-04 13:25:51,354 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:51,362 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:51,362 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:25:51,362 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2020-09-04 13:25:51,409 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:51,410 INFO L384 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 16 treesize of output 26 [2020-09-04 13:25:51,411 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:51,422 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:51,426 INFO L384 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 19 treesize of output 18 [2020-09-04 13:25:51,427 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:51,437 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:51,437 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:25:51,437 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:30 [2020-09-04 13:25:51,498 INFO L350 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-09-04 13:25:51,498 INFO L384 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 1 case distinctions, treesize of input 34 treesize of output 21 [2020-09-04 13:25:51,499 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:51,509 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:51,511 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-04 13:25:51,511 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:30 [2020-09-04 13:25:51,577 INFO L384 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 26 treesize of output 28 [2020-09-04 13:25:51,578 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:51,590 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:51,594 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-09-04 13:25:51,595 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:37 [2020-09-04 13:25:51,672 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 29 treesize of output 13 [2020-09-04 13:25:51,674 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:51,680 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:51,682 INFO L545 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:25:51,682 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:41, output treesize:3 [2020-09-04 13:25:51,703 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:51,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-04 13:25:51,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 19 [2020-09-04 13:25:51,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895095960] [2020-09-04 13:25:51,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-09-04 13:25:51,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:51,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-09-04 13:25:51,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2020-09-04 13:25:51,705 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 19 states. [2020-09-04 13:25:52,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:52,514 INFO L93 Difference]: Finished difference Result 93 states and 108 transitions. [2020-09-04 13:25:52,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-09-04 13:25:52,514 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 28 [2020-09-04 13:25:52,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:52,515 INFO L225 Difference]: With dead ends: 93 [2020-09-04 13:25:52,515 INFO L226 Difference]: Without dead ends: 87 [2020-09-04 13:25:52,517 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=155, Invalid=775, Unknown=0, NotChecked=0, Total=930 [2020-09-04 13:25:52,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-09-04 13:25:52,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 63. [2020-09-04 13:25:52,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-09-04 13:25:52,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 73 transitions. [2020-09-04 13:25:52,553 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 73 transitions. Word has length 28 [2020-09-04 13:25:52,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:52,553 INFO L479 AbstractCegarLoop]: Abstraction has 63 states and 73 transitions. [2020-09-04 13:25:52,553 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-09-04 13:25:52,553 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2020-09-04 13:25:52,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-09-04 13:25:52,554 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:52,555 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:25:52,768 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:25:52,769 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:52,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:52,769 INFO L82 PathProgramCache]: Analyzing trace with hash -794385695, now seen corresponding path program 3 times [2020-09-04 13:25:52,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:52,769 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930862063] [2020-09-04 13:25:52,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:52,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:53,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:53,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:53,062 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:53,062 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930862063] [2020-09-04 13:25:53,062 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821947618] [2020-09-04 13:25:53,063 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-2/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 [2020-09-04 13:25:53,164 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-09-04 13:25:53,165 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-04 13:25:53,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 61 conjunts are in the unsatisfiable core [2020-09-04 13:25:53,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:25:53,184 INFO L384 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 [2020-09-04 13:25:53,184 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:53,188 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:53,189 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:25:53,189 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-09-04 13:25:53,211 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:53,212 INFO L384 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 [2020-09-04 13:25:53,213 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:53,236 INFO L625 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2020-09-04 13:25:53,237 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:25:53,237 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2020-09-04 13:25:53,289 INFO L384 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 11 treesize of output 7 [2020-09-04 13:25:53,290 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:53,311 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:53,319 INFO L384 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 11 treesize of output 7 [2020-09-04 13:25:53,320 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:53,334 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:53,336 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:25:53,336 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:40 [2020-09-04 13:25:53,386 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:53,387 INFO L384 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 [2020-09-04 13:25:53,387 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:53,411 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:53,413 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_int_35|], 2=[|v_#memory_$Pointer$.offset_22|, |v_#memory_$Pointer$.base_28|]} [2020-09-04 13:25:53,418 INFO L384 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 [2020-09-04 13:25:53,418 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:53,442 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:53,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-09-04 13:25:53,449 INFO L384 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 23 treesize of output 11 [2020-09-04 13:25:53,450 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:53,473 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:53,501 INFO L350 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2020-09-04 13:25:53,501 INFO L384 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 1 case distinctions, treesize of input 39 treesize of output 27 [2020-09-04 13:25:53,502 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:53,534 INFO L625 ElimStorePlain]: treesize reduction 8, result has 83.3 percent of original size [2020-09-04 13:25:53,534 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:25:53,535 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:89, output treesize:40 [2020-09-04 13:25:53,589 INFO L384 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 113 [2020-09-04 13:25:53,590 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:53,625 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:53,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-09-04 13:25:53,631 INFO L384 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 55 treesize of output 19 [2020-09-04 13:25:53,632 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:53,651 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:53,670 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:53,670 INFO L384 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 118 [2020-09-04 13:25:53,673 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 3, 2, 1] term [2020-09-04 13:25:53,673 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-09-04 13:25:53,674 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:53,720 INFO L625 ElimStorePlain]: treesize reduction 26, result has 80.5 percent of original size [2020-09-04 13:25:53,721 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:25:53,721 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:162, output treesize:118 [2020-09-04 13:25:53,785 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_int_37|], 6=[|v_#memory_$Pointer$.base_30|, |v_#memory_$Pointer$.offset_24|]} [2020-09-04 13:25:53,793 INFO L384 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 69 treesize of output 54 [2020-09-04 13:25:53,794 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:53,822 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:53,875 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:53,876 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 286 treesize of output 261 [2020-09-04 13:25:53,879 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-09-04 13:25:53,884 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-09-04 13:25:53,885 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-09-04 13:25:53,886 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-09-04 13:25:53,888 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-09-04 13:25:53,895 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-09-04 13:25:53,896 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-09-04 13:25:53,897 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-09-04 13:25:53,901 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-09-04 13:25:53,902 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-09-04 13:25:53,903 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-09-04 13:25:53,906 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-09-04 13:25:53,909 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-09-04 13:25:53,913 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-09-04 13:25:53,914 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-09-04 13:25:53,915 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-09-04 13:25:53,916 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-09-04 13:25:53,917 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-09-04 13:25:53,919 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-09-04 13:25:53,920 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-09-04 13:25:53,921 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-09-04 13:25:53,924 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-09-04 13:25:53,925 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-09-04 13:25:53,926 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-09-04 13:25:53,928 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-09-04 13:25:53,930 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-09-04 13:25:53,932 INFO L545 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-04 13:25:53,996 INFO L625 ElimStorePlain]: treesize reduction 152, result has 42.4 percent of original size [2020-09-04 13:25:54,000 INFO L384 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 60 [2020-09-04 13:25:54,002 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:54,035 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:54,036 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:25:54,037 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:307, output treesize:119 [2020-09-04 13:25:54,175 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:54,176 INFO L384 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 123 treesize of output 78 [2020-09-04 13:25:54,178 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-09-04 13:25:54,179 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-09-04 13:25:54,180 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-04 13:25:54,221 INFO L625 ElimStorePlain]: treesize reduction 22, result has 74.4 percent of original size [2020-09-04 13:25:54,225 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 26 [2020-09-04 13:25:54,226 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-04 13:25:54,239 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:25:54,240 INFO L545 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. [2020-09-04 13:25:54,241 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:137, output treesize:30 [2020-09-04 13:25:54,373 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:54,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-04 13:25:54,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 21 [2020-09-04 13:25:54,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117857901] [2020-09-04 13:25:54,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-09-04 13:25:54,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:54,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-09-04 13:25:54,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2020-09-04 13:25:54,378 INFO L87 Difference]: Start difference. First operand 63 states and 73 transitions. Second operand 21 states. [2020-09-04 13:25:55,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:55,153 INFO L93 Difference]: Finished difference Result 90 states and 103 transitions. [2020-09-04 13:25:55,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-04 13:25:55,154 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 30 [2020-09-04 13:25:55,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:55,156 INFO L225 Difference]: With dead ends: 90 [2020-09-04 13:25:55,156 INFO L226 Difference]: Without dead ends: 84 [2020-09-04 13:25:55,157 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=129, Invalid=741, Unknown=0, NotChecked=0, Total=870 [2020-09-04 13:25:55,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-09-04 13:25:55,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 68. [2020-09-04 13:25:55,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-09-04 13:25:55,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 79 transitions. [2020-09-04 13:25:55,165 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 79 transitions. Word has length 30 [2020-09-04 13:25:55,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:55,165 INFO L479 AbstractCegarLoop]: Abstraction has 68 states and 79 transitions. [2020-09-04 13:25:55,165 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-09-04 13:25:55,165 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 79 transitions. [2020-09-04 13:25:55,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-09-04 13:25:55,166 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:55,167 INFO L422 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, 1, 1, 1] [2020-09-04 13:25:55,380 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-09-04 13:25:55,381 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:55,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:55,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1568321631, now seen corresponding path program 1 times [2020-09-04 13:25:55,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:55,382 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235224543] [2020-09-04 13:25:55,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:55,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 13:25:55,411 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 13:25:55,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 13:25:55,440 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 13:25:55,486 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-09-04 13:25:55,486 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-04 13:25:55,486 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-04 13:25:55,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 01:25:55 BoogieIcfgContainer [2020-09-04 13:25:55,563 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 13:25:55,565 INFO L168 Benchmark]: Toolchain (without parser) took 17468.45 ms. Allocated memory was 138.4 MB in the beginning and 366.0 MB in the end (delta: 227.5 MB). Free memory was 100.3 MB in the beginning and 216.1 MB in the end (delta: -115.8 MB). Peak memory consumption was 111.8 MB. Max. memory is 7.1 GB. [2020-09-04 13:25:55,565 INFO L168 Benchmark]: CDTParser took 1.57 ms. Allocated memory is still 138.4 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-04 13:25:55,565 INFO L168 Benchmark]: CACSL2BoogieTranslator took 664.68 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 100.1 MB in the beginning and 169.2 MB in the end (delta: -69.1 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. [2020-09-04 13:25:55,566 INFO L168 Benchmark]: Boogie Preprocessor took 76.20 ms. Allocated memory is still 202.4 MB. Free memory was 169.2 MB in the beginning and 165.8 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2020-09-04 13:25:55,567 INFO L168 Benchmark]: RCFGBuilder took 666.34 ms. Allocated memory is still 202.4 MB. Free memory was 165.8 MB in the beginning and 121.0 MB in the end (delta: 44.8 MB). Peak memory consumption was 44.8 MB. Max. memory is 7.1 GB. [2020-09-04 13:25:55,568 INFO L168 Benchmark]: TraceAbstraction took 16054.81 ms. Allocated memory was 202.4 MB in the beginning and 366.0 MB in the end (delta: 163.6 MB). Free memory was 121.0 MB in the beginning and 216.1 MB in the end (delta: -95.1 MB). Peak memory consumption was 68.5 MB. Max. memory is 7.1 GB. [2020-09-04 13:25:55,570 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.57 ms. Allocated memory is still 138.4 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 664.68 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 100.1 MB in the beginning and 169.2 MB in the end (delta: -69.1 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 76.20 ms. Allocated memory is still 202.4 MB. Free memory was 169.2 MB in the beginning and 165.8 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 666.34 ms. Allocated memory is still 202.4 MB. Free memory was 165.8 MB in the beginning and 121.0 MB in the end (delta: 44.8 MB). Peak memory consumption was 44.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16054.81 ms. Allocated memory was 202.4 MB in the beginning and 366.0 MB in the end (delta: 163.6 MB). Free memory was 121.0 MB in the beginning and 216.1 MB in the end (delta: -95.1 MB). Peak memory consumption was 68.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 546]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L521] List a = (List) malloc(sizeof(struct node)); VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}] [L522] COND FALSE !(a == 0) VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}] [L523] List t; [L524] List p = a; VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}] [L525] COND TRUE __VERIFIER_nondet_int() [L526] p->h = 1 [L527] t = (List) malloc(sizeof(struct node)) VAL [a={-1:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, t={-2:0}] [L528] COND FALSE !(t == 0) VAL [a={-1:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, t={-2:0}] [L529] p->n = t [L530] EXPR p->n [L530] p = p->n [L525] COND FALSE !(__VERIFIER_nondet_int()) [L532] COND TRUE __VERIFIER_nondet_int() [L533] p->h = 2 [L534] t = (List) malloc(sizeof(struct node)) VAL [a={-1:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, malloc(sizeof(struct node))={-3:0}, p={-2:0}, t={-3:0}] [L535] COND FALSE !(t == 0) VAL [a={-1:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, malloc(sizeof(struct node))={-3:0}, p={-2:0}, t={-3:0}] [L536] p->n = t [L537] EXPR p->n [L537] p = p->n [L532] COND FALSE !(__VERIFIER_nondet_int()) [L539] p->h = 3 [L540] p = a VAL [a={-1:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, malloc(sizeof(struct node))={-3:0}, p={-1:0}, t={-3:0}] [L541] EXPR p->h VAL [a={-1:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, malloc(sizeof(struct node))={-3:0}, p={-1:0}, p->h=1, t={-3:0}] [L541] COND FALSE !(p->h == 2) [L543] EXPR p->h VAL [a={-1:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, malloc(sizeof(struct node))={-3:0}, p={-1:0}, p->h=1, t={-3:0}] [L543] COND TRUE p->h == 1 [L544] EXPR p->n [L544] p = p->n [L543] EXPR p->h VAL [a={-1:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, malloc(sizeof(struct node))={-3:0}, p={-2:0}, p->h=2, t={-3:0}] [L543] COND FALSE !(p->h == 1) [L545] EXPR p->h VAL [a={-1:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, malloc(sizeof(struct node))={-3:0}, p={-2:0}, p->h=2, t={-3:0}] [L545] COND TRUE p->h != 3 [L546] __VERIFIER_error() VAL [a={-1:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, malloc(sizeof(struct node))={-3:0}, p={-2:0}, t={-3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 15.9s, OverallIterations: 13, TraceHistogramMax: 3, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 249 SDtfs, 550 SDslu, 1337 SDs, 0 SdLazy, 2300 SolverSat, 246 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 4.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 394 GetRequests, 200 SyntacticMatches, 9 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 151 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 542 NumberOfCodeBlocks, 542 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 492 ConstructedInterpolants, 16 QuantifiedInterpolants, 145504 SizeOfPredicates, 111 NumberOfNonLiveVariables, 926 ConjunctsInSsa, 310 ConjunctsInUnsatCore, 20 InterpolantComputations, 4 PerfectInterpolantSequences, 16/92 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...