/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/list-ext3-properties/dll_nullified-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 22:08:31,176 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 22:08:31,182 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 22:08:31,225 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 22:08:31,225 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 22:08:31,233 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 22:08:31,237 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 22:08:31,240 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 22:08:31,243 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 22:08:31,245 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 22:08:31,246 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 22:08:31,247 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 22:08:31,247 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 22:08:31,250 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 22:08:31,252 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 22:08:31,254 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 22:08:31,256 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 22:08:31,257 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 22:08:31,258 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 22:08:31,266 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 22:08:31,269 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 22:08:31,270 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 22:08:31,271 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 22:08:31,271 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 22:08:31,283 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 22:08:31,284 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 22:08:31,284 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 22:08:31,290 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 22:08:31,291 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 22:08:31,292 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 22:08:31,292 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 22:08:31,293 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 22:08:31,293 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 22:08:31,294 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 22:08:31,298 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 22:08:31,299 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 22:08:31,299 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 22:08:31,300 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 22:08:31,300 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 22:08:31,303 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 22:08:31,304 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 22:08:31,305 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-09-04 22:08:31,323 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 22:08:31,323 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 22:08:31,325 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 22:08:31,325 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 22:08:31,326 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 22:08:31,326 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 22:08:31,326 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 22:08:31,326 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 22:08:31,327 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 22:08:31,327 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 22:08:31,328 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 22:08:31,328 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 22:08:31,328 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 22:08:31,328 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 22:08:31,329 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 22:08:31,329 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 22:08:31,329 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 22:08:31,330 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 22:08:31,330 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 22:08:31,330 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 22:08:31,330 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 22:08:31,331 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 22:08:31,331 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-09-04 22:08:31,746 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 22:08:31,761 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 22:08:31,765 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 22:08:31,766 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 22:08:31,767 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 22:08:31,768 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext3-properties/dll_nullified-1.i [2020-09-04 22:08:31,854 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/509c6f566/82ab6abf735a4ba09ee66a99a0256177/FLAG60acf3698 [2020-09-04 22:08:32,503 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 22:08:32,504 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/list-ext3-properties/dll_nullified-1.i [2020-09-04 22:08:32,518 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/509c6f566/82ab6abf735a4ba09ee66a99a0256177/FLAG60acf3698 [2020-09-04 22:08:32,748 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/509c6f566/82ab6abf735a4ba09ee66a99a0256177 [2020-09-04 22:08:32,760 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 22:08:32,762 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 22:08:32,763 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 22:08:32,763 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 22:08:32,767 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 22:08:32,768 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 10:08:32" (1/1) ... [2020-09-04 22:08:32,771 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ee39e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:08:32, skipping insertion in model container [2020-09-04 22:08:32,772 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 10:08:32" (1/1) ... [2020-09-04 22:08:32,780 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 22:08:32,831 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 22:08:33,379 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 22:08:33,398 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 22:08:33,447 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 22:08:33,503 INFO L208 MainTranslator]: Completed translation [2020-09-04 22:08:33,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:08:33 WrapperNode [2020-09-04 22:08:33,504 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 22:08:33,504 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 22:08:33,505 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 22:08:33,505 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 22:08:33,523 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:08:33" (1/1) ... [2020-09-04 22:08:33,523 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:08:33" (1/1) ... [2020-09-04 22:08:33,541 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:08:33" (1/1) ... [2020-09-04 22:08:33,542 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:08:33" (1/1) ... [2020-09-04 22:08:33,570 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:08:33" (1/1) ... [2020-09-04 22:08:33,581 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:08:33" (1/1) ... [2020-09-04 22:08:33,587 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:08:33" (1/1) ... [2020-09-04 22:08:33,598 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 22:08:33,599 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 22:08:33,599 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 22:08:33,599 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 22:08:33,604 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:08:33" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 22:08:33,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 22:08:33,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 22:08:33,680 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-09-04 22:08:33,680 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-09-04 22:08:33,680 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2020-09-04 22:08:33,681 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2020-09-04 22:08:33,681 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 22:08:33,681 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 22:08:33,681 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 22:08:33,681 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-09-04 22:08:33,682 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-09-04 22:08:33,682 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-09-04 22:08:33,682 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-09-04 22:08:33,682 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-09-04 22:08:33,682 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-09-04 22:08:33,683 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-09-04 22:08:33,683 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-09-04 22:08:33,683 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-09-04 22:08:33,683 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-09-04 22:08:33,684 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-09-04 22:08:33,684 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-09-04 22:08:33,684 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-09-04 22:08:33,684 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-09-04 22:08:33,684 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-09-04 22:08:33,685 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-09-04 22:08:33,685 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-09-04 22:08:33,685 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-09-04 22:08:33,685 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-09-04 22:08:33,685 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-09-04 22:08:33,686 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-09-04 22:08:33,686 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-09-04 22:08:33,686 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-09-04 22:08:33,686 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-09-04 22:08:33,686 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-09-04 22:08:33,686 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-09-04 22:08:33,687 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-09-04 22:08:33,687 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-09-04 22:08:33,687 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-09-04 22:08:33,687 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-09-04 22:08:33,687 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-09-04 22:08:33,687 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-09-04 22:08:33,688 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-09-04 22:08:33,688 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-09-04 22:08:33,688 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-09-04 22:08:33,688 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-09-04 22:08:33,688 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-09-04 22:08:33,688 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-09-04 22:08:33,689 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-09-04 22:08:33,689 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-09-04 22:08:33,689 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-09-04 22:08:33,689 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-09-04 22:08:33,689 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-09-04 22:08:33,689 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-09-04 22:08:33,689 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-09-04 22:08:33,689 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-09-04 22:08:33,689 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-09-04 22:08:33,690 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-09-04 22:08:33,690 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-09-04 22:08:33,690 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-09-04 22:08:33,690 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-09-04 22:08:33,690 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-09-04 22:08:33,690 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-09-04 22:08:33,690 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-09-04 22:08:33,691 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-09-04 22:08:33,691 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-09-04 22:08:33,691 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-09-04 22:08:33,691 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-09-04 22:08:33,691 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-09-04 22:08:33,691 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-09-04 22:08:33,691 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-09-04 22:08:33,691 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-09-04 22:08:33,692 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-09-04 22:08:33,692 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-09-04 22:08:33,692 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-09-04 22:08:33,692 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-09-04 22:08:33,692 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-09-04 22:08:33,692 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-09-04 22:08:33,692 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-09-04 22:08:33,693 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-09-04 22:08:33,693 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-09-04 22:08:33,693 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-09-04 22:08:33,693 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-09-04 22:08:33,693 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-09-04 22:08:33,693 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-09-04 22:08:33,694 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-09-04 22:08:33,694 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-09-04 22:08:33,694 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-09-04 22:08:33,694 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-09-04 22:08:33,694 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-09-04 22:08:33,694 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-09-04 22:08:33,695 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-09-04 22:08:33,695 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-09-04 22:08:33,695 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-09-04 22:08:33,695 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-09-04 22:08:33,695 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-09-04 22:08:33,695 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-09-04 22:08:33,696 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-09-04 22:08:33,696 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-09-04 22:08:33,696 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-09-04 22:08:33,696 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-09-04 22:08:33,696 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-09-04 22:08:33,696 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-09-04 22:08:33,697 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-09-04 22:08:33,697 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-09-04 22:08:33,697 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-09-04 22:08:33,697 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-09-04 22:08:33,697 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-09-04 22:08:33,697 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-09-04 22:08:33,697 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-09-04 22:08:33,697 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-09-04 22:08:33,698 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-09-04 22:08:33,698 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-09-04 22:08:33,698 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-09-04 22:08:33,698 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-09-04 22:08:33,698 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2020-09-04 22:08:33,698 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2020-09-04 22:08:33,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-09-04 22:08:33,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-09-04 22:08:33,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-09-04 22:08:33,699 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 22:08:33,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-09-04 22:08:33,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-09-04 22:08:33,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-09-04 22:08:33,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 22:08:33,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 22:08:34,087 INFO L732 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2020-09-04 22:08:34,353 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 22:08:34,353 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-09-04 22:08:34,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 10:08:34 BoogieIcfgContainer [2020-09-04 22:08:34,359 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 22:08:34,360 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 22:08:34,361 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 22:08:34,364 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 22:08:34,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 10:08:32" (1/3) ... [2020-09-04 22:08:34,365 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aaf341 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 10:08:34, skipping insertion in model container [2020-09-04 22:08:34,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:08:33" (2/3) ... [2020-09-04 22:08:34,366 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aaf341 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 10:08:34, skipping insertion in model container [2020-09-04 22:08:34,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 10:08:34" (3/3) ... [2020-09-04 22:08:34,368 INFO L109 eAbstractionObserver]: Analyzing ICFG dll_nullified-1.i [2020-09-04 22:08:34,380 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 22:08:34,390 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 22:08:34,412 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 22:08:34,436 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 22:08:34,436 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 22:08:34,436 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-04 22:08:34,437 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 22:08:34,437 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 22:08:34,437 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 22:08:34,438 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 22:08:34,438 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 22:08:34,456 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states. [2020-09-04 22:08:34,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-09-04 22:08:34,469 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:08:34,471 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, 1, 1, 1] [2020-09-04 22:08:34,471 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:08:34,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:08:34,478 INFO L82 PathProgramCache]: Analyzing trace with hash 136898680, now seen corresponding path program 1 times [2020-09-04 22:08:34,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:08:34,488 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1770535545] [2020-09-04 22:08:34,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:08:34,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:34,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:08:34,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:34,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-04 22:08:34,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:34,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 22:08:34,745 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1770535545] [2020-09-04 22:08:34,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 22:08:34,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-04 22:08:34,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103970536] [2020-09-04 22:08:34,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-04 22:08:34,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:08:34,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-04 22:08:34,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-04 22:08:34,777 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 4 states. [2020-09-04 22:08:35,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:08:35,144 INFO L93 Difference]: Finished difference Result 230 states and 265 transitions. [2020-09-04 22:08:35,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-09-04 22:08:35,146 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2020-09-04 22:08:35,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:08:35,160 INFO L225 Difference]: With dead ends: 230 [2020-09-04 22:08:35,160 INFO L226 Difference]: Without dead ends: 153 [2020-09-04 22:08:35,165 INFO L675 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-09-04 22:08:35,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2020-09-04 22:08:35,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 92. [2020-09-04 22:08:35,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-09-04 22:08:35,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2020-09-04 22:08:35,219 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 32 [2020-09-04 22:08:35,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:08:35,220 INFO L479 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2020-09-04 22:08:35,220 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-04 22:08:35,220 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2020-09-04 22:08:35,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-09-04 22:08:35,222 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:08:35,222 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, 1, 1, 1] [2020-09-04 22:08:35,222 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 22:08:35,223 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:08:35,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:08:35,223 INFO L82 PathProgramCache]: Analyzing trace with hash 272796752, now seen corresponding path program 1 times [2020-09-04 22:08:35,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:08:35,224 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1292493963] [2020-09-04 22:08:35,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:08:35,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:35,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:08:35,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:35,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-04 22:08:35,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:35,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 22:08:35,387 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1292493963] [2020-09-04 22:08:35,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 22:08:35,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 22:08:35,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543329421] [2020-09-04 22:08:35,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 22:08:35,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:08:35,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 22:08:35,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-09-04 22:08:35,391 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand 7 states. [2020-09-04 22:08:35,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:08:35,749 INFO L93 Difference]: Finished difference Result 172 states and 190 transitions. [2020-09-04 22:08:35,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 22:08:35,750 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2020-09-04 22:08:35,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:08:35,752 INFO L225 Difference]: With dead ends: 172 [2020-09-04 22:08:35,752 INFO L226 Difference]: Without dead ends: 112 [2020-09-04 22:08:35,754 INFO L675 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-09-04 22:08:35,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-09-04 22:08:35,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 93. [2020-09-04 22:08:35,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-09-04 22:08:35,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2020-09-04 22:08:35,770 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 32 [2020-09-04 22:08:35,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:08:35,771 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2020-09-04 22:08:35,771 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 22:08:35,771 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2020-09-04 22:08:35,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-09-04 22:08:35,773 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:08:35,773 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 22:08:35,773 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 22:08:35,773 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:08:35,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:08:35,774 INFO L82 PathProgramCache]: Analyzing trace with hash -54471897, now seen corresponding path program 1 times [2020-09-04 22:08:35,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:08:35,775 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1330024888] [2020-09-04 22:08:35,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:08:35,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:35,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:08:35,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:35,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-04 22:08:35,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:36,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 22:08:36,020 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1330024888] [2020-09-04 22:08:36,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 22:08:36,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-09-04 22:08:36,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739514776] [2020-09-04 22:08:36,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 22:08:36,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:08:36,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 22:08:36,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-09-04 22:08:36,022 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand 9 states. [2020-09-04 22:08:36,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:08:36,378 INFO L93 Difference]: Finished difference Result 193 states and 213 transitions. [2020-09-04 22:08:36,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 22:08:36,378 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2020-09-04 22:08:36,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:08:36,380 INFO L225 Difference]: With dead ends: 193 [2020-09-04 22:08:36,380 INFO L226 Difference]: Without dead ends: 133 [2020-09-04 22:08:36,382 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2020-09-04 22:08:36,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-09-04 22:08:36,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 114. [2020-09-04 22:08:36,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2020-09-04 22:08:36,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 125 transitions. [2020-09-04 22:08:36,398 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 125 transitions. Word has length 51 [2020-09-04 22:08:36,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:08:36,398 INFO L479 AbstractCegarLoop]: Abstraction has 114 states and 125 transitions. [2020-09-04 22:08:36,399 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 22:08:36,399 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 125 transitions. [2020-09-04 22:08:36,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-09-04 22:08:36,401 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:08:36,402 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 22:08:36,402 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 22:08:36,402 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:08:36,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:08:36,402 INFO L82 PathProgramCache]: Analyzing trace with hash -586426640, now seen corresponding path program 2 times [2020-09-04 22:08:36,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:08:36,403 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1031396314] [2020-09-04 22:08:36,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:08:36,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:36,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:08:36,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:36,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-04 22:08:36,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:36,610 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 22:08:36,611 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1031396314] [2020-09-04 22:08:36,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 22:08:36,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-04 22:08:36,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837435224] [2020-09-04 22:08:36,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 22:08:36,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:08:36,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 22:08:36,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-09-04 22:08:36,613 INFO L87 Difference]: Start difference. First operand 114 states and 125 transitions. Second operand 7 states. [2020-09-04 22:08:36,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:08:36,940 INFO L93 Difference]: Finished difference Result 195 states and 215 transitions. [2020-09-04 22:08:36,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 22:08:36,941 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2020-09-04 22:08:36,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:08:36,942 INFO L225 Difference]: With dead ends: 195 [2020-09-04 22:08:36,942 INFO L226 Difference]: Without dead ends: 114 [2020-09-04 22:08:36,944 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-09-04 22:08:36,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-09-04 22:08:36,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2020-09-04 22:08:36,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2020-09-04 22:08:36,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 124 transitions. [2020-09-04 22:08:36,972 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 124 transitions. Word has length 70 [2020-09-04 22:08:36,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:08:36,972 INFO L479 AbstractCegarLoop]: Abstraction has 114 states and 124 transitions. [2020-09-04 22:08:36,973 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 22:08:36,975 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 124 transitions. [2020-09-04 22:08:36,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-09-04 22:08:36,979 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:08:36,982 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 22:08:36,983 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 22:08:36,983 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:08:36,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:08:36,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1356086606, now seen corresponding path program 1 times [2020-09-04 22:08:36,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:08:36,984 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1205858219] [2020-09-04 22:08:36,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:08:37,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:37,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:08:37,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:37,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-04 22:08:37,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:37,219 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 22:08:37,220 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1205858219] [2020-09-04 22:08:37,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 22:08:37,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-09-04 22:08:37,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180175341] [2020-09-04 22:08:37,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 22:08:37,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:08:37,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 22:08:37,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-09-04 22:08:37,222 INFO L87 Difference]: Start difference. First operand 114 states and 124 transitions. Second operand 11 states. [2020-09-04 22:08:37,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:08:37,658 INFO L93 Difference]: Finished difference Result 214 states and 233 transitions. [2020-09-04 22:08:37,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-04 22:08:37,659 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 71 [2020-09-04 22:08:37,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:08:37,661 INFO L225 Difference]: With dead ends: 214 [2020-09-04 22:08:37,661 INFO L226 Difference]: Without dead ends: 154 [2020-09-04 22:08:37,665 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2020-09-04 22:08:37,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2020-09-04 22:08:37,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 135. [2020-09-04 22:08:37,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-09-04 22:08:37,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 146 transitions. [2020-09-04 22:08:37,703 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 146 transitions. Word has length 71 [2020-09-04 22:08:37,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:08:37,706 INFO L479 AbstractCegarLoop]: Abstraction has 135 states and 146 transitions. [2020-09-04 22:08:37,707 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 22:08:37,707 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 146 transitions. [2020-09-04 22:08:37,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-09-04 22:08:37,715 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:08:37,716 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 22:08:37,716 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 22:08:37,716 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:08:37,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:08:37,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1395228995, now seen corresponding path program 2 times [2020-09-04 22:08:37,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:08:37,717 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1983772702] [2020-09-04 22:08:37,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:08:37,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:37,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:08:37,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:37,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-04 22:08:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:38,111 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 22:08:38,112 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1983772702] [2020-09-04 22:08:38,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 22:08:38,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-09-04 22:08:38,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173072776] [2020-09-04 22:08:38,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 22:08:38,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:08:38,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 22:08:38,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-09-04 22:08:38,114 INFO L87 Difference]: Start difference. First operand 135 states and 146 transitions. Second operand 13 states. [2020-09-04 22:08:38,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:08:38,638 INFO L93 Difference]: Finished difference Result 235 states and 255 transitions. [2020-09-04 22:08:38,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-04 22:08:38,638 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 91 [2020-09-04 22:08:38,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:08:38,641 INFO L225 Difference]: With dead ends: 235 [2020-09-04 22:08:38,641 INFO L226 Difference]: Without dead ends: 175 [2020-09-04 22:08:38,643 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2020-09-04 22:08:38,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2020-09-04 22:08:38,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 156. [2020-09-04 22:08:38,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2020-09-04 22:08:38,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 168 transitions. [2020-09-04 22:08:38,662 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 168 transitions. Word has length 91 [2020-09-04 22:08:38,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:08:38,663 INFO L479 AbstractCegarLoop]: Abstraction has 156 states and 168 transitions. [2020-09-04 22:08:38,663 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 22:08:38,663 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 168 transitions. [2020-09-04 22:08:38,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-09-04 22:08:38,665 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:08:38,665 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 22:08:38,665 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 22:08:38,666 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:08:38,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:08:38,666 INFO L82 PathProgramCache]: Analyzing trace with hash 274581320, now seen corresponding path program 3 times [2020-09-04 22:08:38,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:08:38,667 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1629278120] [2020-09-04 22:08:38,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:08:38,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:38,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:08:38,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:38,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-04 22:08:38,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:39,159 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 22:08:39,160 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1629278120] [2020-09-04 22:08:39,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 22:08:39,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-09-04 22:08:39,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762719954] [2020-09-04 22:08:39,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-09-04 22:08:39,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:08:39,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-09-04 22:08:39,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2020-09-04 22:08:39,163 INFO L87 Difference]: Start difference. First operand 156 states and 168 transitions. Second operand 15 states. [2020-09-04 22:08:39,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:08:39,694 INFO L93 Difference]: Finished difference Result 256 states and 277 transitions. [2020-09-04 22:08:39,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-09-04 22:08:39,695 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 111 [2020-09-04 22:08:39,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:08:39,697 INFO L225 Difference]: With dead ends: 256 [2020-09-04 22:08:39,697 INFO L226 Difference]: Without dead ends: 196 [2020-09-04 22:08:39,698 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=155, Invalid=547, Unknown=0, NotChecked=0, Total=702 [2020-09-04 22:08:39,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2020-09-04 22:08:39,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 177. [2020-09-04 22:08:39,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2020-09-04 22:08:39,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 190 transitions. [2020-09-04 22:08:39,716 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 190 transitions. Word has length 111 [2020-09-04 22:08:39,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:08:39,716 INFO L479 AbstractCegarLoop]: Abstraction has 177 states and 190 transitions. [2020-09-04 22:08:39,716 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-09-04 22:08:39,717 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 190 transitions. [2020-09-04 22:08:39,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2020-09-04 22:08:39,718 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:08:39,719 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 22:08:39,719 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 22:08:39,719 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:08:39,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:08:39,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1182686291, now seen corresponding path program 4 times [2020-09-04 22:08:39,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:08:39,720 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1691654905] [2020-09-04 22:08:39,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:08:39,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:39,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:08:39,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:39,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-04 22:08:39,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:40,309 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 118 proven. 19 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2020-09-04 22:08:40,310 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1691654905] [2020-09-04 22:08:40,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 22:08:40,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-09-04 22:08:40,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108052728] [2020-09-04 22:08:40,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-09-04 22:08:40,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:08:40,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-09-04 22:08:40,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2020-09-04 22:08:40,312 INFO L87 Difference]: Start difference. First operand 177 states and 190 transitions. Second operand 17 states. [2020-09-04 22:08:41,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:08:41,232 INFO L93 Difference]: Finished difference Result 308 states and 334 transitions. [2020-09-04 22:08:41,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-09-04 22:08:41,232 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 131 [2020-09-04 22:08:41,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:08:41,235 INFO L225 Difference]: With dead ends: 308 [2020-09-04 22:08:41,236 INFO L226 Difference]: Without dead ends: 253 [2020-09-04 22:08:41,237 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=165, Invalid=827, Unknown=0, NotChecked=0, Total=992 [2020-09-04 22:08:41,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2020-09-04 22:08:41,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 183. [2020-09-04 22:08:41,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2020-09-04 22:08:41,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 197 transitions. [2020-09-04 22:08:41,262 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 197 transitions. Word has length 131 [2020-09-04 22:08:41,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:08:41,263 INFO L479 AbstractCegarLoop]: Abstraction has 183 states and 197 transitions. [2020-09-04 22:08:41,263 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-09-04 22:08:41,264 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 197 transitions. [2020-09-04 22:08:41,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-09-04 22:08:41,265 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:08:41,266 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 22:08:41,266 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 22:08:41,266 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:08:41,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:08:41,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1200683152, now seen corresponding path program 1 times [2020-09-04 22:08:41,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:08:41,267 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2111383793] [2020-09-04 22:08:41,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:08:41,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:41,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:08:41,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:41,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-04 22:08:41,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:42,089 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 118 proven. 19 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2020-09-04 22:08:42,091 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2111383793] [2020-09-04 22:08:42,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 22:08:42,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-09-04 22:08:42,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600100683] [2020-09-04 22:08:42,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-09-04 22:08:42,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:08:42,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-09-04 22:08:42,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2020-09-04 22:08:42,101 INFO L87 Difference]: Start difference. First operand 183 states and 197 transitions. Second operand 18 states. [2020-09-04 22:08:43,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:08:43,354 INFO L93 Difference]: Finished difference Result 286 states and 310 transitions. [2020-09-04 22:08:43,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-09-04 22:08:43,355 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 133 [2020-09-04 22:08:43,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:08:43,357 INFO L225 Difference]: With dead ends: 286 [2020-09-04 22:08:43,357 INFO L226 Difference]: Without dead ends: 231 [2020-09-04 22:08:43,358 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=177, Invalid=1013, Unknown=0, NotChecked=0, Total=1190 [2020-09-04 22:08:43,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2020-09-04 22:08:43,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 187. [2020-09-04 22:08:43,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-09-04 22:08:43,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 201 transitions. [2020-09-04 22:08:43,383 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 201 transitions. Word has length 133 [2020-09-04 22:08:43,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:08:43,383 INFO L479 AbstractCegarLoop]: Abstraction has 187 states and 201 transitions. [2020-09-04 22:08:43,383 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-09-04 22:08:43,384 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 201 transitions. [2020-09-04 22:08:43,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-09-04 22:08:43,389 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:08:43,390 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 22:08:43,390 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 22:08:43,391 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:08:43,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:08:43,398 INFO L82 PathProgramCache]: Analyzing trace with hash 2062394754, now seen corresponding path program 1 times [2020-09-04 22:08:43,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:08:43,399 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1002231421] [2020-09-04 22:08:43,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:08:43,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:43,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:08:43,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:43,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-04 22:08:43,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:44,015 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 118 proven. 19 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2020-09-04 22:08:44,016 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1002231421] [2020-09-04 22:08:44,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 22:08:44,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-09-04 22:08:44,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906419652] [2020-09-04 22:08:44,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-09-04 22:08:44,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:08:44,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-09-04 22:08:44,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2020-09-04 22:08:44,018 INFO L87 Difference]: Start difference. First operand 187 states and 201 transitions. Second operand 17 states. [2020-09-04 22:08:45,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:08:45,212 INFO L93 Difference]: Finished difference Result 281 states and 301 transitions. [2020-09-04 22:08:45,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-09-04 22:08:45,213 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 135 [2020-09-04 22:08:45,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:08:45,216 INFO L225 Difference]: With dead ends: 281 [2020-09-04 22:08:45,216 INFO L226 Difference]: Without dead ends: 253 [2020-09-04 22:08:45,217 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=165, Invalid=827, Unknown=0, NotChecked=0, Total=992 [2020-09-04 22:08:45,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2020-09-04 22:08:45,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 195. [2020-09-04 22:08:45,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2020-09-04 22:08:45,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 209 transitions. [2020-09-04 22:08:45,256 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 209 transitions. Word has length 135 [2020-09-04 22:08:45,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:08:45,257 INFO L479 AbstractCegarLoop]: Abstraction has 195 states and 209 transitions. [2020-09-04 22:08:45,257 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-09-04 22:08:45,257 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 209 transitions. [2020-09-04 22:08:45,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-09-04 22:08:45,260 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:08:45,260 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 22:08:45,261 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 22:08:45,261 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:08:45,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:08:45,261 INFO L82 PathProgramCache]: Analyzing trace with hash -414346707, now seen corresponding path program 1 times [2020-09-04 22:08:45,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:08:45,262 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [811883556] [2020-09-04 22:08:45,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:08:45,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 22:08:45,371 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 22:08:45,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 22:08:45,487 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 22:08:45,567 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-04 22:08:45,567 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-04 22:08:45,567 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 22:08:45,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 10:08:45 BoogieIcfgContainer [2020-09-04 22:08:45,647 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 22:08:45,650 INFO L168 Benchmark]: Toolchain (without parser) took 12886.78 ms. Allocated memory was 147.8 MB in the beginning and 373.3 MB in the end (delta: 225.4 MB). Free memory was 104.1 MB in the beginning and 273.1 MB in the end (delta: -169.1 MB). Peak memory consumption was 56.4 MB. Max. memory is 7.1 GB. [2020-09-04 22:08:45,651 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 147.8 MB. Free memory was 123.4 MB in the beginning and 123.2 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-04 22:08:45,652 INFO L168 Benchmark]: CACSL2BoogieTranslator took 740.91 ms. Allocated memory was 147.8 MB in the beginning and 207.1 MB in the end (delta: 59.2 MB). Free memory was 103.8 MB in the beginning and 173.3 MB in the end (delta: -69.5 MB). Peak memory consumption was 22.7 MB. Max. memory is 7.1 GB. [2020-09-04 22:08:45,652 INFO L168 Benchmark]: Boogie Preprocessor took 93.83 ms. Allocated memory is still 207.1 MB. Free memory was 173.3 MB in the beginning and 170.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-09-04 22:08:45,653 INFO L168 Benchmark]: RCFGBuilder took 760.50 ms. Allocated memory is still 207.1 MB. Free memory was 170.8 MB in the beginning and 119.8 MB in the end (delta: 51.0 MB). Peak memory consumption was 51.0 MB. Max. memory is 7.1 GB. [2020-09-04 22:08:45,654 INFO L168 Benchmark]: TraceAbstraction took 11286.57 ms. Allocated memory was 207.1 MB in the beginning and 373.3 MB in the end (delta: 166.2 MB). Free memory was 119.1 MB in the beginning and 273.1 MB in the end (delta: -154.0 MB). Peak memory consumption was 12.2 MB. Max. memory is 7.1 GB. [2020-09-04 22:08:45,657 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 147.8 MB. Free memory was 123.4 MB in the beginning and 123.2 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 740.91 ms. Allocated memory was 147.8 MB in the beginning and 207.1 MB in the end (delta: 59.2 MB). Free memory was 103.8 MB in the beginning and 173.3 MB in the end (delta: -69.5 MB). Peak memory consumption was 22.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 93.83 ms. Allocated memory is still 207.1 MB. Free memory was 173.3 MB in the beginning and 170.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 760.50 ms. Allocated memory is still 207.1 MB. Free memory was 170.8 MB in the beginning and 119.8 MB in the end (delta: 51.0 MB). Peak memory consumption was 51.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11286.57 ms. Allocated memory was 207.1 MB in the beginning and 373.3 MB in the end (delta: 166.2 MB). Free memory was 119.1 MB in the beginning and 273.1 MB in the end (delta: -154.0 MB). Peak memory consumption was 12.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 605]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L588] const int len = 5; VAL [len=5] [L589] CALL, EXPR dll_create(len) VAL [\old(len)=5] [L568] DLL head = ((void *)0); VAL [\old(len)=5, head={0:0}, len=5] [L569] COND TRUE len > 0 VAL [\old(len)=5, head={0:0}, len=5] [L570] 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}] [L571] 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}] [L574] new_head->data_0 = 0 VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L575] new_head->data_1 = 0 VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L576] 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}] [L576] new_head->data_2 = __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}] [L577] new_head->next = head VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L578] new_head->prev = ((void *)0) VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L579] COND FALSE !(\read(head)) VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L582] head = new_head VAL [\old(len)=5, head={-1:0}, len=5, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L583] len-- VAL [\old(len)=5, head={-1:0}, len=4, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L569] COND TRUE len > 0 VAL [\old(len)=5, head={-1:0}, len=4, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L570] 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}] [L571] 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}] [L574] new_head->data_0 = 0 VAL [\old(len)=5, head={-1:0}, len=4, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L575] new_head->data_1 = 0 VAL [\old(len)=5, head={-1:0}, len=4, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L576] 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}] [L576] new_head->data_2 = __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}] [L577] new_head->next = head VAL [\old(len)=5, head={-1:0}, len=4, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L578] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-1:0}, len=4, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L579] COND TRUE \read(head) VAL [\old(len)=5, head={-1:0}, len=4, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L580] head->prev = new_head VAL [\old(len)=5, head={-1:0}, len=4, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L582] head = new_head VAL [\old(len)=5, head={-2:0}, len=4, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L583] len-- VAL [\old(len)=5, head={-2:0}, len=3, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L569] COND TRUE len > 0 VAL [\old(len)=5, head={-2:0}, len=3, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L570] 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}] [L571] 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}] [L574] new_head->data_0 = 0 VAL [\old(len)=5, head={-2:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L575] new_head->data_1 = 0 VAL [\old(len)=5, head={-2:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L576] 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}] [L576] new_head->data_2 = __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}] [L577] new_head->next = head VAL [\old(len)=5, head={-2:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L578] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-2:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L579] COND TRUE \read(head) VAL [\old(len)=5, head={-2:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L580] head->prev = new_head VAL [\old(len)=5, head={-2:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L582] head = new_head VAL [\old(len)=5, head={-3:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L583] len-- VAL [\old(len)=5, head={-3:0}, len=2, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L569] COND TRUE len > 0 VAL [\old(len)=5, head={-3:0}, len=2, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L570] 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}] [L571] 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}] [L574] new_head->data_0 = 0 VAL [\old(len)=5, head={-3:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L575] new_head->data_1 = 0 VAL [\old(len)=5, head={-3:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L576] 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}] [L576] new_head->data_2 = __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}] [L577] new_head->next = head VAL [\old(len)=5, head={-3:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L578] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-3:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L579] COND TRUE \read(head) VAL [\old(len)=5, head={-3:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L580] head->prev = new_head VAL [\old(len)=5, head={-3:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L582] head = new_head VAL [\old(len)=5, head={-4:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L583] len-- VAL [\old(len)=5, head={-4:0}, len=1, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L569] COND TRUE len > 0 VAL [\old(len)=5, head={-4:0}, len=1, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L570] 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}] [L571] 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}] [L574] new_head->data_0 = 0 VAL [\old(len)=5, head={-4:0}, len=1, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L575] new_head->data_1 = 0 VAL [\old(len)=5, head={-4:0}, len=1, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L576] 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}] [L576] new_head->data_2 = __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}] [L577] new_head->next = head VAL [\old(len)=5, head={-4:0}, len=1, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L578] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-4:0}, len=1, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L579] COND TRUE \read(head) VAL [\old(len)=5, head={-4:0}, len=1, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L580] head->prev = new_head VAL [\old(len)=5, head={-4:0}, len=1, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L582] head = new_head VAL [\old(len)=5, head={-5:0}, len=1, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L583] len-- VAL [\old(len)=5, head={-5:0}, len=0, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L569] COND FALSE !(len > 0) VAL [\old(len)=5, head={-5:0}, len=0, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L585] return head; VAL [\old(len)=5, \result={-5:0}, head={-5:0}, len=0, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L589] RET, EXPR dll_create(len) VAL [dll_create(len)={-5:0}, len=5] [L589] DLL head = dll_create(len); VAL [dll_create(len)={-5:0}, head={-5:0}, len=5] [L590] head->next VAL [head={-5:0}, head->next={-4:0}, len=5] [L590] COND TRUE head->next VAL [head={-5:0}, head->next={-4:0}, len=5] [L591] EXPR head->data_0 VAL [head={-5:0}, head->data_0=0, len=5] [L591] 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, len=5] [L591] EXPR 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] [L591] 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] [L591] 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=0, head={-5:0}, head->data_0=0, head->data_1=0, len=5] [L591] EXPR 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=0, head={-5:0}, head->data_0=0, head->data_1=0, head->data_2=1, len=5] [L591] 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] [L591] COND TRUE 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] [L605] __VERIFIER_error() VAL [head={-5:0}, len=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 112 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 11.1s, OverallIterations: 11, TraceHistogramMax: 5, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 920 SDtfs, 1499 SDslu, 6245 SDs, 0 SdLazy, 3420 SolverSat, 232 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 260 GetRequests, 63 SyntacticMatches, 8 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=195occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 328 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 992 NumberOfCodeBlocks, 992 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 847 ConstructedInterpolants, 0 QuantifiedInterpolants, 334431 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 2 PerfectInterpolantSequences, 554/828 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...