/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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-ext3-properties/dll_nullified-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-06 22:31:42,611 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-06 22:31:42,614 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-06 22:31:42,653 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-06 22:31:42,654 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-06 22:31:42,655 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-06 22:31:42,657 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-06 22:31:42,659 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-06 22:31:42,661 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-06 22:31:42,662 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-06 22:31:42,664 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-06 22:31:42,665 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-06 22:31:42,665 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-06 22:31:42,667 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-06 22:31:42,668 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-06 22:31:42,669 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-06 22:31:42,670 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-06 22:31:42,671 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-06 22:31:42,673 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-06 22:31:42,675 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-06 22:31:42,677 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-06 22:31:42,679 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-06 22:31:42,681 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-06 22:31:42,682 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-06 22:31:42,685 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-06 22:31:42,685 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-06 22:31:42,685 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-06 22:31:42,687 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-06 22:31:42,687 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-06 22:31:42,688 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-06 22:31:42,689 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-06 22:31:42,690 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-06 22:31:42,690 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-06 22:31:42,691 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-06 22:31:42,693 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-06 22:31:42,693 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-06 22:31:42,694 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-06 22:31:42,694 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-06 22:31:42,695 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-06 22:31:42,696 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-06 22:31:42,697 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-06 22:31:42,699 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-06 22:31:42,725 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-06 22:31:42,726 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-06 22:31:42,727 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-06 22:31:42,727 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-06 22:31:42,728 INFO L138 SettingsManager]: * Use SBE=true [2020-11-06 22:31:42,728 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-06 22:31:42,728 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-06 22:31:42,728 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-06 22:31:42,729 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-06 22:31:42,729 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-06 22:31:42,729 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-06 22:31:42,729 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-06 22:31:42,730 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-06 22:31:42,730 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-06 22:31:42,730 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-06 22:31:42,730 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-06 22:31:42,731 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-06 22:31:42,731 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-06 22:31:42,731 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-06 22:31:42,731 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-06 22:31:42,732 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-06 22:31:42,732 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-06 22:31:42,732 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-06 22:31:42,733 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-06 22:31:42,733 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-06 22:31:42,733 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-06 22:31:42,733 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-06 22:31:42,734 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-06 22:31:42,734 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-06 22:31:42,734 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-11-06 22:31:43,169 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-06 22:31:43,217 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-06 22:31:43,220 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-06 22:31:43,221 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-06 22:31:43,222 INFO L275 PluginConnector]: CDTParser initialized [2020-11-06 22:31:43,223 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext3-properties/dll_nullified-1.i [2020-11-06 22:31:43,287 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d57d9202/d8a29518213942c5a75d58ed78b3fb89/FLAG6b09ab33e [2020-11-06 22:31:43,981 INFO L306 CDTParser]: Found 1 translation units. [2020-11-06 22:31:43,982 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext3-properties/dll_nullified-1.i [2020-11-06 22:31:44,001 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d57d9202/d8a29518213942c5a75d58ed78b3fb89/FLAG6b09ab33e [2020-11-06 22:31:44,222 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d57d9202/d8a29518213942c5a75d58ed78b3fb89 [2020-11-06 22:31:44,225 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-06 22:31:44,232 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-06 22:31:44,234 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-06 22:31:44,234 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-06 22:31:44,240 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-06 22:31:44,241 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:31:44" (1/1) ... [2020-11-06 22:31:44,244 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@179e0db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:44, skipping insertion in model container [2020-11-06 22:31:44,244 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:31:44" (1/1) ... [2020-11-06 22:31:44,253 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-06 22:31:44,289 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-06 22:31:44,571 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-06 22:31:44,583 INFO L203 MainTranslator]: Completed pre-run [2020-11-06 22:31:44,631 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-06 22:31:44,708 INFO L208 MainTranslator]: Completed translation [2020-11-06 22:31:44,708 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:44 WrapperNode [2020-11-06 22:31:44,709 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-06 22:31:44,710 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-06 22:31:44,710 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-06 22:31:44,710 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-06 22:31:44,722 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:44" (1/1) ... [2020-11-06 22:31:44,724 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:44" (1/1) ... [2020-11-06 22:31:44,764 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:44" (1/1) ... [2020-11-06 22:31:44,764 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:44" (1/1) ... [2020-11-06 22:31:44,798 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:44" (1/1) ... [2020-11-06 22:31:44,803 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:44" (1/1) ... [2020-11-06 22:31:44,807 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:44" (1/1) ... [2020-11-06 22:31:44,814 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-06 22:31:44,815 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-06 22:31:44,815 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-06 22:31:44,815 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-06 22:31:44,816 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-06 22:31:44,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-06 22:31:44,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-06 22:31:44,893 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-06 22:31:44,894 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-11-06 22:31:44,894 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-11-06 22:31:44,894 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2020-11-06 22:31:44,894 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2020-11-06 22:31:44,894 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-06 22:31:44,895 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-06 22:31:44,895 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-06 22:31:44,895 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2020-11-06 22:31:44,895 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2020-11-06 22:31:44,895 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-06 22:31:44,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-06 22:31:44,896 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-06 22:31:44,896 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-11-06 22:31:44,896 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-11-06 22:31:44,896 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-11-06 22:31:44,896 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-11-06 22:31:44,897 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-11-06 22:31:44,897 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-11-06 22:31:44,897 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-11-06 22:31:44,897 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-11-06 22:31:44,897 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-11-06 22:31:44,897 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-11-06 22:31:44,898 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-11-06 22:31:44,898 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-11-06 22:31:44,898 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-11-06 22:31:44,898 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-11-06 22:31:44,898 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-11-06 22:31:44,898 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-11-06 22:31:44,899 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-11-06 22:31:44,899 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-11-06 22:31:44,899 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-11-06 22:31:44,899 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-11-06 22:31:44,899 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-11-06 22:31:44,899 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-11-06 22:31:44,899 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-11-06 22:31:44,900 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-11-06 22:31:44,900 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-11-06 22:31:44,900 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-11-06 22:31:44,900 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-11-06 22:31:44,900 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-11-06 22:31:44,900 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-11-06 22:31:44,901 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-11-06 22:31:44,901 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-11-06 22:31:44,901 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-11-06 22:31:44,901 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-11-06 22:31:44,901 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-11-06 22:31:44,901 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-11-06 22:31:44,901 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-11-06 22:31:44,902 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-11-06 22:31:44,902 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-11-06 22:31:44,902 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-11-06 22:31:44,902 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-11-06 22:31:44,902 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-11-06 22:31:44,902 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-11-06 22:31:44,903 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-11-06 22:31:44,903 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-11-06 22:31:44,903 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-11-06 22:31:44,903 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-11-06 22:31:44,903 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-11-06 22:31:44,903 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-11-06 22:31:44,904 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-11-06 22:31:44,904 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-11-06 22:31:44,904 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-11-06 22:31:44,904 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-11-06 22:31:44,904 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-11-06 22:31:44,904 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-11-06 22:31:44,905 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-11-06 22:31:44,905 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-11-06 22:31:44,905 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-11-06 22:31:44,905 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-11-06 22:31:44,905 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-11-06 22:31:44,905 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-11-06 22:31:44,906 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-11-06 22:31:44,906 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-11-06 22:31:44,906 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-11-06 22:31:44,906 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-11-06 22:31:44,906 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-11-06 22:31:44,906 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-11-06 22:31:44,907 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-11-06 22:31:44,907 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-11-06 22:31:44,907 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-11-06 22:31:44,907 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-11-06 22:31:44,907 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-11-06 22:31:44,907 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-11-06 22:31:44,908 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-11-06 22:31:44,908 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-11-06 22:31:44,908 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-11-06 22:31:44,908 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-11-06 22:31:44,908 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-11-06 22:31:44,908 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-11-06 22:31:44,909 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-11-06 22:31:44,909 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-11-06 22:31:44,909 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-11-06 22:31:44,909 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-11-06 22:31:44,909 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-11-06 22:31:44,909 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-11-06 22:31:44,910 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-11-06 22:31:44,910 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-11-06 22:31:44,910 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-11-06 22:31:44,910 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-11-06 22:31:44,910 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-11-06 22:31:44,910 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-11-06 22:31:44,910 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-11-06 22:31:44,911 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-11-06 22:31:44,911 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-11-06 22:31:44,911 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-11-06 22:31:44,911 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-11-06 22:31:44,911 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-11-06 22:31:44,911 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-11-06 22:31:44,911 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-11-06 22:31:44,912 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-11-06 22:31:44,912 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-11-06 22:31:44,912 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-11-06 22:31:44,912 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-11-06 22:31:44,912 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-11-06 22:31:44,912 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-11-06 22:31:44,912 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2020-11-06 22:31:44,913 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2020-11-06 22:31:44,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-11-06 22:31:44,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-06 22:31:44,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-11-06 22:31:44,913 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-06 22:31:44,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-11-06 22:31:44,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-06 22:31:44,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-06 22:31:44,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-06 22:31:44,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-06 22:31:44,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-06 22:31:45,271 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2020-11-06 22:31:45,543 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-06 22:31:45,543 INFO L298 CfgBuilder]: Removed 3 assume(true) statements. [2020-11-06 22:31:45,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:31:45 BoogieIcfgContainer [2020-11-06 22:31:45,546 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-06 22:31:45,550 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-06 22:31:45,551 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-06 22:31:45,555 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-06 22:31:45,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:31:44" (1/3) ... [2020-11-06 22:31:45,559 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c9380b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:31:45, skipping insertion in model container [2020-11-06 22:31:45,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:44" (2/3) ... [2020-11-06 22:31:45,561 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c9380b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:31:45, skipping insertion in model container [2020-11-06 22:31:45,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:31:45" (3/3) ... [2020-11-06 22:31:45,566 INFO L111 eAbstractionObserver]: Analyzing ICFG dll_nullified-1.i [2020-11-06 22:31:45,596 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-06 22:31:45,601 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-06 22:31:45,614 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-06 22:31:45,653 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-06 22:31:45,653 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-06 22:31:45,653 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-06 22:31:45,653 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-06 22:31:45,653 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-06 22:31:45,653 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-06 22:31:45,653 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-06 22:31:45,654 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-06 22:31:45,687 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2020-11-06 22:31:45,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-06 22:31:45,695 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:31:45,696 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, 1, 1] [2020-11-06 22:31:45,696 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:31:45,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:31:45,705 INFO L82 PathProgramCache]: Analyzing trace with hash 523345448, now seen corresponding path program 1 times [2020-11-06 22:31:45,716 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:31:45,716 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566223930] [2020-11-06 22:31:45,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:31:45,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:45,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:31:45,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:46,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:31:46,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:46,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:31:46,016 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566223930] [2020-11-06 22:31:46,017 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:31:46,017 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:31:46,018 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900300892] [2020-11-06 22:31:46,022 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:31:46,022 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:31:46,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:31:46,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:31:46,038 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 4 states. [2020-11-06 22:31:46,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:31:46,268 INFO L93 Difference]: Finished difference Result 89 states and 128 transitions. [2020-11-06 22:31:46,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-06 22:31:46,270 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-11-06 22:31:46,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:31:46,279 INFO L225 Difference]: With dead ends: 89 [2020-11-06 22:31:46,279 INFO L226 Difference]: Without dead ends: 51 [2020-11-06 22:31:46,282 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:31:46,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-11-06 22:31:46,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 34. [2020-11-06 22:31:46,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-11-06 22:31:46,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2020-11-06 22:31:46,324 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 22 [2020-11-06 22:31:46,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:31:46,325 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2020-11-06 22:31:46,325 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:31:46,325 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2020-11-06 22:31:46,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-06 22:31:46,326 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:31:46,326 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, 1, 1] [2020-11-06 22:31:46,327 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-06 22:31:46,327 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:31:46,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:31:46,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1417062500, now seen corresponding path program 1 times [2020-11-06 22:31:46,328 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:31:46,329 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341839402] [2020-11-06 22:31:46,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:31:46,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:46,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:31:46,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:46,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:31:46,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:46,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:31:46,506 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341839402] [2020-11-06 22:31:46,507 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:31:46,507 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-06 22:31:46,507 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263881742] [2020-11-06 22:31:46,508 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-06 22:31:46,509 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:31:46,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-06 22:31:46,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-06 22:31:46,510 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand 7 states. [2020-11-06 22:31:46,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:31:46,769 INFO L93 Difference]: Finished difference Result 60 states and 78 transitions. [2020-11-06 22:31:46,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-06 22:31:46,769 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-11-06 22:31:46,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:31:46,771 INFO L225 Difference]: With dead ends: 60 [2020-11-06 22:31:46,771 INFO L226 Difference]: Without dead ends: 41 [2020-11-06 22:31:46,772 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-11-06 22:31:46,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-11-06 22:31:46,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 35. [2020-11-06 22:31:46,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-11-06 22:31:46,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2020-11-06 22:31:46,781 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 22 [2020-11-06 22:31:46,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:31:46,781 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2020-11-06 22:31:46,781 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-06 22:31:46,782 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2020-11-06 22:31:46,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-11-06 22:31:46,783 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:31:46,783 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:31:46,783 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-06 22:31:46,783 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:31:46,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:31:46,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1582015078, now seen corresponding path program 1 times [2020-11-06 22:31:46,784 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:31:46,785 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724364546] [2020-11-06 22:31:46,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:31:46,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:46,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:31:46,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:46,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:31:46,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:46,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:31:46,917 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724364546] [2020-11-06 22:31:46,917 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:31:46,917 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-06 22:31:46,918 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052610430] [2020-11-06 22:31:46,918 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-06 22:31:46,918 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:31:46,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-06 22:31:46,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:31:46,919 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. Second operand 5 states. [2020-11-06 22:31:47,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:31:47,111 INFO L93 Difference]: Finished difference Result 67 states and 87 transitions. [2020-11-06 22:31:47,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-06 22:31:47,112 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2020-11-06 22:31:47,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:31:47,113 INFO L225 Difference]: With dead ends: 67 [2020-11-06 22:31:47,113 INFO L226 Difference]: Without dead ends: 41 [2020-11-06 22:31:47,114 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-06 22:31:47,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-11-06 22:31:47,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2020-11-06 22:31:47,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-11-06 22:31:47,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2020-11-06 22:31:47,122 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 29 [2020-11-06 22:31:47,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:31:47,122 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2020-11-06 22:31:47,123 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-06 22:31:47,123 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2020-11-06 22:31:47,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-11-06 22:31:47,124 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:31:47,124 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:31:47,124 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-06 22:31:47,124 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:31:47,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:31:47,125 INFO L82 PathProgramCache]: Analyzing trace with hash 560946724, now seen corresponding path program 1 times [2020-11-06 22:31:47,125 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:31:47,126 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4529823] [2020-11-06 22:31:47,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:31:47,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:47,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:31:47,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:47,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:31:47,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:47,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:31:47,303 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4529823] [2020-11-06 22:31:47,303 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:31:47,304 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-06 22:31:47,304 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281758723] [2020-11-06 22:31:47,304 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-06 22:31:47,305 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:31:47,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-06 22:31:47,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-11-06 22:31:47,306 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand 10 states. [2020-11-06 22:31:47,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:31:47,740 INFO L93 Difference]: Finished difference Result 77 states and 102 transitions. [2020-11-06 22:31:47,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-06 22:31:47,740 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2020-11-06 22:31:47,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:31:47,742 INFO L225 Difference]: With dead ends: 77 [2020-11-06 22:31:47,742 INFO L226 Difference]: Without dead ends: 62 [2020-11-06 22:31:47,743 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2020-11-06 22:31:47,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-11-06 22:31:47,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 49. [2020-11-06 22:31:47,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-11-06 22:31:47,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 61 transitions. [2020-11-06 22:31:47,752 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 61 transitions. Word has length 29 [2020-11-06 22:31:47,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:31:47,752 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 61 transitions. [2020-11-06 22:31:47,752 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-06 22:31:47,752 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 61 transitions. [2020-11-06 22:31:47,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-11-06 22:31:47,753 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:31:47,754 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:31:47,754 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-06 22:31:47,754 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:31:47,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:31:47,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1959013210, now seen corresponding path program 1 times [2020-11-06 22:31:47,756 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:31:47,756 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036817021] [2020-11-06 22:31:47,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:31:47,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:47,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:31:47,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:47,889 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:31:47,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:48,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:31:48,022 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036817021] [2020-11-06 22:31:48,022 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419458197] [2020-11-06 22:31:48,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:31:48,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:48,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-06 22:31:48,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:31:48,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:31:48,340 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:31:48,340 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2020-11-06 22:31:48,340 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665124224] [2020-11-06 22:31:48,341 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-06 22:31:48,341 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:31:48,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-06 22:31:48,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-11-06 22:31:48,342 INFO L87 Difference]: Start difference. First operand 49 states and 61 transitions. Second operand 9 states. [2020-11-06 22:31:48,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:31:48,650 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2020-11-06 22:31:48,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-06 22:31:48,651 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2020-11-06 22:31:48,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:31:48,652 INFO L225 Difference]: With dead ends: 80 [2020-11-06 22:31:48,652 INFO L226 Difference]: Without dead ends: 58 [2020-11-06 22:31:48,653 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2020-11-06 22:31:48,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-11-06 22:31:48,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51. [2020-11-06 22:31:48,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-11-06 22:31:48,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2020-11-06 22:31:48,669 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 29 [2020-11-06 22:31:48,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:31:48,669 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2020-11-06 22:31:48,669 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-06 22:31:48,670 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2020-11-06 22:31:48,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-11-06 22:31:48,671 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:31:48,671 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:31:48,884 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:31:48,885 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:31:48,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:31:48,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1477512026, now seen corresponding path program 1 times [2020-11-06 22:31:48,885 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:31:48,886 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974709995] [2020-11-06 22:31:48,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:31:48,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:48,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:31:48,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:49,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:31:49,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:49,116 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:31:49,117 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974709995] [2020-11-06 22:31:49,117 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054991011] [2020-11-06 22:31:49,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:31:49,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:49,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-06 22:31:49,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:31:49,321 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:31:49,322 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:31:49,322 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 10 [2020-11-06 22:31:49,322 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397013799] [2020-11-06 22:31:49,323 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-06 22:31:49,323 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:31:49,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-06 22:31:49,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-11-06 22:31:49,324 INFO L87 Difference]: Start difference. First operand 51 states and 63 transitions. Second operand 10 states. [2020-11-06 22:31:49,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:31:49,595 INFO L93 Difference]: Finished difference Result 93 states and 118 transitions. [2020-11-06 22:31:49,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-06 22:31:49,596 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2020-11-06 22:31:49,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:31:49,598 INFO L225 Difference]: With dead ends: 93 [2020-11-06 22:31:49,598 INFO L226 Difference]: Without dead ends: 67 [2020-11-06 22:31:49,599 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2020-11-06 22:31:49,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-11-06 22:31:49,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 58. [2020-11-06 22:31:49,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-11-06 22:31:49,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2020-11-06 22:31:49,613 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 36 [2020-11-06 22:31:49,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:31:49,614 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2020-11-06 22:31:49,615 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-06 22:31:49,615 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2020-11-06 22:31:49,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-11-06 22:31:49,616 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:31:49,618 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:31:49,823 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:31:49,824 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:31:49,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:31:49,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1429432292, now seen corresponding path program 2 times [2020-11-06 22:31:49,825 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:31:49,826 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535503578] [2020-11-06 22:31:49,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:31:49,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:49,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:31:49,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:49,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:31:49,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:50,002 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:31:50,002 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535503578] [2020-11-06 22:31:50,003 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554921611] [2020-11-06 22:31:50,003 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:31:50,166 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-06 22:31:50,166 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-06 22:31:50,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-06 22:31:50,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:31:50,212 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:31:50,212 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:31:50,212 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 11 [2020-11-06 22:31:50,213 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102639920] [2020-11-06 22:31:50,213 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-06 22:31:50,213 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:31:50,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-06 22:31:50,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-11-06 22:31:50,214 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand 11 states. [2020-11-06 22:31:50,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:31:50,531 INFO L93 Difference]: Finished difference Result 100 states and 127 transitions. [2020-11-06 22:31:50,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-06 22:31:50,531 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 43 [2020-11-06 22:31:50,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:31:50,533 INFO L225 Difference]: With dead ends: 100 [2020-11-06 22:31:50,533 INFO L226 Difference]: Without dead ends: 74 [2020-11-06 22:31:50,535 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2020-11-06 22:31:50,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-11-06 22:31:50,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 65. [2020-11-06 22:31:50,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-11-06 22:31:50,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 81 transitions. [2020-11-06 22:31:50,543 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 81 transitions. Word has length 43 [2020-11-06 22:31:50,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:31:50,543 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 81 transitions. [2020-11-06 22:31:50,543 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-06 22:31:50,543 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 81 transitions. [2020-11-06 22:31:50,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-11-06 22:31:50,544 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:31:50,545 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:31:50,758 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:31:50,758 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:31:50,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:31:50,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1126200038, now seen corresponding path program 3 times [2020-11-06 22:31:50,760 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:31:50,760 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691886896] [2020-11-06 22:31:50,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:31:50,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:50,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:31:50,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:50,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:31:50,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:51,054 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:31:51,055 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691886896] [2020-11-06 22:31:51,060 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145115478] [2020-11-06 22:31:51,060 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:31:51,495 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-11-06 22:31:51,495 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-06 22:31:51,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 29 conjunts are in the unsatisfiable core [2020-11-06 22:31:51,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:31:51,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-06 22:31:51,619 INFO L382 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 16 treesize of output 17 [2020-11-06 22:31:51,620 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:51,634 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:51,635 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:31:51,635 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:23 [2020-11-06 22:31:51,682 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_int_22|], 10=[|v_#memory_int_24|]} [2020-11-06 22:31:51,687 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-06 22:31:51,707 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:51,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-06 22:31:51,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-06 22:31:51,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-06 22:31:51,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-06 22:31:51,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-06 22:31:51,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-06 22:31:51,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-06 22:31:51,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-06 22:31:51,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-06 22:31:51,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-06 22:31:51,724 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:51,725 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 41 [2020-11-06 22:31:51,726 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:51,738 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:51,740 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:31:51,740 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:66, output treesize:23 [2020-11-06 22:31:51,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-06 22:31:51,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-06 22:31:51,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-06 22:31:51,759 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:51,759 INFO L382 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 36 treesize of output 23 [2020-11-06 22:31:51,761 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:51,769 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:51,770 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:31:51,770 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:20 [2020-11-06 22:31:51,923 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-06 22:31:51,969 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 30 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-11-06 22:31:51,969 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:31:51,970 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2020-11-06 22:31:51,970 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094743019] [2020-11-06 22:31:51,973 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-11-06 22:31:51,973 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:31:51,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-11-06 22:31:51,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2020-11-06 22:31:51,974 INFO L87 Difference]: Start difference. First operand 65 states and 81 transitions. Second operand 21 states. [2020-11-06 22:31:53,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:31:53,665 INFO L93 Difference]: Finished difference Result 119 states and 155 transitions. [2020-11-06 22:31:53,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-11-06 22:31:53,665 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 50 [2020-11-06 22:31:53,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:31:53,667 INFO L225 Difference]: With dead ends: 119 [2020-11-06 22:31:53,668 INFO L226 Difference]: Without dead ends: 93 [2020-11-06 22:31:53,669 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=278, Invalid=1444, Unknown=0, NotChecked=0, Total=1722 [2020-11-06 22:31:53,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-11-06 22:31:53,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 66. [2020-11-06 22:31:53,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-11-06 22:31:53,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 83 transitions. [2020-11-06 22:31:53,677 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 83 transitions. Word has length 50 [2020-11-06 22:31:53,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:31:53,678 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 83 transitions. [2020-11-06 22:31:53,678 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-11-06 22:31:53,678 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 83 transitions. [2020-11-06 22:31:53,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-11-06 22:31:53,683 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:31:53,683 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:31:53,898 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:31:53,899 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:31:53,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:31:53,900 INFO L82 PathProgramCache]: Analyzing trace with hash 655349798, now seen corresponding path program 1 times [2020-11-06 22:31:53,900 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:31:53,900 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696699535] [2020-11-06 22:31:53,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:31:53,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:54,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:31:54,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:54,244 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:31:54,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:54,501 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 44 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-11-06 22:31:54,501 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696699535] [2020-11-06 22:31:54,502 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525534038] [2020-11-06 22:31:54,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:31:54,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:54,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 40 conjunts are in the unsatisfiable core [2020-11-06 22:31:54,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:31:54,741 INFO L382 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-11-06 22:31:54,742 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:54,743 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:54,744 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:31:54,744 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-06 22:31:54,756 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:54,756 INFO L382 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-11-06 22:31:54,757 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:54,759 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:54,759 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:31:54,759 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2020-11-06 22:31:54,798 INFO L348 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2020-11-06 22:31:54,799 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 17 [2020-11-06 22:31:54,800 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:54,805 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:54,806 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:31:54,806 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:21 [2020-11-06 22:31:54,856 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_int_26|], 10=[|v_#memory_int_28|]} [2020-11-06 22:31:54,863 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-06 22:31:54,884 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:54,971 INFO L348 Elim1Store]: treesize reduction 288, result has 10.8 percent of original size [2020-11-06 22:31:54,972 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 46 treesize of output 41 [2020-11-06 22:31:54,973 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:54,985 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:54,987 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:31:54,987 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:64, output treesize:21 [2020-11-06 22:31:55,013 INFO L348 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2020-11-06 22:31:55,014 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2020-11-06 22:31:55,015 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:55,022 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:55,027 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:31:55,027 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:17 [2020-11-06 22:31:55,203 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-06 22:31:55,216 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 44 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-11-06 22:31:55,216 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:31:55,216 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 22 [2020-11-06 22:31:55,216 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044040617] [2020-11-06 22:31:55,217 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-11-06 22:31:55,217 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:31:55,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-11-06 22:31:55,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=415, Unknown=0, NotChecked=0, Total=462 [2020-11-06 22:31:55,218 INFO L87 Difference]: Start difference. First operand 66 states and 83 transitions. Second operand 22 states. [2020-11-06 22:31:56,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:31:56,639 INFO L93 Difference]: Finished difference Result 91 states and 119 transitions. [2020-11-06 22:31:56,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-06 22:31:56,640 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 57 [2020-11-06 22:31:56,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:31:56,641 INFO L225 Difference]: With dead ends: 91 [2020-11-06 22:31:56,641 INFO L226 Difference]: Without dead ends: 76 [2020-11-06 22:31:56,643 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=155, Invalid=1035, Unknown=0, NotChecked=0, Total=1190 [2020-11-06 22:31:56,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-11-06 22:31:56,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 68. [2020-11-06 22:31:56,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-11-06 22:31:56,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 85 transitions. [2020-11-06 22:31:56,651 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 85 transitions. Word has length 57 [2020-11-06 22:31:56,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:31:56,652 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 85 transitions. [2020-11-06 22:31:56,652 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-11-06 22:31:56,652 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 85 transitions. [2020-11-06 22:31:56,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-11-06 22:31:56,653 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:31:56,653 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:31:56,867 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:31:56,868 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:31:56,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:31:56,868 INFO L82 PathProgramCache]: Analyzing trace with hash 657196840, now seen corresponding path program 1 times [2020-11-06 22:31:56,869 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:31:56,869 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743561071] [2020-11-06 22:31:56,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:31:56,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-06 22:31:56,935 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-06 22:31:57,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-06 22:31:57,005 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-06 22:31:57,060 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-06 22:31:57,060 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-06 22:31:57,060 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-06 22:31:57,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:31:57 BoogieIcfgContainer [2020-11-06 22:31:57,164 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-06 22:31:57,166 INFO L168 Benchmark]: Toolchain (without parser) took 12937.99 ms. Allocated memory was 151.0 MB in the beginning and 262.1 MB in the end (delta: 111.1 MB). Free memory was 125.8 MB in the beginning and 100.6 MB in the end (delta: 25.2 MB). Peak memory consumption was 137.3 MB. Max. memory is 8.0 GB. [2020-11-06 22:31:57,166 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 125.8 MB. Free memory was 103.7 MB in the beginning and 103.5 MB in the end (delta: 125.9 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-06 22:31:57,171 INFO L168 Benchmark]: CACSL2BoogieTranslator took 475.05 ms. Allocated memory is still 151.0 MB. Free memory was 125.3 MB in the beginning and 103.2 MB in the end (delta: 22.1 MB). Peak memory consumption was 22.0 MB. Max. memory is 8.0 GB. [2020-11-06 22:31:57,172 INFO L168 Benchmark]: Boogie Preprocessor took 104.30 ms. Allocated memory is still 151.0 MB. Free memory was 103.2 MB in the beginning and 133.1 MB in the end (delta: -29.9 MB). Peak memory consumption was 5.7 MB. Max. memory is 8.0 GB. [2020-11-06 22:31:57,173 INFO L168 Benchmark]: RCFGBuilder took 731.01 ms. Allocated memory is still 151.0 MB. Free memory was 133.1 MB in the beginning and 89.6 MB in the end (delta: 43.5 MB). Peak memory consumption was 43.0 MB. Max. memory is 8.0 GB. [2020-11-06 22:31:57,174 INFO L168 Benchmark]: TraceAbstraction took 11614.33 ms. Allocated memory was 151.0 MB in the beginning and 262.1 MB in the end (delta: 111.1 MB). Free memory was 89.1 MB in the beginning and 100.6 MB in the end (delta: -11.6 MB). Peak memory consumption was 99.0 MB. Max. memory is 8.0 GB. [2020-11-06 22:31:57,180 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 125.8 MB. Free memory was 103.7 MB in the beginning and 103.5 MB in the end (delta: 125.9 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 475.05 ms. Allocated memory is still 151.0 MB. Free memory was 125.3 MB in the beginning and 103.2 MB in the end (delta: 22.1 MB). Peak memory consumption was 22.0 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 104.30 ms. Allocated memory is still 151.0 MB. Free memory was 103.2 MB in the beginning and 133.1 MB in the end (delta: -29.9 MB). Peak memory consumption was 5.7 MB. Max. memory is 8.0 GB. * RCFGBuilder took 731.01 ms. Allocated memory is still 151.0 MB. Free memory was 133.1 MB in the beginning and 89.6 MB in the end (delta: 43.5 MB). Peak memory consumption was 43.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 11614.33 ms. Allocated memory was 151.0 MB in the beginning and 262.1 MB in the end (delta: 111.1 MB). Free memory was 89.1 MB in the beginning and 100.6 MB in the end (delta: -11.6 MB). Peak memory consumption was 99.0 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 12]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L599] const int len = 5; VAL [len=5] [L600] CALL, EXPR dll_create(len) VAL [\old(len)=5] [L579] DLL head = ((void *)0); VAL [\old(len)=5, head={0:0}, len=5] [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L582] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L585] new_head->data_0 = 0 [L586] new_head->data_1 = 0 [L587] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=5, __VERIFIER_nondet_int() == len? 1 : 0=1, head={0:0}, len=5, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L588] new_head->next = head [L589] new_head->prev = ((void *)0) VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L590] COND FALSE !(\read(head)) VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L593] head = new_head [L594] len-- VAL [\old(len)=5, head={-1:0}, len=4, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={-1:0}, len=4, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L582] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={-1:0}, len=4, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L585] new_head->data_0 = 0 [L586] new_head->data_1 = 0 [L587] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=4, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-1:0}, len=4, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L588] new_head->next = head [L589] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-1:0}, len=4, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L590] COND TRUE \read(head) [L591] head->prev = new_head VAL [\old(len)=5, head={-1:0}, len=4, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L593] head = new_head [L594] len-- VAL [\old(len)=5, head={-2:0}, len=3, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={-2:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L582] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={-2:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L585] new_head->data_0 = 0 [L586] new_head->data_1 = 0 [L587] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=3, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-2:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L588] new_head->next = head [L589] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-2:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L590] COND TRUE \read(head) [L591] head->prev = new_head VAL [\old(len)=5, head={-2:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L593] head = new_head [L594] len-- VAL [\old(len)=5, head={-3:0}, len=2, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={-3:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L582] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={-3:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L585] new_head->data_0 = 0 [L586] new_head->data_1 = 0 [L587] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=2, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-3:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L588] new_head->next = head [L589] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-3:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L590] COND TRUE \read(head) [L591] head->prev = new_head VAL [\old(len)=5, head={-3:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L593] head = new_head [L594] len-- VAL [\old(len)=5, head={-4:0}, len=1, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={-4:0}, len=1, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L582] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={-4:0}, len=1, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L585] new_head->data_0 = 0 [L586] new_head->data_1 = 0 [L587] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=1, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-4:0}, len=1, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L588] new_head->next = head [L589] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-4:0}, len=1, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L590] COND TRUE \read(head) [L591] head->prev = new_head VAL [\old(len)=5, head={-4:0}, len=1, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L593] head = new_head [L594] len-- VAL [\old(len)=5, head={-5:0}, len=0, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L580] COND FALSE !(len > 0) VAL [\old(len)=5, head={-5:0}, len=0, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L596] return head; VAL [\old(len)=5, \result={-5:0}, head={-5:0}, len=0, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L600] RET, EXPR dll_create(len) VAL [dll_create(len)={-5:0}, len=5] [L600] DLL head = dll_create(len); [L601] head->next VAL [head={-5:0}, head->next={-4:0}, len=5] [L601] COND TRUE head->next [L602] EXPR head->data_0 [L602] EXPR 0 != head->data_0 || 0 != head->data_1 [L602] EXPR head->data_1 [L602] EXPR 0 != head->data_0 || 0 != head->data_1 VAL [0 != head->data_0 || 0 != head->data_1=0, head={-5:0}, head->data_0=0, head->data_1=0, len=5] [L602] 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 [L602] EXPR head->data_2 [L602] 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 VAL [0 != head->data_0 || 0 != head->data_1=0, 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2=1, head={-5:0}, head->data_0=0, head->data_1=0, head->data_2=1, len=5] [L602] COND TRUE 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 [L616] CALL reach_error() [L12] COND FALSE !(0) [L12] __assert_fail ("0", "dll_nullified-1.c", 3, __extension__ __PRETTY_FUNCTION__) - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 52 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 11.4s, OverallIterations: 10, TraceHistogramMax: 5, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 306 SDtfs, 582 SDslu, 1313 SDs, 0 SdLazy, 1901 SolverSat, 230 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 381 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=9, 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, 9 MinimizatonAttempts, 97 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 589 NumberOfCodeBlocks, 582 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 518 ConstructedInterpolants, 0 QuantifiedInterpolants, 89775 SizeOfPredicates, 37 NumberOfNonLiveVariables, 1170 ConjunctsInSsa, 87 ConjunctsInUnsatCore, 14 InterpolantComputations, 4 PerfectInterpolantSequences, 177/312 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...