/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --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/sll_nondet_insert-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 05:21:40,961 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 05:21:40,964 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 05:21:41,001 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 05:21:41,002 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 05:21:41,003 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 05:21:41,005 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 05:21:41,008 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 05:21:41,010 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 05:21:41,012 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 05:21:41,013 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 05:21:41,015 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 05:21:41,016 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 05:21:41,019 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 05:21:41,021 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 05:21:41,024 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 05:21:41,028 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 05:21:41,033 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 05:21:41,037 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 05:21:41,043 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 05:21:41,048 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 05:21:41,054 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 05:21:41,055 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 05:21:41,057 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 05:21:41,063 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 05:21:41,063 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 05:21:41,064 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 05:21:41,069 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 05:21:41,069 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 05:21:41,071 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 05:21:41,074 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 05:21:41,075 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 05:21:41,077 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 05:21:41,078 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 05:21:41,079 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 05:21:41,080 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 05:21:41,080 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 05:21:41,081 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 05:21:41,081 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 05:21:41,082 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 05:21:41,083 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 05:21:41,084 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-11-07 05:21:41,115 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 05:21:41,116 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 05:21:41,121 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 05:21:41,121 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 05:21:41,121 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 05:21:41,122 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 05:21:41,122 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 05:21:41,122 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 05:21:41,122 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 05:21:41,123 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 05:21:41,124 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 05:21:41,124 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 05:21:41,124 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 05:21:41,125 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 05:21:41,125 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 05:21:41,125 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 05:21:41,125 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 05:21:41,125 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 05:21:41,126 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 05:21:41,126 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 05:21:41,126 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 05:21:41,126 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 05:21:41,126 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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-11-07 05:21:41,576 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 05:21:41,602 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 05:21:41,605 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 05:21:41,607 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 05:21:41,609 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 05:21:41,610 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext3-properties/sll_nondet_insert-1.i [2020-11-07 05:21:41,695 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b0dbb349/dac5850dbe304b6189f99de0bde698db/FLAG6a80a648e [2020-11-07 05:21:42,360 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 05:21:42,361 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext3-properties/sll_nondet_insert-1.i [2020-11-07 05:21:42,384 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b0dbb349/dac5850dbe304b6189f99de0bde698db/FLAG6a80a648e [2020-11-07 05:21:42,632 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b0dbb349/dac5850dbe304b6189f99de0bde698db [2020-11-07 05:21:42,635 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 05:21:42,641 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 05:21:42,644 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 05:21:42,645 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 05:21:42,649 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 05:21:42,650 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:21:42" (1/1) ... [2020-11-07 05:21:42,654 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e3f8ebe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:21:42, skipping insertion in model container [2020-11-07 05:21:42,655 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:21:42" (1/1) ... [2020-11-07 05:21:42,664 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 05:21:42,710 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 05:21:43,038 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 05:21:43,049 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 05:21:43,128 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 05:21:43,244 INFO L208 MainTranslator]: Completed translation [2020-11-07 05:21:43,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:21:43 WrapperNode [2020-11-07 05:21:43,244 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 05:21:43,246 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 05:21:43,246 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 05:21:43,246 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 05:21:43,268 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:21:43" (1/1) ... [2020-11-07 05:21:43,268 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:21:43" (1/1) ... [2020-11-07 05:21:43,318 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:21:43" (1/1) ... [2020-11-07 05:21:43,319 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:21:43" (1/1) ... [2020-11-07 05:21:43,354 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:21:43" (1/1) ... [2020-11-07 05:21:43,360 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:21:43" (1/1) ... [2020-11-07 05:21:43,365 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:21:43" (1/1) ... [2020-11-07 05:21:43,374 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 05:21:43,375 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 05:21:43,375 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 05:21:43,375 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 05:21:43,376 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:21:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 05:21:43,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 05:21:43,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 05:21:43,541 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 05:21:43,541 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-11-07 05:21:43,541 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-11-07 05:21:43,542 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2020-11-07 05:21:43,542 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2020-11-07 05:21:43,542 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_length [2020-11-07 05:21:43,543 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2020-11-07 05:21:43,543 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_insert [2020-11-07 05:21:43,543 INFO L138 BoogieDeclarations]: Found implementation of procedure _get_nondet_int [2020-11-07 05:21:43,543 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 05:21:43,543 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 05:21:43,543 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 05:21:43,544 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2020-11-07 05:21:43,544 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2020-11-07 05:21:43,544 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 05:21:43,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 05:21:43,545 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 05:21:43,546 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-11-07 05:21:43,546 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-11-07 05:21:43,546 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-11-07 05:21:43,548 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-11-07 05:21:43,549 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-11-07 05:21:43,549 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-11-07 05:21:43,549 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-11-07 05:21:43,549 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-11-07 05:21:43,549 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-11-07 05:21:43,549 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-11-07 05:21:43,549 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-11-07 05:21:43,550 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-11-07 05:21:43,550 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-11-07 05:21:43,550 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-11-07 05:21:43,550 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-11-07 05:21:43,550 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-11-07 05:21:43,550 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-11-07 05:21:43,550 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-11-07 05:21:43,550 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-11-07 05:21:43,551 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-11-07 05:21:43,551 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-11-07 05:21:43,551 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-11-07 05:21:43,551 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-11-07 05:21:43,551 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-11-07 05:21:43,551 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-11-07 05:21:43,551 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-11-07 05:21:43,552 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-11-07 05:21:43,552 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-11-07 05:21:43,552 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-11-07 05:21:43,552 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-11-07 05:21:43,552 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-11-07 05:21:43,552 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-11-07 05:21:43,552 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-11-07 05:21:43,552 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-11-07 05:21:43,553 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-11-07 05:21:43,553 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-11-07 05:21:43,553 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-11-07 05:21:43,553 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-11-07 05:21:43,553 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-11-07 05:21:43,553 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-11-07 05:21:43,553 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-11-07 05:21:43,553 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-11-07 05:21:43,554 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-11-07 05:21:43,555 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-11-07 05:21:43,555 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-11-07 05:21:43,555 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-11-07 05:21:43,555 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-11-07 05:21:43,555 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-11-07 05:21:43,555 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-11-07 05:21:43,555 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-11-07 05:21:43,556 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-11-07 05:21:43,556 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-11-07 05:21:43,556 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-11-07 05:21:43,556 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-11-07 05:21:43,556 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-11-07 05:21:43,557 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-11-07 05:21:43,557 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-11-07 05:21:43,557 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-11-07 05:21:43,557 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-11-07 05:21:43,557 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-11-07 05:21:43,557 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-11-07 05:21:43,558 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-11-07 05:21:43,558 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-11-07 05:21:43,559 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-11-07 05:21:43,559 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-11-07 05:21:43,559 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-11-07 05:21:43,560 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-11-07 05:21:43,560 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-11-07 05:21:43,561 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-11-07 05:21:43,561 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-11-07 05:21:43,562 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-11-07 05:21:43,562 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-11-07 05:21:43,562 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-11-07 05:21:43,563 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-11-07 05:21:43,563 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-11-07 05:21:43,563 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-11-07 05:21:43,563 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-11-07 05:21:43,563 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-11-07 05:21:43,564 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-11-07 05:21:43,564 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-11-07 05:21:43,564 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-11-07 05:21:43,564 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-11-07 05:21:43,564 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-11-07 05:21:43,564 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-11-07 05:21:43,564 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-11-07 05:21:43,565 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-11-07 05:21:43,565 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-11-07 05:21:43,565 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-11-07 05:21:43,565 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-11-07 05:21:43,565 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-11-07 05:21:43,565 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-11-07 05:21:43,565 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-11-07 05:21:43,566 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-11-07 05:21:43,566 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-11-07 05:21:43,566 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-11-07 05:21:43,566 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-11-07 05:21:43,566 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-11-07 05:21:43,566 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-11-07 05:21:43,566 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-11-07 05:21:43,567 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-11-07 05:21:43,567 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-11-07 05:21:43,567 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-11-07 05:21:43,567 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-11-07 05:21:43,567 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-11-07 05:21:43,568 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2020-11-07 05:21:43,568 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2020-11-07 05:21:43,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-11-07 05:21:43,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-11-07 05:21:43,568 INFO L130 BoogieDeclarations]: Found specification of procedure sll_length [2020-11-07 05:21:43,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-11-07 05:21:43,569 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2020-11-07 05:21:43,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 05:21:43,569 INFO L130 BoogieDeclarations]: Found specification of procedure sll_insert [2020-11-07 05:21:43,569 INFO L130 BoogieDeclarations]: Found specification of procedure _get_nondet_int [2020-11-07 05:21:43,570 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 05:21:43,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-11-07 05:21:43,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 05:21:43,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 05:21:43,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 05:21:43,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 05:21:43,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 05:21:44,234 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2020-11-07 05:21:44,519 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 05:21:44,519 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-11-07 05:21:44,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:21:44 BoogieIcfgContainer [2020-11-07 05:21:44,522 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 05:21:44,524 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 05:21:44,525 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 05:21:44,529 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 05:21:44,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:21:42" (1/3) ... [2020-11-07 05:21:44,531 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@549d6f5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:21:44, skipping insertion in model container [2020-11-07 05:21:44,531 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:21:43" (2/3) ... [2020-11-07 05:21:44,532 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@549d6f5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:21:44, skipping insertion in model container [2020-11-07 05:21:44,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:21:44" (3/3) ... [2020-11-07 05:21:44,534 INFO L111 eAbstractionObserver]: Analyzing ICFG sll_nondet_insert-1.i [2020-11-07 05:21:44,552 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 05:21:44,557 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 05:21:44,571 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 05:21:44,601 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 05:21:44,601 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 05:21:44,602 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-07 05:21:44,602 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 05:21:44,602 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 05:21:44,602 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 05:21:44,602 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 05:21:44,602 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 05:21:44,623 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states. [2020-11-07 05:21:44,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-11-07 05:21:44,638 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:21:44,639 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:21:44,640 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:21:44,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:21:44,647 INFO L82 PathProgramCache]: Analyzing trace with hash -343766679, now seen corresponding path program 1 times [2020-11-07 05:21:44,657 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:21:44,658 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2043788547] [2020-11-07 05:21:44,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:21:44,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:44,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:21:44,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:44,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:21:44,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:45,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-07 05:21:45,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:45,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 05:21:45,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:45,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:21:45,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:45,043 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-11-07 05:21:45,044 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2043788547] [2020-11-07 05:21:45,047 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:21:45,047 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 05:21:45,048 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651004155] [2020-11-07 05:21:45,054 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 05:21:45,054 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:21:45,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 05:21:45,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 05:21:45,076 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 4 states. [2020-11-07 05:21:45,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:21:45,567 INFO L93 Difference]: Finished difference Result 301 states and 352 transitions. [2020-11-07 05:21:45,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 05:21:45,570 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2020-11-07 05:21:45,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:21:45,583 INFO L225 Difference]: With dead ends: 301 [2020-11-07 05:21:45,584 INFO L226 Difference]: Without dead ends: 129 [2020-11-07 05:21:45,589 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 05:21:45,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2020-11-07 05:21:45,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 120. [2020-11-07 05:21:45,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-11-07 05:21:45,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 129 transitions. [2020-11-07 05:21:45,655 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 129 transitions. Word has length 60 [2020-11-07 05:21:45,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:21:45,656 INFO L481 AbstractCegarLoop]: Abstraction has 120 states and 129 transitions. [2020-11-07 05:21:45,656 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 05:21:45,656 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 129 transitions. [2020-11-07 05:21:45,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-11-07 05:21:45,660 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:21:45,661 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:21:45,661 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 05:21:45,661 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:21:45,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:21:45,662 INFO L82 PathProgramCache]: Analyzing trace with hash 2216446, now seen corresponding path program 1 times [2020-11-07 05:21:45,663 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:21:45,663 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1572515838] [2020-11-07 05:21:45,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:21:45,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:45,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:21:45,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:45,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:21:45,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:46,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-07 05:21:46,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:46,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-11-07 05:21:46,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:46,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-11-07 05:21:46,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:46,321 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-07 05:21:46,322 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1572515838] [2020-11-07 05:21:46,322 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:21:46,322 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-11-07 05:21:46,323 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048773965] [2020-11-07 05:21:46,324 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-07 05:21:46,325 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:21:46,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-07 05:21:46,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2020-11-07 05:21:46,326 INFO L87 Difference]: Start difference. First operand 120 states and 129 transitions. Second operand 14 states. [2020-11-07 05:21:46,753 WARN L194 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2020-11-07 05:21:46,909 WARN L194 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2020-11-07 05:21:48,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:21:48,156 INFO L93 Difference]: Finished difference Result 283 states and 309 transitions. [2020-11-07 05:21:48,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-07 05:21:48,158 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 75 [2020-11-07 05:21:48,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:21:48,161 INFO L225 Difference]: With dead ends: 283 [2020-11-07 05:21:48,161 INFO L226 Difference]: Without dead ends: 175 [2020-11-07 05:21:48,163 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=163, Invalid=649, Unknown=0, NotChecked=0, Total=812 [2020-11-07 05:21:48,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2020-11-07 05:21:48,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 140. [2020-11-07 05:21:48,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-11-07 05:21:48,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 151 transitions. [2020-11-07 05:21:48,200 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 151 transitions. Word has length 75 [2020-11-07 05:21:48,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:21:48,200 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 151 transitions. [2020-11-07 05:21:48,200 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-07 05:21:48,200 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 151 transitions. [2020-11-07 05:21:48,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-11-07 05:21:48,204 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:21:48,204 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:21:48,204 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 05:21:48,204 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:21:48,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:21:48,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1822744123, now seen corresponding path program 1 times [2020-11-07 05:21:48,207 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:21:48,207 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [822641860] [2020-11-07 05:21:48,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:21:48,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:48,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:21:48,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:48,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:21:48,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:48,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-07 05:21:48,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:48,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 05:21:48,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:48,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2020-11-07 05:21:48,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:48,497 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-07 05:21:48,498 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [822641860] [2020-11-07 05:21:48,498 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:21:48,498 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-11-07 05:21:48,498 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790267150] [2020-11-07 05:21:48,499 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 05:21:48,499 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:21:48,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 05:21:48,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2020-11-07 05:21:48,500 INFO L87 Difference]: Start difference. First operand 140 states and 151 transitions. Second operand 12 states. [2020-11-07 05:21:50,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:21:50,089 INFO L93 Difference]: Finished difference Result 320 states and 356 transitions. [2020-11-07 05:21:50,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-07 05:21:50,090 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 77 [2020-11-07 05:21:50,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:21:50,095 INFO L225 Difference]: With dead ends: 320 [2020-11-07 05:21:50,096 INFO L226 Difference]: Without dead ends: 211 [2020-11-07 05:21:50,103 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2020-11-07 05:21:50,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2020-11-07 05:21:50,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 160. [2020-11-07 05:21:50,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2020-11-07 05:21:50,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 173 transitions. [2020-11-07 05:21:50,156 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 173 transitions. Word has length 77 [2020-11-07 05:21:50,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:21:50,157 INFO L481 AbstractCegarLoop]: Abstraction has 160 states and 173 transitions. [2020-11-07 05:21:50,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 05:21:50,157 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 173 transitions. [2020-11-07 05:21:50,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-11-07 05:21:50,161 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:21:50,161 INFO L422 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:21:50,162 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 05:21:50,162 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:21:50,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:21:50,163 INFO L82 PathProgramCache]: Analyzing trace with hash 2138556837, now seen corresponding path program 1 times [2020-11-07 05:21:50,163 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:21:50,163 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2025032257] [2020-11-07 05:21:50,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:21:50,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:50,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:21:50,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:50,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:21:50,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:50,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-11-07 05:21:50,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:50,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-11-07 05:21:50,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:50,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-07 05:21:50,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:50,549 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-07 05:21:50,549 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2025032257] [2020-11-07 05:21:50,549 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:21:50,550 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-11-07 05:21:50,550 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915367777] [2020-11-07 05:21:50,551 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 05:21:50,551 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:21:50,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 05:21:50,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-11-07 05:21:50,552 INFO L87 Difference]: Start difference. First operand 160 states and 173 transitions. Second operand 11 states. [2020-11-07 05:21:50,980 WARN L194 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2020-11-07 05:21:51,169 WARN L194 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2020-11-07 05:21:51,334 WARN L194 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2020-11-07 05:21:51,581 WARN L194 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2020-11-07 05:21:51,732 WARN L194 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2020-11-07 05:21:52,225 WARN L194 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2020-11-07 05:21:52,393 WARN L194 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2020-11-07 05:21:52,551 WARN L194 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2020-11-07 05:21:52,715 WARN L194 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2020-11-07 05:21:53,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:21:53,010 INFO L93 Difference]: Finished difference Result 350 states and 383 transitions. [2020-11-07 05:21:53,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-07 05:21:53,011 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 85 [2020-11-07 05:21:53,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:21:53,014 INFO L225 Difference]: With dead ends: 350 [2020-11-07 05:21:53,014 INFO L226 Difference]: Without dead ends: 210 [2020-11-07 05:21:53,020 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=224, Invalid=478, Unknown=0, NotChecked=0, Total=702 [2020-11-07 05:21:53,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2020-11-07 05:21:53,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 167. [2020-11-07 05:21:53,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2020-11-07 05:21:53,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 180 transitions. [2020-11-07 05:21:53,080 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 180 transitions. Word has length 85 [2020-11-07 05:21:53,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:21:53,080 INFO L481 AbstractCegarLoop]: Abstraction has 167 states and 180 transitions. [2020-11-07 05:21:53,080 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 05:21:53,081 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 180 transitions. [2020-11-07 05:21:53,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-11-07 05:21:53,089 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:21:53,089 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:21:53,090 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 05:21:53,090 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:21:53,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:21:53,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1514211171, now seen corresponding path program 1 times [2020-11-07 05:21:53,091 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:21:53,091 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1828752398] [2020-11-07 05:21:53,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:21:53,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:53,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:21:53,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:53,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:21:53,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:53,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-07 05:21:53,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:53,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2020-11-07 05:21:53,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:53,369 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-11-07 05:21:53,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:53,416 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-11-07 05:21:53,416 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1828752398] [2020-11-07 05:21:53,417 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:21:53,417 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-07 05:21:53,417 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978378214] [2020-11-07 05:21:53,418 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-07 05:21:53,418 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:21:53,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-07 05:21:53,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2020-11-07 05:21:53,419 INFO L87 Difference]: Start difference. First operand 167 states and 180 transitions. Second operand 13 states. [2020-11-07 05:21:54,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:21:54,421 INFO L93 Difference]: Finished difference Result 218 states and 238 transitions. [2020-11-07 05:21:54,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-07 05:21:54,422 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 86 [2020-11-07 05:21:54,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:21:54,424 INFO L225 Difference]: With dead ends: 218 [2020-11-07 05:21:54,424 INFO L226 Difference]: Without dead ends: 210 [2020-11-07 05:21:54,425 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2020-11-07 05:21:54,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2020-11-07 05:21:54,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 187. [2020-11-07 05:21:54,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-11-07 05:21:54,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 205 transitions. [2020-11-07 05:21:54,460 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 205 transitions. Word has length 86 [2020-11-07 05:21:54,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:21:54,461 INFO L481 AbstractCegarLoop]: Abstraction has 187 states and 205 transitions. [2020-11-07 05:21:54,461 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-07 05:21:54,461 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 205 transitions. [2020-11-07 05:21:54,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-11-07 05:21:54,462 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:21:54,463 INFO L422 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:21:54,463 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 05:21:54,463 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:21:54,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:21:54,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1851492386, now seen corresponding path program 2 times [2020-11-07 05:21:54,464 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:21:54,464 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1940032158] [2020-11-07 05:21:54,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:21:54,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:54,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:21:54,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:54,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:21:54,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:54,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-11-07 05:21:54,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:54,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-07 05:21:54,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:54,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-11-07 05:21:54,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:54,742 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-07 05:21:54,743 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1940032158] [2020-11-07 05:21:54,743 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:21:54,743 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-11-07 05:21:54,743 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123847735] [2020-11-07 05:21:54,744 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-07 05:21:54,744 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:21:54,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-07 05:21:54,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2020-11-07 05:21:54,745 INFO L87 Difference]: Start difference. First operand 187 states and 205 transitions. Second operand 14 states. [2020-11-07 05:21:56,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:21:56,804 INFO L93 Difference]: Finished difference Result 328 states and 368 transitions. [2020-11-07 05:21:56,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-11-07 05:21:56,805 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 87 [2020-11-07 05:21:56,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:21:56,808 INFO L225 Difference]: With dead ends: 328 [2020-11-07 05:21:56,808 INFO L226 Difference]: Without dead ends: 232 [2020-11-07 05:21:56,810 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=172, Invalid=820, Unknown=0, NotChecked=0, Total=992 [2020-11-07 05:21:56,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2020-11-07 05:21:56,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 166. [2020-11-07 05:21:56,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2020-11-07 05:21:56,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 181 transitions. [2020-11-07 05:21:56,839 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 181 transitions. Word has length 87 [2020-11-07 05:21:56,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:21:56,840 INFO L481 AbstractCegarLoop]: Abstraction has 166 states and 181 transitions. [2020-11-07 05:21:56,840 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-07 05:21:56,840 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 181 transitions. [2020-11-07 05:21:56,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-11-07 05:21:56,841 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:21:56,842 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:21:56,842 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 05:21:56,842 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:21:56,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:21:56,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1512142798, now seen corresponding path program 1 times [2020-11-07 05:21:56,843 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:21:56,844 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [107162754] [2020-11-07 05:21:56,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:21:56,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:56,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:21:56,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:56,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:21:56,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:57,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-07 05:21:57,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:57,097 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2020-11-07 05:21:57,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:57,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-11-07 05:21:57,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:57,138 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-07 05:21:57,139 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [107162754] [2020-11-07 05:21:57,139 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:21:57,144 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-11-07 05:21:57,148 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747403220] [2020-11-07 05:21:57,149 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-07 05:21:57,149 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:21:57,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-07 05:21:57,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2020-11-07 05:21:57,150 INFO L87 Difference]: Start difference. First operand 166 states and 181 transitions. Second operand 14 states. [2020-11-07 05:21:58,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:21:58,733 INFO L93 Difference]: Finished difference Result 345 states and 389 transitions. [2020-11-07 05:21:58,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-11-07 05:21:58,739 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 93 [2020-11-07 05:21:58,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:21:58,742 INFO L225 Difference]: With dead ends: 345 [2020-11-07 05:21:58,742 INFO L226 Difference]: Without dead ends: 244 [2020-11-07 05:21:58,746 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=138, Invalid=674, Unknown=0, NotChecked=0, Total=812 [2020-11-07 05:21:58,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2020-11-07 05:21:58,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 189. [2020-11-07 05:21:58,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-11-07 05:21:58,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 206 transitions. [2020-11-07 05:21:58,793 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 206 transitions. Word has length 93 [2020-11-07 05:21:58,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:21:58,793 INFO L481 AbstractCegarLoop]: Abstraction has 189 states and 206 transitions. [2020-11-07 05:21:58,793 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-07 05:21:58,794 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 206 transitions. [2020-11-07 05:21:58,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-11-07 05:21:58,795 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:21:58,795 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:21:58,795 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 05:21:58,795 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:21:58,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:21:58,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1087278640, now seen corresponding path program 2 times [2020-11-07 05:21:58,796 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:21:58,796 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [350504999] [2020-11-07 05:21:58,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:21:58,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:58,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:21:58,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:58,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:21:58,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:58,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-07 05:21:58,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:59,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2020-11-07 05:21:59,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:59,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 05:21:59,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:59,170 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-11-07 05:21:59,171 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [350504999] [2020-11-07 05:21:59,171 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:21:59,171 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-11-07 05:21:59,172 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181230813] [2020-11-07 05:21:59,172 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-11-07 05:21:59,172 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:21:59,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-11-07 05:21:59,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2020-11-07 05:21:59,173 INFO L87 Difference]: Start difference. First operand 189 states and 206 transitions. Second operand 18 states. [2020-11-07 05:22:01,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:22:01,050 INFO L93 Difference]: Finished difference Result 246 states and 271 transitions. [2020-11-07 05:22:01,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-11-07 05:22:01,051 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 102 [2020-11-07 05:22:01,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:22:01,054 INFO L225 Difference]: With dead ends: 246 [2020-11-07 05:22:01,054 INFO L226 Difference]: Without dead ends: 238 [2020-11-07 05:22:01,056 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=169, Invalid=1021, Unknown=0, NotChecked=0, Total=1190 [2020-11-07 05:22:01,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2020-11-07 05:22:01,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 215. [2020-11-07 05:22:01,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2020-11-07 05:22:01,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 238 transitions. [2020-11-07 05:22:01,100 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 238 transitions. Word has length 102 [2020-11-07 05:22:01,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:22:01,101 INFO L481 AbstractCegarLoop]: Abstraction has 215 states and 238 transitions. [2020-11-07 05:22:01,101 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-11-07 05:22:01,101 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 238 transitions. [2020-11-07 05:22:01,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-11-07 05:22:01,103 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:22:01,103 INFO L422 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:22:01,103 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 05:22:01,103 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:22:01,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:22:01,104 INFO L82 PathProgramCache]: Analyzing trace with hash 481129397, now seen corresponding path program 1 times [2020-11-07 05:22:01,104 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:22:01,105 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2129155922] [2020-11-07 05:22:01,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:22:01,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:22:01,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:22:01,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:22:01,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:22:01,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:22:01,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-11-07 05:22:01,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:22:01,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-11-07 05:22:01,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:22:01,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-11-07 05:22:01,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:22:01,430 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-07 05:22:01,430 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2129155922] [2020-11-07 05:22:01,432 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:22:01,432 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-11-07 05:22:01,432 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002708747] [2020-11-07 05:22:01,433 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-07 05:22:01,433 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:22:01,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-07 05:22:01,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2020-11-07 05:22:01,434 INFO L87 Difference]: Start difference. First operand 215 states and 238 transitions. Second operand 16 states. [2020-11-07 05:22:03,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:22:03,614 INFO L93 Difference]: Finished difference Result 365 states and 412 transitions. [2020-11-07 05:22:03,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-11-07 05:22:03,615 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 103 [2020-11-07 05:22:03,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:22:03,617 INFO L225 Difference]: With dead ends: 365 [2020-11-07 05:22:03,617 INFO L226 Difference]: Without dead ends: 250 [2020-11-07 05:22:03,619 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=187, Invalid=1003, Unknown=0, NotChecked=0, Total=1190 [2020-11-07 05:22:03,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2020-11-07 05:22:03,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 182. [2020-11-07 05:22:03,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2020-11-07 05:22:03,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 198 transitions. [2020-11-07 05:22:03,652 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 198 transitions. Word has length 103 [2020-11-07 05:22:03,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:22:03,653 INFO L481 AbstractCegarLoop]: Abstraction has 182 states and 198 transitions. [2020-11-07 05:22:03,653 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-07 05:22:03,653 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 198 transitions. [2020-11-07 05:22:03,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-11-07 05:22:03,654 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:22:03,654 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:22:03,655 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 05:22:03,655 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:22:03,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:22:03,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1248000293, now seen corresponding path program 3 times [2020-11-07 05:22:03,656 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:22:03,656 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1433276673] [2020-11-07 05:22:03,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:22:03,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:22:03,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:22:03,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:22:03,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:22:03,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:22:03,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-07 05:22:03,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:22:03,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2020-11-07 05:22:03,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:22:03,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 05:22:03,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:22:03,947 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-11-07 05:22:03,947 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1433276673] [2020-11-07 05:22:03,948 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:22:03,948 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-11-07 05:22:03,948 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026489273] [2020-11-07 05:22:03,949 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-07 05:22:03,949 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:22:03,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-07 05:22:03,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2020-11-07 05:22:03,950 INFO L87 Difference]: Start difference. First operand 182 states and 198 transitions. Second operand 13 states. [2020-11-07 05:22:04,433 WARN L194 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2020-11-07 05:22:05,172 WARN L194 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2020-11-07 05:22:05,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:22:05,793 INFO L93 Difference]: Finished difference Result 376 states and 428 transitions. [2020-11-07 05:22:05,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-11-07 05:22:05,794 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 109 [2020-11-07 05:22:05,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:22:05,796 INFO L225 Difference]: With dead ends: 376 [2020-11-07 05:22:05,797 INFO L226 Difference]: Without dead ends: 271 [2020-11-07 05:22:05,798 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=211, Invalid=659, Unknown=0, NotChecked=0, Total=870 [2020-11-07 05:22:05,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2020-11-07 05:22:05,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 212. [2020-11-07 05:22:05,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2020-11-07 05:22:05,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 234 transitions. [2020-11-07 05:22:05,840 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 234 transitions. Word has length 109 [2020-11-07 05:22:05,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:22:05,840 INFO L481 AbstractCegarLoop]: Abstraction has 212 states and 234 transitions. [2020-11-07 05:22:05,840 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-07 05:22:05,840 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 234 transitions. [2020-11-07 05:22:05,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-11-07 05:22:05,842 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:22:05,842 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:22:05,842 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 05:22:05,843 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:22:05,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:22:05,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1735393704, now seen corresponding path program 1 times [2020-11-07 05:22:05,843 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:22:05,844 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1952869415] [2020-11-07 05:22:05,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:22:05,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:22:05,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:22:05,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:22:05,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:22:05,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:22:06,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-07 05:22:06,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:22:06,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2020-11-07 05:22:06,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:22:06,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-11-07 05:22:06,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:22:06,336 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-11-07 05:22:06,337 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1952869415] [2020-11-07 05:22:06,337 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:22:06,337 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-11-07 05:22:06,337 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784673225] [2020-11-07 05:22:06,338 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-11-07 05:22:06,338 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:22:06,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-11-07 05:22:06,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2020-11-07 05:22:06,339 INFO L87 Difference]: Start difference. First operand 212 states and 234 transitions. Second operand 20 states. [2020-11-07 05:22:06,904 WARN L194 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2020-11-07 05:22:09,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:22:09,161 INFO L93 Difference]: Finished difference Result 331 states and 389 transitions. [2020-11-07 05:22:09,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-11-07 05:22:09,168 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 111 [2020-11-07 05:22:09,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:22:09,171 INFO L225 Difference]: With dead ends: 331 [2020-11-07 05:22:09,171 INFO L226 Difference]: Without dead ends: 323 [2020-11-07 05:22:09,173 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=206, Invalid=1434, Unknown=0, NotChecked=0, Total=1640 [2020-11-07 05:22:09,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2020-11-07 05:22:09,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 262. [2020-11-07 05:22:09,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2020-11-07 05:22:09,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 300 transitions. [2020-11-07 05:22:09,225 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 300 transitions. Word has length 111 [2020-11-07 05:22:09,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:22:09,226 INFO L481 AbstractCegarLoop]: Abstraction has 262 states and 300 transitions. [2020-11-07 05:22:09,226 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-11-07 05:22:09,226 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 300 transitions. [2020-11-07 05:22:09,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2020-11-07 05:22:09,229 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:22:09,229 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:22:09,229 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 05:22:09,229 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:22:09,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:22:09,230 INFO L82 PathProgramCache]: Analyzing trace with hash 294427059, now seen corresponding path program 2 times [2020-11-07 05:22:09,230 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:22:09,230 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2047749317] [2020-11-07 05:22:09,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:22:09,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:22:09,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:22:09,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:22:09,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:22:09,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:22:09,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-07 05:22:09,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:22:09,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2020-11-07 05:22:09,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:22:09,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-11-07 05:22:09,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:22:09,989 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-11-07 05:22:09,991 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2047749317] [2020-11-07 05:22:09,992 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:22:09,992 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2020-11-07 05:22:09,992 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251380873] [2020-11-07 05:22:09,993 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-11-07 05:22:09,993 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:22:09,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-11-07 05:22:09,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2020-11-07 05:22:09,996 INFO L87 Difference]: Start difference. First operand 262 states and 300 transitions. Second operand 23 states. [2020-11-07 05:22:13,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:22:13,178 INFO L93 Difference]: Finished difference Result 347 states and 407 transitions. [2020-11-07 05:22:13,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-11-07 05:22:13,179 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 118 [2020-11-07 05:22:13,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:22:13,184 INFO L225 Difference]: With dead ends: 347 [2020-11-07 05:22:13,185 INFO L226 Difference]: Without dead ends: 335 [2020-11-07 05:22:13,187 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=172, Invalid=1720, Unknown=0, NotChecked=0, Total=1892 [2020-11-07 05:22:13,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2020-11-07 05:22:13,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 303. [2020-11-07 05:22:13,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2020-11-07 05:22:13,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 352 transitions. [2020-11-07 05:22:13,263 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 352 transitions. Word has length 118 [2020-11-07 05:22:13,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:22:13,263 INFO L481 AbstractCegarLoop]: Abstraction has 303 states and 352 transitions. [2020-11-07 05:22:13,263 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-11-07 05:22:13,263 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 352 transitions. [2020-11-07 05:22:13,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2020-11-07 05:22:13,266 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:22:13,267 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:22:13,267 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-07 05:22:13,267 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:22:13,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:22:13,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1458094782, now seen corresponding path program 2 times [2020-11-07 05:22:13,268 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:22:13,273 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [217821048] [2020-11-07 05:22:13,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:22:13,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:22:13,369 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:22:13,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:22:13,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:22:13,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:22:13,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-07 05:22:13,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:22:13,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2020-11-07 05:22:13,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:22:13,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-11-07 05:22:13,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:22:13,592 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-11-07 05:22:13,592 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [217821048] [2020-11-07 05:22:13,593 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:22:13,593 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-11-07 05:22:13,593 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051020859] [2020-11-07 05:22:13,594 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-07 05:22:13,594 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:22:13,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-07 05:22:13,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2020-11-07 05:22:13,595 INFO L87 Difference]: Start difference. First operand 303 states and 352 transitions. Second operand 15 states. [2020-11-07 05:22:14,123 WARN L194 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2020-11-07 05:22:15,026 WARN L194 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2020-11-07 05:22:15,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:22:15,832 INFO L93 Difference]: Finished difference Result 548 states and 656 transitions. [2020-11-07 05:22:15,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-11-07 05:22:15,833 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 119 [2020-11-07 05:22:15,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:22:15,837 INFO L225 Difference]: With dead ends: 548 [2020-11-07 05:22:15,838 INFO L226 Difference]: Without dead ends: 411 [2020-11-07 05:22:15,840 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=262, Invalid=998, Unknown=0, NotChecked=0, Total=1260 [2020-11-07 05:22:15,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2020-11-07 05:22:15,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 327. [2020-11-07 05:22:15,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2020-11-07 05:22:15,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 386 transitions. [2020-11-07 05:22:15,915 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 386 transitions. Word has length 119 [2020-11-07 05:22:15,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:22:15,916 INFO L481 AbstractCegarLoop]: Abstraction has 327 states and 386 transitions. [2020-11-07 05:22:15,916 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-07 05:22:15,916 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 386 transitions. [2020-11-07 05:22:15,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2020-11-07 05:22:15,919 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:22:15,919 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:22:15,919 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-07 05:22:15,919 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:22:15,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:22:15,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1478120642, now seen corresponding path program 3 times [2020-11-07 05:22:15,920 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:22:15,920 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [519089526] [2020-11-07 05:22:15,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:22:15,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:22:15,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:22:15,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:22:15,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:22:15,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:22:16,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-11-07 05:22:16,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:22:16,080 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-11-07 05:22:16,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:22:16,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-11-07 05:22:16,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:22:16,214 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 13 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-11-07 05:22:16,214 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [519089526] [2020-11-07 05:22:16,214 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:22:16,214 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-11-07 05:22:16,215 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092463875] [2020-11-07 05:22:16,215 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-07 05:22:16,215 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:22:16,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-07 05:22:16,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2020-11-07 05:22:16,216 INFO L87 Difference]: Start difference. First operand 327 states and 386 transitions. Second operand 15 states. [2020-11-07 05:22:17,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:22:17,923 INFO L93 Difference]: Finished difference Result 518 states and 603 transitions. [2020-11-07 05:22:17,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-11-07 05:22:17,924 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 119 [2020-11-07 05:22:17,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:22:17,932 INFO L225 Difference]: With dead ends: 518 [2020-11-07 05:22:17,932 INFO L226 Difference]: Without dead ends: 341 [2020-11-07 05:22:17,934 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=172, Invalid=820, Unknown=0, NotChecked=0, Total=992 [2020-11-07 05:22:17,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2020-11-07 05:22:18,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 321. [2020-11-07 05:22:18,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2020-11-07 05:22:18,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 374 transitions. [2020-11-07 05:22:18,019 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 374 transitions. Word has length 119 [2020-11-07 05:22:18,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:22:18,019 INFO L481 AbstractCegarLoop]: Abstraction has 321 states and 374 transitions. [2020-11-07 05:22:18,019 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-07 05:22:18,020 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 374 transitions. [2020-11-07 05:22:18,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-11-07 05:22:18,022 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:22:18,022 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:22:18,023 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-07 05:22:18,023 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:22:18,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:22:18,023 INFO L82 PathProgramCache]: Analyzing trace with hash 390448671, now seen corresponding path program 1 times [2020-11-07 05:22:18,024 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:22:18,024 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1586108390] [2020-11-07 05:22:18,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:22:18,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 05:22:18,050 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 05:22:18,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 05:22:18,069 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 05:22:18,139 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-11-07 05:22:18,139 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-07 05:22:18,140 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-07 05:22:18,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:22:18 BoogieIcfgContainer [2020-11-07 05:22:18,252 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 05:22:18,254 INFO L168 Benchmark]: Toolchain (without parser) took 35616.43 ms. Allocated memory was 151.0 MB in the beginning and 323.0 MB in the end (delta: 172.0 MB). Free memory was 126.3 MB in the beginning and 170.9 MB in the end (delta: -44.6 MB). Peak memory consumption was 129.0 MB. Max. memory is 8.0 GB. [2020-11-07 05:22:18,254 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 151.0 MB. Free memory is still 128.0 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 05:22:18,255 INFO L168 Benchmark]: CACSL2BoogieTranslator took 600.78 ms. Allocated memory is still 151.0 MB. Free memory was 125.6 MB in the beginning and 102.4 MB in the end (delta: 23.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 8.0 GB. [2020-11-07 05:22:18,255 INFO L168 Benchmark]: Boogie Preprocessor took 127.93 ms. Allocated memory is still 151.0 MB. Free memory was 102.4 MB in the beginning and 99.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-11-07 05:22:18,256 INFO L168 Benchmark]: RCFGBuilder took 1147.72 ms. Allocated memory is still 151.0 MB. Free memory was 99.6 MB in the beginning and 79.5 MB in the end (delta: 20.1 MB). Peak memory consumption was 20.0 MB. Max. memory is 8.0 GB. [2020-11-07 05:22:18,257 INFO L168 Benchmark]: TraceAbstraction took 33727.85 ms. Allocated memory was 151.0 MB in the beginning and 323.0 MB in the end (delta: 172.0 MB). Free memory was 79.0 MB in the beginning and 170.9 MB in the end (delta: -91.9 MB). Peak memory consumption was 81.6 MB. Max. memory is 8.0 GB. [2020-11-07 05:22:18,259 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 151.0 MB. Free memory is still 128.0 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 600.78 ms. Allocated memory is still 151.0 MB. Free memory was 125.6 MB in the beginning and 102.4 MB in the end (delta: 23.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 127.93 ms. Allocated memory is still 151.0 MB. Free memory was 102.4 MB in the beginning and 99.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1147.72 ms. Allocated memory is still 151.0 MB. Free memory was 99.6 MB in the beginning and 79.5 MB in the end (delta: 20.1 MB). Peak memory consumption was 20.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 33727.85 ms. Allocated memory was 151.0 MB in the beginning and 323.0 MB in the end (delta: 172.0 MB). Free memory was 79.0 MB in the beginning and 170.9 MB in the end (delta: -91.9 MB). Peak memory consumption was 81.6 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 12]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L627] CALL, EXPR _get_nondet_int(2, 5) VAL [\old(from)=2, \old(until)=5] [L620] int len = from; VAL [\old(from)=2, \old(until)=5, from=2, len=2, until=5] [L621] len < until && __VERIFIER_nondet_int() VAL [\old(from)=2, \old(until)=5, from=2, len=2, len < until && __VERIFIER_nondet_int()=1, until=5] [L621] len < until && __VERIFIER_nondet_int() VAL [\old(from)=2, \old(until)=5, __VERIFIER_nondet_int()=0, from=2, len=2, len < until && __VERIFIER_nondet_int()=0, until=5] [L621] COND FALSE !(len < until && __VERIFIER_nondet_int()) VAL [\old(from)=2, \old(until)=5, __VERIFIER_nondet_int()=0, from=2, len=2, len < until && __VERIFIER_nondet_int()=0, until=5] [L624] return len; VAL [\old(from)=2, \old(until)=5, \result=2, from=2, len=2, until=5] [L627] RET, EXPR _get_nondet_int(2, 5) VAL [_get_nondet_int(2, 5)=2] [L627] const int len = _get_nondet_int(2, 5); VAL [_get_nondet_int(2, 5)=2, len=2] [L628] SLL s = sll_create(len); VAL [len=2, s={3:0}] [L628] CALL, EXPR sll_create(len) VAL [\old(len)=2] [L575] SLL head = ((void *)0); VAL [\old(len)=2, head={0:0}, len=2] [L576] EXPR len-- VAL [\old(len)=2, head={0:0}, len=1, len--=2] [L576] COND TRUE len-- > 0 VAL [\old(len)=2, head={0:0}, len=1, len--=2] [L577] SLL new_head = (SLL) malloc(sizeof(struct node)); VAL [\old(len)=2, head={0:0}, len=1, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L578] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=2, head={0:0}, len=1, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L581] new_head->next = head VAL [\old(len)=2, head={0:0}, len=1, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L582] head = new_head VAL [\old(len)=2, head={-1:0}, len=1, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L576] EXPR len-- VAL [\old(len)=2, head={-1:0}, len=0, len--=1, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L576] COND TRUE len-- > 0 VAL [\old(len)=2, head={-1:0}, len=0, len--=1, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L577] SLL new_head = (SLL) malloc(sizeof(struct node)); VAL [\old(len)=2, head={-1:0}, len=0, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L578] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=2, head={-1:0}, len=0, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L581] new_head->next = head VAL [\old(len)=2, head={-1:0}, len=0, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L582] head = new_head VAL [\old(len)=2, head={-2:0}, len=0, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L576] EXPR len-- VAL [\old(len)=2, head={-2:0}, len=-1, len--=0, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L576] COND FALSE !(len-- > 0) VAL [\old(len)=2, head={-2:0}, len=-1, len--=0, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L584] return head; VAL [\old(len)=2, \result={-2:0}, head={-2:0}, len=-1, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L628] RET, EXPR sll_create(len) VAL [len=2, s={3:0}, sll_create(len)={-2:0}] [L628] SLL s = sll_create(len); VAL [len=2, s={3:0}, sll_create(len)={-2:0}] [L629] CALL, EXPR _get_nondet_int(0, len - 1) VAL [\old(from)=0, \old(until)=1] [L620] int len = from; VAL [\old(from)=0, \old(until)=1, from=0, len=0, until=1] [L621] len < until && __VERIFIER_nondet_int() VAL [\old(from)=0, \old(until)=1, from=0, len=0, len < until && __VERIFIER_nondet_int()=1, until=1] [L621] len < until && __VERIFIER_nondet_int() VAL [\old(from)=0, \old(until)=1, __VERIFIER_nondet_int()=1, from=0, len=0, len < until && __VERIFIER_nondet_int()=1, until=1] [L621] COND TRUE len < until && __VERIFIER_nondet_int() VAL [\old(from)=0, \old(until)=1, __VERIFIER_nondet_int()=1, from=0, len=0, len < until && __VERIFIER_nondet_int()=1, until=1] [L622] len++ VAL [\old(from)=0, \old(until)=1, from=0, len=1, until=1] [L621] len < until && __VERIFIER_nondet_int() VAL [\old(from)=0, \old(until)=1, from=0, len=1, len < until && __VERIFIER_nondet_int()=0, until=1] [L621] COND FALSE !(len < until && __VERIFIER_nondet_int()) VAL [\old(from)=0, \old(until)=1, from=0, len=1, len < until && __VERIFIER_nondet_int()=0, until=1] [L624] return len; VAL [\old(from)=0, \old(until)=1, \result=1, from=0, len=1, until=1] [L629] RET, EXPR _get_nondet_int(0, len - 1) VAL [_get_nondet_int(0, len - 1)=1, len=2, s={3:0}] [L629] const int k = _get_nondet_int(0, len - 1); VAL [_get_nondet_int(0, len - 1)=1, k=1, len=2, s={3:0}] [L630] int i = 0; VAL [i=0, k=1, len=2, s={3:0}] [L631] i < k && __VERIFIER_nondet_int() VAL [i=0, i < k && __VERIFIER_nondet_int()=1, k=1, len=2, s={3:0}] [L631] i < k && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, i=0, i < k && __VERIFIER_nondet_int()=0, k=1, len=2, s={3:0}] [L631] COND FALSE !(i < k && __VERIFIER_nondet_int()) VAL [__VERIFIER_nondet_int()=0, i=0, i < k && __VERIFIER_nondet_int()=0, k=1, len=2, s={3:0}] [L636] EXPR \read(s) VAL [\read(s)={-2:0}, i=0, k=1, len=2, s={3:0}] [L636] CALL, EXPR sll_length(s) VAL [head={-2:0}] [L587] int len = 0; VAL [head={-2:0}, head={-2:0}, len=0] [L588] COND TRUE \read(head) VAL [head={-2:0}, head={-2:0}, len=0] [L589] len++ VAL [head={-2:0}, head={-2:0}, len=1] [L590] EXPR head->next VAL [head={-2:0}, head={-2:0}, head->next={-1:0}, len=1] [L590] head = head->next VAL [head={-2:0}, head={-1:0}, head->next={-1:0}, len=1] [L588] COND TRUE \read(head) VAL [head={-1:0}, head={-2:0}, len=1] [L589] len++ VAL [head={-2:0}, head={-1:0}, len=2] [L590] EXPR head->next VAL [head={-1:0}, head={-2:0}, head->next={0:0}, len=2] [L590] head = head->next VAL [head={-2:0}, head={0:0}, head->next={0:0}, len=2] [L588] COND FALSE !(\read(head)) VAL [head={0:0}, head={-2:0}, len=2] [L592] return len; VAL [\result=2, head={-2:0}, head={0:0}, len=2] [L636] RET, EXPR sll_length(s) VAL [\read(s)={-2:0}, i=0, k=1, len=2, s={3:0}, sll_length(s)=2] [L636] COND TRUE k + len != sll_length(s) VAL [\read(s)={-2:0}, i=0, k=1, len=2, s={3:0}, sll_length(s)=2] [L641] CALL reach_error() [L12] COND FALSE !(0) [L12] __assert_fail ("0", "sll_nondet_insert-1.c", 3, __extension__ __PRETTY_FUNCTION__) - StatisticsResult: Ultimate Automizer benchmark data CFG has 12 procedures, 163 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 33.5s, OverallIterations: 15, TraceHistogramMax: 3, AutomataDifference: 27.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1957 SDtfs, 4326 SDslu, 11631 SDs, 0 SdLazy, 12781 SolverSat, 581 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 586 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 394 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1757 ImplicationChecksByTransitivity, 15.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=327occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 14 MinimizatonAttempts, 629 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 1465 NumberOfCodeBlocks, 1465 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1330 ConstructedInterpolants, 0 QuantifiedInterpolants, 624671 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 174/354 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...