/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/ldv-regression/rule60_list2.c_1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 22:05:47,221 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 22:05:47,225 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 22:05:47,257 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 22:05:47,258 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 22:05:47,259 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 22:05:47,261 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 22:05:47,263 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 22:05:47,264 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 22:05:47,266 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 22:05:47,267 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 22:05:47,268 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 22:05:47,268 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 22:05:47,270 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 22:05:47,271 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 22:05:47,272 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 22:05:47,273 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 22:05:47,274 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 22:05:47,276 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 22:05:47,279 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 22:05:47,280 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 22:05:47,282 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 22:05:47,283 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 22:05:47,284 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 22:05:47,287 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 22:05:47,288 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 22:05:47,288 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 22:05:47,289 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 22:05:47,290 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 22:05:47,291 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 22:05:47,291 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 22:05:47,292 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 22:05:47,293 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 22:05:47,294 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 22:05:47,295 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 22:05:47,295 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 22:05:47,296 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 22:05:47,297 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 22:05:47,297 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 22:05:47,298 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 22:05:47,299 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 22:05:47,300 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-09-04 22:05:47,312 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 22:05:47,313 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 22:05:47,314 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 22:05:47,314 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 22:05:47,314 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 22:05:47,315 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 22:05:47,315 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 22:05:47,315 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 22:05:47,315 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 22:05:47,315 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 22:05:47,315 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 22:05:47,316 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 22:05:47,316 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 22:05:47,316 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 22:05:47,316 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 22:05:47,317 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 22:05:47,317 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 22:05:47,317 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 22:05:47,317 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 22:05:47,317 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 22:05:47,318 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 22:05:47,318 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 22:05:47,318 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-09-04 22:05:47,739 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 22:05:47,756 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 22:05:47,763 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 22:05:47,765 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 22:05:47,765 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 22:05:47,766 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/rule60_list2.c_1.i [2020-09-04 22:05:47,854 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/6227a947e/e169038eb664495b849c5ae626ba9ade/FLAGc3f63a2c0 [2020-09-04 22:05:48,481 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 22:05:48,482 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/ldv-regression/rule60_list2.c_1.i [2020-09-04 22:05:48,493 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/6227a947e/e169038eb664495b849c5ae626ba9ade/FLAGc3f63a2c0 [2020-09-04 22:05:48,746 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/6227a947e/e169038eb664495b849c5ae626ba9ade [2020-09-04 22:05:48,759 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 22:05:48,762 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 22:05:48,763 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 22:05:48,763 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 22:05:48,767 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 22:05:48,768 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 10:05:48" (1/1) ... [2020-09-04 22:05:48,772 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@436f0f4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:05:48, skipping insertion in model container [2020-09-04 22:05:48,773 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 10:05:48" (1/1) ... [2020-09-04 22:05:48,782 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 22:05:48,831 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 22:05:49,310 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 22:05:49,322 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 22:05:49,387 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 22:05:49,455 INFO L208 MainTranslator]: Completed translation [2020-09-04 22:05:49,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:05:49 WrapperNode [2020-09-04 22:05:49,456 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 22:05:49,456 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 22:05:49,457 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 22:05:49,457 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 22:05:49,474 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:05:49" (1/1) ... [2020-09-04 22:05:49,474 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:05:49" (1/1) ... [2020-09-04 22:05:49,492 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:05:49" (1/1) ... [2020-09-04 22:05:49,493 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:05:49" (1/1) ... [2020-09-04 22:05:49,508 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:05:49" (1/1) ... [2020-09-04 22:05:49,511 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:05:49" (1/1) ... [2020-09-04 22:05:49,514 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:05:49" (1/1) ... [2020-09-04 22:05:49,521 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 22:05:49,521 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 22:05:49,522 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 22:05:49,522 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 22:05:49,523 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:05:49" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 22:05:49,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 22:05:49,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 22:05:49,603 INFO L138 BoogieDeclarations]: Found implementation of procedure __blast_assert [2020-09-04 22:05:49,603 INFO L138 BoogieDeclarations]: Found implementation of procedure __getMemory [2020-09-04 22:05:49,604 INFO L138 BoogieDeclarations]: Found implementation of procedure my_malloc [2020-09-04 22:05:49,605 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2020-09-04 22:05:49,605 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2020-09-04 22:05:49,605 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 22:05:49,605 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 22:05:49,605 INFO L130 BoogieDeclarations]: Found specification of procedure __blast_assert [2020-09-04 22:05:49,606 INFO L130 BoogieDeclarations]: Found specification of procedure __underflow [2020-09-04 22:05:49,606 INFO L130 BoogieDeclarations]: Found specification of procedure __uflow [2020-09-04 22:05:49,607 INFO L130 BoogieDeclarations]: Found specification of procedure __overflow [2020-09-04 22:05:49,607 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_getc [2020-09-04 22:05:49,607 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_putc [2020-09-04 22:05:49,607 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_feof [2020-09-04 22:05:49,608 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_ferror [2020-09-04 22:05:49,608 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_peekc_locked [2020-09-04 22:05:49,608 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_flockfile [2020-09-04 22:05:49,609 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_funlockfile [2020-09-04 22:05:49,610 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_ftrylockfile [2020-09-04 22:05:49,610 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_vfscanf [2020-09-04 22:05:49,612 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_vfprintf [2020-09-04 22:05:49,613 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_padn [2020-09-04 22:05:49,613 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_sgetn [2020-09-04 22:05:49,613 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_seekoff [2020-09-04 22:05:49,613 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_seekpos [2020-09-04 22:05:49,613 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_free_backup_area [2020-09-04 22:05:49,613 INFO L130 BoogieDeclarations]: Found specification of procedure remove [2020-09-04 22:05:49,613 INFO L130 BoogieDeclarations]: Found specification of procedure rename [2020-09-04 22:05:49,614 INFO L130 BoogieDeclarations]: Found specification of procedure renameat [2020-09-04 22:05:49,614 INFO L130 BoogieDeclarations]: Found specification of procedure tmpfile [2020-09-04 22:05:49,614 INFO L130 BoogieDeclarations]: Found specification of procedure tmpnam [2020-09-04 22:05:49,614 INFO L130 BoogieDeclarations]: Found specification of procedure tmpnam_r [2020-09-04 22:05:49,614 INFO L130 BoogieDeclarations]: Found specification of procedure tempnam [2020-09-04 22:05:49,614 INFO L130 BoogieDeclarations]: Found specification of procedure fclose [2020-09-04 22:05:49,614 INFO L130 BoogieDeclarations]: Found specification of procedure fflush [2020-09-04 22:05:49,615 INFO L130 BoogieDeclarations]: Found specification of procedure fflush_unlocked [2020-09-04 22:05:49,615 INFO L130 BoogieDeclarations]: Found specification of procedure fopen [2020-09-04 22:05:49,615 INFO L130 BoogieDeclarations]: Found specification of procedure freopen [2020-09-04 22:05:49,615 INFO L130 BoogieDeclarations]: Found specification of procedure fdopen [2020-09-04 22:05:49,615 INFO L130 BoogieDeclarations]: Found specification of procedure fmemopen [2020-09-04 22:05:49,616 INFO L130 BoogieDeclarations]: Found specification of procedure open_memstream [2020-09-04 22:05:49,616 INFO L130 BoogieDeclarations]: Found specification of procedure setbuf [2020-09-04 22:05:49,616 INFO L130 BoogieDeclarations]: Found specification of procedure setvbuf [2020-09-04 22:05:49,616 INFO L130 BoogieDeclarations]: Found specification of procedure setbuffer [2020-09-04 22:05:49,617 INFO L130 BoogieDeclarations]: Found specification of procedure setlinebuf [2020-09-04 22:05:49,617 INFO L130 BoogieDeclarations]: Found specification of procedure fprintf [2020-09-04 22:05:49,617 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2020-09-04 22:05:49,618 INFO L130 BoogieDeclarations]: Found specification of procedure sprintf [2020-09-04 22:05:49,618 INFO L130 BoogieDeclarations]: Found specification of procedure vfprintf [2020-09-04 22:05:49,618 INFO L130 BoogieDeclarations]: Found specification of procedure vprintf [2020-09-04 22:05:49,618 INFO L130 BoogieDeclarations]: Found specification of procedure vsprintf [2020-09-04 22:05:49,618 INFO L130 BoogieDeclarations]: Found specification of procedure snprintf [2020-09-04 22:05:49,620 INFO L130 BoogieDeclarations]: Found specification of procedure vsnprintf [2020-09-04 22:05:49,620 INFO L130 BoogieDeclarations]: Found specification of procedure vdprintf [2020-09-04 22:05:49,621 INFO L130 BoogieDeclarations]: Found specification of procedure dprintf [2020-09-04 22:05:49,621 INFO L130 BoogieDeclarations]: Found specification of procedure fscanf [2020-09-04 22:05:49,621 INFO L130 BoogieDeclarations]: Found specification of procedure scanf [2020-09-04 22:05:49,621 INFO L130 BoogieDeclarations]: Found specification of procedure sscanf [2020-09-04 22:05:49,621 INFO L130 BoogieDeclarations]: Found specification of procedure vfscanf [2020-09-04 22:05:49,621 INFO L130 BoogieDeclarations]: Found specification of procedure vscanf [2020-09-04 22:05:49,621 INFO L130 BoogieDeclarations]: Found specification of procedure vsscanf [2020-09-04 22:05:49,622 INFO L130 BoogieDeclarations]: Found specification of procedure fgetc [2020-09-04 22:05:49,622 INFO L130 BoogieDeclarations]: Found specification of procedure getc [2020-09-04 22:05:49,622 INFO L130 BoogieDeclarations]: Found specification of procedure getchar [2020-09-04 22:05:49,622 INFO L130 BoogieDeclarations]: Found specification of procedure getc_unlocked [2020-09-04 22:05:49,622 INFO L130 BoogieDeclarations]: Found specification of procedure getchar_unlocked [2020-09-04 22:05:49,622 INFO L130 BoogieDeclarations]: Found specification of procedure fgetc_unlocked [2020-09-04 22:05:49,623 INFO L130 BoogieDeclarations]: Found specification of procedure fputc [2020-09-04 22:05:49,623 INFO L130 BoogieDeclarations]: Found specification of procedure putc [2020-09-04 22:05:49,623 INFO L130 BoogieDeclarations]: Found specification of procedure putchar [2020-09-04 22:05:49,623 INFO L130 BoogieDeclarations]: Found specification of procedure fputc_unlocked [2020-09-04 22:05:49,623 INFO L130 BoogieDeclarations]: Found specification of procedure putc_unlocked [2020-09-04 22:05:49,624 INFO L130 BoogieDeclarations]: Found specification of procedure putchar_unlocked [2020-09-04 22:05:49,624 INFO L130 BoogieDeclarations]: Found specification of procedure getw [2020-09-04 22:05:49,624 INFO L130 BoogieDeclarations]: Found specification of procedure putw [2020-09-04 22:05:49,624 INFO L130 BoogieDeclarations]: Found specification of procedure fgets [2020-09-04 22:05:49,624 INFO L130 BoogieDeclarations]: Found specification of procedure gets [2020-09-04 22:05:49,624 INFO L130 BoogieDeclarations]: Found specification of procedure __getdelim [2020-09-04 22:05:49,625 INFO L130 BoogieDeclarations]: Found specification of procedure getdelim [2020-09-04 22:05:49,625 INFO L130 BoogieDeclarations]: Found specification of procedure getline [2020-09-04 22:05:49,625 INFO L130 BoogieDeclarations]: Found specification of procedure fputs [2020-09-04 22:05:49,626 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2020-09-04 22:05:49,626 INFO L130 BoogieDeclarations]: Found specification of procedure ungetc [2020-09-04 22:05:49,626 INFO L130 BoogieDeclarations]: Found specification of procedure fread [2020-09-04 22:05:49,627 INFO L130 BoogieDeclarations]: Found specification of procedure fwrite [2020-09-04 22:05:49,628 INFO L130 BoogieDeclarations]: Found specification of procedure fread_unlocked [2020-09-04 22:05:49,628 INFO L130 BoogieDeclarations]: Found specification of procedure fwrite_unlocked [2020-09-04 22:05:49,628 INFO L130 BoogieDeclarations]: Found specification of procedure fseek [2020-09-04 22:05:49,628 INFO L130 BoogieDeclarations]: Found specification of procedure ftell [2020-09-04 22:05:49,628 INFO L130 BoogieDeclarations]: Found specification of procedure rewind [2020-09-04 22:05:49,628 INFO L130 BoogieDeclarations]: Found specification of procedure fseeko [2020-09-04 22:05:49,628 INFO L130 BoogieDeclarations]: Found specification of procedure ftello [2020-09-04 22:05:49,629 INFO L130 BoogieDeclarations]: Found specification of procedure fgetpos [2020-09-04 22:05:49,629 INFO L130 BoogieDeclarations]: Found specification of procedure fsetpos [2020-09-04 22:05:49,630 INFO L130 BoogieDeclarations]: Found specification of procedure clearerr [2020-09-04 22:05:49,630 INFO L130 BoogieDeclarations]: Found specification of procedure feof [2020-09-04 22:05:49,630 INFO L130 BoogieDeclarations]: Found specification of procedure ferror [2020-09-04 22:05:49,630 INFO L130 BoogieDeclarations]: Found specification of procedure clearerr_unlocked [2020-09-04 22:05:49,630 INFO L130 BoogieDeclarations]: Found specification of procedure feof_unlocked [2020-09-04 22:05:49,630 INFO L130 BoogieDeclarations]: Found specification of procedure ferror_unlocked [2020-09-04 22:05:49,630 INFO L130 BoogieDeclarations]: Found specification of procedure perror [2020-09-04 22:05:49,631 INFO L130 BoogieDeclarations]: Found specification of procedure fileno [2020-09-04 22:05:49,631 INFO L130 BoogieDeclarations]: Found specification of procedure fileno_unlocked [2020-09-04 22:05:49,631 INFO L130 BoogieDeclarations]: Found specification of procedure popen [2020-09-04 22:05:49,631 INFO L130 BoogieDeclarations]: Found specification of procedure pclose [2020-09-04 22:05:49,631 INFO L130 BoogieDeclarations]: Found specification of procedure ctermid [2020-09-04 22:05:49,631 INFO L130 BoogieDeclarations]: Found specification of procedure flockfile [2020-09-04 22:05:49,632 INFO L130 BoogieDeclarations]: Found specification of procedure ftrylockfile [2020-09-04 22:05:49,632 INFO L130 BoogieDeclarations]: Found specification of procedure funlockfile [2020-09-04 22:05:49,632 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-09-04 22:05:49,632 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-09-04 22:05:49,632 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-09-04 22:05:49,632 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-09-04 22:05:49,633 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-09-04 22:05:49,633 INFO L130 BoogieDeclarations]: Found specification of procedure memalign [2020-09-04 22:05:49,633 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-09-04 22:05:49,633 INFO L130 BoogieDeclarations]: Found specification of procedure pvalloc [2020-09-04 22:05:49,633 INFO L130 BoogieDeclarations]: Found specification of procedure __default_morecore [2020-09-04 22:05:49,633 INFO L130 BoogieDeclarations]: Found specification of procedure mallinfo [2020-09-04 22:05:49,633 INFO L130 BoogieDeclarations]: Found specification of procedure mallopt [2020-09-04 22:05:49,634 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_trim [2020-09-04 22:05:49,634 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_usable_size [2020-09-04 22:05:49,634 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_stats [2020-09-04 22:05:49,634 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_info [2020-09-04 22:05:49,635 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_get_state [2020-09-04 22:05:49,635 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_set_state [2020-09-04 22:05:49,635 INFO L130 BoogieDeclarations]: Found specification of procedure __malloc_check_init [2020-09-04 22:05:49,635 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 22:05:49,636 INFO L130 BoogieDeclarations]: Found specification of procedure __getMemory [2020-09-04 22:05:49,636 INFO L130 BoogieDeclarations]: Found specification of procedure my_malloc [2020-09-04 22:05:49,636 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2020-09-04 22:05:49,637 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2020-09-04 22:05:49,637 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 22:05:49,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 22:05:49,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-09-04 22:05:49,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-09-04 22:05:49,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 22:05:49,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-09-04 22:05:49,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-09-04 22:05:49,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-09-04 22:05:50,185 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 22:05:50,185 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-04 22:05:50,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 10:05:50 BoogieIcfgContainer [2020-09-04 22:05:50,190 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 22:05:50,191 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 22:05:50,192 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 22:05:50,195 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 22:05:50,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 10:05:48" (1/3) ... [2020-09-04 22:05:50,196 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6976b54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 10:05:50, skipping insertion in model container [2020-09-04 22:05:50,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:05:49" (2/3) ... [2020-09-04 22:05:50,197 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6976b54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 10:05:50, skipping insertion in model container [2020-09-04 22:05:50,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 10:05:50" (3/3) ... [2020-09-04 22:05:50,199 INFO L109 eAbstractionObserver]: Analyzing ICFG rule60_list2.c_1.i [2020-09-04 22:05:50,214 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 22:05:50,225 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 22:05:50,247 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 22:05:50,271 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 22:05:50,271 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 22:05:50,271 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-04 22:05:50,272 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 22:05:50,272 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 22:05:50,272 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 22:05:50,272 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 22:05:50,272 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 22:05:50,288 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states. [2020-09-04 22:05:50,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-04 22:05:50,300 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:05:50,301 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 22:05:50,301 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:05:50,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:05:50,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1490968618, now seen corresponding path program 1 times [2020-09-04 22:05:50,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:05:50,318 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [64640633] [2020-09-04 22:05:50,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:05:50,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:50,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:05:50,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:50,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 22:05:50,669 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [64640633] [2020-09-04 22:05:50,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 22:05:50,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 22:05:50,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341496364] [2020-09-04 22:05:50,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 22:05:50,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:05:50,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 22:05:50,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-09-04 22:05:50,702 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 7 states. [2020-09-04 22:05:51,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:05:51,192 INFO L93 Difference]: Finished difference Result 128 states and 157 transitions. [2020-09-04 22:05:51,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 22:05:51,194 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-09-04 22:05:51,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:05:51,209 INFO L225 Difference]: With dead ends: 128 [2020-09-04 22:05:51,210 INFO L226 Difference]: Without dead ends: 67 [2020-09-04 22:05:51,215 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-09-04 22:05:51,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-09-04 22:05:51,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2020-09-04 22:05:51,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-09-04 22:05:51,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2020-09-04 22:05:51,286 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 21 [2020-09-04 22:05:51,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:05:51,287 INFO L479 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2020-09-04 22:05:51,287 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 22:05:51,287 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2020-09-04 22:05:51,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-09-04 22:05:51,291 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:05:51,291 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-09-04 22:05:51,291 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 22:05:51,292 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:05:51,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:05:51,292 INFO L82 PathProgramCache]: Analyzing trace with hash -114203518, now seen corresponding path program 1 times [2020-09-04 22:05:51,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:05:51,293 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2037966188] [2020-09-04 22:05:51,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:05:51,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:51,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:05:51,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:51,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 22:05:51,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:51,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 22:05:51,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:51,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-09-04 22:05:51,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:51,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 22:05:51,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:51,646 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-09-04 22:05:51,646 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2037966188] [2020-09-04 22:05:51,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 22:05:51,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-04 22:05:51,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265219042] [2020-09-04 22:05:51,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 22:05:51,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:05:51,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 22:05:51,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-09-04 22:05:51,660 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand 9 states. [2020-09-04 22:05:51,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:05:51,985 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2020-09-04 22:05:51,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 22:05:51,986 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2020-09-04 22:05:51,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:05:51,988 INFO L225 Difference]: With dead ends: 99 [2020-09-04 22:05:51,989 INFO L226 Difference]: Without dead ends: 73 [2020-09-04 22:05:51,990 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-09-04 22:05:51,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-09-04 22:05:52,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2020-09-04 22:05:52,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-09-04 22:05:52,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2020-09-04 22:05:52,010 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 61 [2020-09-04 22:05:52,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:05:52,011 INFO L479 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2020-09-04 22:05:52,011 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 22:05:52,011 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2020-09-04 22:05:52,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-09-04 22:05:52,013 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:05:52,013 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 22:05:52,014 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 22:05:52,014 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:05:52,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:05:52,015 INFO L82 PathProgramCache]: Analyzing trace with hash -577094017, now seen corresponding path program 1 times [2020-09-04 22:05:52,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:05:52,015 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1568543896] [2020-09-04 22:05:52,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:05:52,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:52,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:05:52,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:52,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 22:05:52,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:52,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 22:05:52,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:52,239 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-09-04 22:05:52,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:52,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 22:05:52,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:52,264 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-09-04 22:05:52,264 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1568543896] [2020-09-04 22:05:52,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 22:05:52,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-09-04 22:05:52,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410541573] [2020-09-04 22:05:52,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 22:05:52,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:05:52,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 22:05:52,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-09-04 22:05:52,267 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand 9 states. [2020-09-04 22:05:52,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:05:52,535 INFO L93 Difference]: Finished difference Result 102 states and 115 transitions. [2020-09-04 22:05:52,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 22:05:52,535 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2020-09-04 22:05:52,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:05:52,537 INFO L225 Difference]: With dead ends: 102 [2020-09-04 22:05:52,537 INFO L226 Difference]: Without dead ends: 65 [2020-09-04 22:05:52,539 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-09-04 22:05:52,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-09-04 22:05:52,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 61. [2020-09-04 22:05:52,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-09-04 22:05:52,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2020-09-04 22:05:52,553 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 61 [2020-09-04 22:05:52,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:05:52,554 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2020-09-04 22:05:52,554 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 22:05:52,554 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2020-09-04 22:05:52,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-09-04 22:05:52,556 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:05:52,556 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-09-04 22:05:52,556 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 22:05:52,557 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:05:52,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:05:52,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1723385860, now seen corresponding path program 1 times [2020-09-04 22:05:52,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:05:52,558 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [905621984] [2020-09-04 22:05:52,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:05:52,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:52,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:05:52,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:52,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 22:05:52,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:52,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 22:05:52,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:52,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-09-04 22:05:52,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:52,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 22:05:52,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:53,033 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-09-04 22:05:53,034 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [905621984] [2020-09-04 22:05:53,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 22:05:53,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-09-04 22:05:53,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080203768] [2020-09-04 22:05:53,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-09-04 22:05:53,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:05:53,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-09-04 22:05:53,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2020-09-04 22:05:53,036 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand 17 states. [2020-09-04 22:05:54,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:05:54,301 INFO L93 Difference]: Finished difference Result 108 states and 121 transitions. [2020-09-04 22:05:54,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-09-04 22:05:54,301 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 61 [2020-09-04 22:05:54,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:05:54,304 INFO L225 Difference]: With dead ends: 108 [2020-09-04 22:05:54,305 INFO L226 Difference]: Without dead ends: 105 [2020-09-04 22:05:54,308 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=150, Invalid=906, Unknown=0, NotChecked=0, Total=1056 [2020-09-04 22:05:54,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-09-04 22:05:54,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 88. [2020-09-04 22:05:54,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-09-04 22:05:54,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 101 transitions. [2020-09-04 22:05:54,339 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 101 transitions. Word has length 61 [2020-09-04 22:05:54,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:05:54,340 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 101 transitions. [2020-09-04 22:05:54,340 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-09-04 22:05:54,340 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 101 transitions. [2020-09-04 22:05:54,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-09-04 22:05:54,341 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:05:54,342 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 22:05:54,342 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 22:05:54,342 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:05:54,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:05:54,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1814582916, now seen corresponding path program 1 times [2020-09-04 22:05:54,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:05:54,343 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [931559383] [2020-09-04 22:05:54,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:05:54,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:54,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:05:54,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:54,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 22:05:54,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:54,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 22:05:54,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:54,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-09-04 22:05:54,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:54,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 22:05:54,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:54,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2020-09-04 22:05:54,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:54,723 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-04 22:05:54,723 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [931559383] [2020-09-04 22:05:54,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 22:05:54,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-09-04 22:05:54,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211494519] [2020-09-04 22:05:54,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-09-04 22:05:54,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:05:54,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-09-04 22:05:54,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2020-09-04 22:05:54,726 INFO L87 Difference]: Start difference. First operand 88 states and 101 transitions. Second operand 18 states. [2020-09-04 22:05:55,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:05:55,964 INFO L93 Difference]: Finished difference Result 113 states and 129 transitions. [2020-09-04 22:05:55,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-09-04 22:05:55,964 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 70 [2020-09-04 22:05:55,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:05:55,967 INFO L225 Difference]: With dead ends: 113 [2020-09-04 22:05:55,967 INFO L226 Difference]: Without dead ends: 104 [2020-09-04 22:05:55,969 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=173, Invalid=949, Unknown=0, NotChecked=0, Total=1122 [2020-09-04 22:05:55,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-09-04 22:05:55,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 94. [2020-09-04 22:05:55,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-09-04 22:05:55,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 107 transitions. [2020-09-04 22:05:55,991 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 107 transitions. Word has length 70 [2020-09-04 22:05:55,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:05:55,992 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 107 transitions. [2020-09-04 22:05:55,992 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-09-04 22:05:55,992 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 107 transitions. [2020-09-04 22:05:55,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-09-04 22:05:55,994 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:05:55,994 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 22:05:55,994 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 22:05:55,994 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:05:55,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:05:55,995 INFO L82 PathProgramCache]: Analyzing trace with hash 983151375, now seen corresponding path program 1 times [2020-09-04 22:05:55,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:05:55,995 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [13737137] [2020-09-04 22:05:55,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:05:56,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:56,126 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:05:56,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:56,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 22:05:56,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:56,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 22:05:56,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:56,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-09-04 22:05:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:56,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 22:05:56,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:56,392 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2020-09-04 22:05:56,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:56,460 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-04 22:05:56,461 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [13737137] [2020-09-04 22:05:56,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 22:05:56,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2020-09-04 22:05:56,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463097105] [2020-09-04 22:05:56,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-09-04 22:05:56,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:05:56,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-09-04 22:05:56,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=459, Unknown=0, NotChecked=0, Total=506 [2020-09-04 22:05:56,463 INFO L87 Difference]: Start difference. First operand 94 states and 107 transitions. Second operand 23 states. [2020-09-04 22:05:58,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:05:58,274 INFO L93 Difference]: Finished difference Result 112 states and 129 transitions. [2020-09-04 22:05:58,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-09-04 22:05:58,275 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 71 [2020-09-04 22:05:58,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:05:58,277 INFO L225 Difference]: With dead ends: 112 [2020-09-04 22:05:58,277 INFO L226 Difference]: Without dead ends: 105 [2020-09-04 22:05:58,279 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=210, Invalid=1682, Unknown=0, NotChecked=0, Total=1892 [2020-09-04 22:05:58,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-09-04 22:05:58,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2020-09-04 22:05:58,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-09-04 22:05:58,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 114 transitions. [2020-09-04 22:05:58,300 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 114 transitions. Word has length 71 [2020-09-04 22:05:58,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:05:58,301 INFO L479 AbstractCegarLoop]: Abstraction has 103 states and 114 transitions. [2020-09-04 22:05:58,301 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-09-04 22:05:58,301 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 114 transitions. [2020-09-04 22:05:58,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-09-04 22:05:58,303 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:05:58,303 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 22:05:58,303 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 22:05:58,303 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:05:58,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:05:58,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1660138148, now seen corresponding path program 1 times [2020-09-04 22:05:58,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:05:58,304 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1792118658] [2020-09-04 22:05:58,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:05:58,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:58,434 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:05:58,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:58,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 22:05:58,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:58,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 22:05:58,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:58,528 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-09-04 22:05:58,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:58,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 22:05:58,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:58,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2020-09-04 22:05:58,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:58,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-04 22:05:58,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:58,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2020-09-04 22:05:58,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:05:58,803 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-09-04 22:05:58,804 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1792118658] [2020-09-04 22:05:58,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 22:05:58,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2020-09-04 22:05:58,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639231013] [2020-09-04 22:05:58,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-09-04 22:05:58,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:05:58,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-09-04 22:05:58,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=501, Unknown=0, NotChecked=0, Total=552 [2020-09-04 22:05:58,808 INFO L87 Difference]: Start difference. First operand 103 states and 114 transitions. Second operand 24 states. [2020-09-04 22:06:00,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:06:00,592 INFO L93 Difference]: Finished difference Result 118 states and 130 transitions. [2020-09-04 22:06:00,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-09-04 22:06:00,593 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 85 [2020-09-04 22:06:00,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:06:00,597 INFO L225 Difference]: With dead ends: 118 [2020-09-04 22:06:00,597 INFO L226 Difference]: Without dead ends: 113 [2020-09-04 22:06:00,599 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=232, Invalid=1748, Unknown=0, NotChecked=0, Total=1980 [2020-09-04 22:06:00,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2020-09-04 22:06:00,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2020-09-04 22:06:00,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-09-04 22:06:00,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 123 transitions. [2020-09-04 22:06:00,623 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 123 transitions. Word has length 85 [2020-09-04 22:06:00,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:06:00,623 INFO L479 AbstractCegarLoop]: Abstraction has 112 states and 123 transitions. [2020-09-04 22:06:00,624 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-09-04 22:06:00,624 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 123 transitions. [2020-09-04 22:06:00,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-09-04 22:06:00,626 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:06:00,626 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 22:06:00,626 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 22:06:00,626 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:06:00,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:06:00,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1173492322, now seen corresponding path program 2 times [2020-09-04 22:06:00,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:06:00,627 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [395506163] [2020-09-04 22:06:00,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:06:00,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:06:00,707 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:06:00,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:06:00,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 22:06:00,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:06:00,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 22:06:00,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:06:00,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-09-04 22:06:00,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:06:00,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 22:06:00,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:06:00,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2020-09-04 22:06:00,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:06:00,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-09-04 22:06:00,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:06:00,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2020-09-04 22:06:00,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:06:00,899 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-04 22:06:00,899 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [395506163] [2020-09-04 22:06:00,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 22:06:00,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-09-04 22:06:00,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283506292] [2020-09-04 22:06:00,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 22:06:00,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:06:00,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 22:06:00,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-09-04 22:06:00,907 INFO L87 Difference]: Start difference. First operand 112 states and 123 transitions. Second operand 10 states. [2020-09-04 22:06:01,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:06:01,462 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2020-09-04 22:06:01,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 22:06:01,465 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 85 [2020-09-04 22:06:01,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:06:01,467 INFO L225 Difference]: With dead ends: 127 [2020-09-04 22:06:01,467 INFO L226 Difference]: Without dead ends: 111 [2020-09-04 22:06:01,468 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2020-09-04 22:06:01,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-09-04 22:06:01,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2020-09-04 22:06:01,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2020-09-04 22:06:01,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 121 transitions. [2020-09-04 22:06:01,511 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 121 transitions. Word has length 85 [2020-09-04 22:06:01,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:06:01,512 INFO L479 AbstractCegarLoop]: Abstraction has 111 states and 121 transitions. [2020-09-04 22:06:01,512 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 22:06:01,512 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 121 transitions. [2020-09-04 22:06:01,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-09-04 22:06:01,517 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:06:01,517 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 22:06:01,517 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 22:06:01,518 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:06:01,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:06:01,524 INFO L82 PathProgramCache]: Analyzing trace with hash 2046230471, now seen corresponding path program 1 times [2020-09-04 22:06:01,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:06:01,525 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [215371602] [2020-09-04 22:06:01,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:06:01,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:06:01,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:06:01,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:06:01,653 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 22:06:01,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:06:01,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 22:06:01,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:06:01,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-09-04 22:06:01,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:06:01,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 22:06:01,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:06:01,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2020-09-04 22:06:01,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:06:01,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-04 22:06:01,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:06:01,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2020-09-04 22:06:01,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:06:01,983 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-09-04 22:06:01,983 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [215371602] [2020-09-04 22:06:01,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 22:06:01,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2020-09-04 22:06:01,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002531023] [2020-09-04 22:06:01,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-09-04 22:06:01,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:06:01,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-09-04 22:06:01,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=459, Unknown=0, NotChecked=0, Total=506 [2020-09-04 22:06:01,992 INFO L87 Difference]: Start difference. First operand 111 states and 121 transitions. Second operand 23 states. [2020-09-04 22:06:03,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:06:03,627 INFO L93 Difference]: Finished difference Result 129 states and 139 transitions. [2020-09-04 22:06:03,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-09-04 22:06:03,631 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 86 [2020-09-04 22:06:03,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:06:03,632 INFO L225 Difference]: With dead ends: 129 [2020-09-04 22:06:03,633 INFO L226 Difference]: Without dead ends: 112 [2020-09-04 22:06:03,634 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=214, Invalid=1766, Unknown=0, NotChecked=0, Total=1980 [2020-09-04 22:06:03,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-09-04 22:06:03,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2020-09-04 22:06:03,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2020-09-04 22:06:03,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 120 transitions. [2020-09-04 22:06:03,653 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 120 transitions. Word has length 86 [2020-09-04 22:06:03,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:06:03,654 INFO L479 AbstractCegarLoop]: Abstraction has 111 states and 120 transitions. [2020-09-04 22:06:03,654 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-09-04 22:06:03,654 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 120 transitions. [2020-09-04 22:06:03,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-09-04 22:06:03,655 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:06:03,655 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 22:06:03,656 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 22:06:03,656 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:06:03,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:06:03,656 INFO L82 PathProgramCache]: Analyzing trace with hash -305538175, now seen corresponding path program 2 times [2020-09-04 22:06:03,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:06:03,657 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [888251359] [2020-09-04 22:06:03,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:06:03,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:06:03,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:06:03,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:06:03,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 22:06:03,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:06:03,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 22:06:03,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:06:03,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-09-04 22:06:03,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:06:04,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 22:06:04,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:06:04,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2020-09-04 22:06:04,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:06:04,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-09-04 22:06:04,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:06:04,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2020-09-04 22:06:04,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:06:04,120 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-04 22:06:04,121 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [888251359] [2020-09-04 22:06:04,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 22:06:04,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-09-04 22:06:04,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059322812] [2020-09-04 22:06:04,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-09-04 22:06:04,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:06:04,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-09-04 22:06:04,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2020-09-04 22:06:04,124 INFO L87 Difference]: Start difference. First operand 111 states and 120 transitions. Second operand 19 states. [2020-09-04 22:06:05,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:06:05,538 INFO L93 Difference]: Finished difference Result 144 states and 154 transitions. [2020-09-04 22:06:05,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-09-04 22:06:05,539 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 86 [2020-09-04 22:06:05,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:06:05,541 INFO L225 Difference]: With dead ends: 144 [2020-09-04 22:06:05,541 INFO L226 Difference]: Without dead ends: 131 [2020-09-04 22:06:05,542 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=253, Invalid=1469, Unknown=0, NotChecked=0, Total=1722 [2020-09-04 22:06:05,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2020-09-04 22:06:05,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 110. [2020-09-04 22:06:05,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-09-04 22:06:05,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2020-09-04 22:06:05,561 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 86 [2020-09-04 22:06:05,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:06:05,561 INFO L479 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2020-09-04 22:06:05,562 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-09-04 22:06:05,562 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2020-09-04 22:06:05,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-09-04 22:06:05,563 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:06:05,563 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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] [2020-09-04 22:06:05,563 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 22:06:05,563 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:06:05,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:06:05,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1959566780, now seen corresponding path program 1 times [2020-09-04 22:06:05,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:06:05,564 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1636298401] [2020-09-04 22:06:05,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:06:05,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:06:05,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:06:05,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:06:05,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 22:06:05,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:06:05,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 22:06:05,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:06:05,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-09-04 22:06:05,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:06:05,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 22:06:05,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:06:05,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2020-09-04 22:06:05,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:06:06,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-04 22:06:06,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:06:06,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-09-04 22:06:06,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:06:06,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-09-04 22:06:06,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:06:06,081 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-09-04 22:06:06,081 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1636298401] [2020-09-04 22:06:06,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 22:06:06,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-09-04 22:06:06,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127902800] [2020-09-04 22:06:06,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-09-04 22:06:06,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:06:06,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-09-04 22:06:06,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2020-09-04 22:06:06,084 INFO L87 Difference]: Start difference. First operand 110 states and 118 transitions. Second operand 19 states. [2020-09-04 22:06:07,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:06:07,472 INFO L93 Difference]: Finished difference Result 137 states and 144 transitions. [2020-09-04 22:06:07,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-09-04 22:06:07,473 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 94 [2020-09-04 22:06:07,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:06:07,475 INFO L225 Difference]: With dead ends: 137 [2020-09-04 22:06:07,475 INFO L226 Difference]: Without dead ends: 108 [2020-09-04 22:06:07,476 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=239, Invalid=1321, Unknown=0, NotChecked=0, Total=1560 [2020-09-04 22:06:07,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2020-09-04 22:06:07,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 100. [2020-09-04 22:06:07,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-09-04 22:06:07,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2020-09-04 22:06:07,493 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 94 [2020-09-04 22:06:07,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:06:07,493 INFO L479 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2020-09-04 22:06:07,494 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-09-04 22:06:07,494 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2020-09-04 22:06:07,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-09-04 22:06:07,495 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:06:07,495 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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] [2020-09-04 22:06:07,495 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 22:06:07,495 INFO L427 AbstractCegarLoop]: === Iteration 12 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:06:07,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:06:07,496 INFO L82 PathProgramCache]: Analyzing trace with hash -416868516, now seen corresponding path program 1 times [2020-09-04 22:06:07,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:06:07,496 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [441819267] [2020-09-04 22:06:07,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:06:07,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 22:06:07,520 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 22:06:07,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 22:06:07,544 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 22:06:07,592 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-04 22:06:07,593 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-04 22:06:07,593 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-04 22:06:07,647 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 16 could not be translated for associated CType STRUCT~~list_head?prev~*list_head?next~*list_head# [2020-09-04 22:06:07,649 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 13 could not be translated for associated CType STRUCT~~list_head?prev~*list_head?next~*list_head# [2020-09-04 22:06:07,649 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 13 could not be translated for associated CType STRUCT~~list_head?prev~*list_head?next~*list_head# [2020-09-04 22:06:07,650 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 16 could not be translated for associated CType STRUCT~~list_head?prev~*list_head?next~*list_head# [2020-09-04 22:06:07,650 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 13 could not be translated for associated CType STRUCT~~list_head?prev~*list_head?next~*list_head# [2020-09-04 22:06:07,651 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 16 could not be translated for associated CType STRUCT~~list_head?prev~*list_head?next~*list_head# [2020-09-04 22:06:07,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 10:06:07 BoogieIcfgContainer [2020-09-04 22:06:07,687 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 22:06:07,690 INFO L168 Benchmark]: Toolchain (without parser) took 18927.99 ms. Allocated memory was 139.5 MB in the beginning and 422.6 MB in the end (delta: 283.1 MB). Free memory was 101.7 MB in the beginning and 120.4 MB in the end (delta: -18.7 MB). Peak memory consumption was 264.4 MB. Max. memory is 7.1 GB. [2020-09-04 22:06:07,691 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 139.5 MB. Free memory was 120.8 MB in the beginning and 120.4 MB in the end (delta: 419.8 kB). Peak memory consumption was 419.8 kB. Max. memory is 7.1 GB. [2020-09-04 22:06:07,692 INFO L168 Benchmark]: CACSL2BoogieTranslator took 693.20 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 101.3 MB in the beginning and 168.0 MB in the end (delta: -66.7 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2020-09-04 22:06:07,693 INFO L168 Benchmark]: Boogie Preprocessor took 64.75 ms. Allocated memory is still 203.4 MB. Free memory was 168.0 MB in the beginning and 165.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2020-09-04 22:06:07,693 INFO L168 Benchmark]: RCFGBuilder took 668.69 ms. Allocated memory is still 203.4 MB. Free memory was 165.1 MB in the beginning and 118.3 MB in the end (delta: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 7.1 GB. [2020-09-04 22:06:07,694 INFO L168 Benchmark]: TraceAbstraction took 17495.77 ms. Allocated memory was 203.4 MB in the beginning and 422.6 MB in the end (delta: 219.2 MB). Free memory was 117.4 MB in the beginning and 120.4 MB in the end (delta: -3.0 MB). Peak memory consumption was 216.1 MB. Max. memory is 7.1 GB. [2020-09-04 22:06:07,698 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 139.5 MB. Free memory was 120.8 MB in the beginning and 120.4 MB in the end (delta: 419.8 kB). Peak memory consumption was 419.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 693.20 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 101.3 MB in the beginning and 168.0 MB in the end (delta: -66.7 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 64.75 ms. Allocated memory is still 203.4 MB. Free memory was 168.0 MB in the beginning and 165.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 668.69 ms. Allocated memory is still 203.4 MB. Free memory was 165.1 MB in the beginning and 118.3 MB in the end (delta: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17495.77 ms. Allocated memory was 203.4 MB in the beginning and 422.6 MB in the end (delta: 219.2 MB). Free memory was 117.4 MB in the beginning and 120.4 MB in the end (delta: -3.0 MB). Peak memory consumption was 216.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 16 could not be translated for associated CType STRUCT~~list_head?prev~*list_head?next~*list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 13 could not be translated for associated CType STRUCT~~list_head?prev~*list_head?next~*list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 13 could not be translated for associated CType STRUCT~~list_head?prev~*list_head?next~*list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 16 could not be translated for associated CType STRUCT~~list_head?prev~*list_head?next~*list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 13 could not be translated for associated CType STRUCT~~list_head?prev~*list_head?next~*list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 16 could not be translated for associated CType STRUCT~~list_head?prev~*list_head?next~*list_head# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 6]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L867] void * guard_malloc_counter = 0; VAL [\old(elem)=9, \old(elem)=14, \old(guard_malloc_counter)=11, \old(guard_malloc_counter)=12, \old(head)=null, \old(head)=null, elem={14:9}, guard_malloc_counter={0:0}, head={16:13}] [L887] struct list_head *elem = ((void *)0); VAL [\old(elem)=9, \old(elem)=14, \old(guard_malloc_counter)=12, \old(guard_malloc_counter)=11, \old(head)=null, \old(head)=null, elem={0:0}, guard_malloc_counter={0:0}, head={16:13}] [L900] static struct list_head head; VAL [\old(elem)=9, \old(elem)=14, \old(guard_malloc_counter)=12, \old(guard_malloc_counter)=11, \old(head)=null, \old(head)=null, elem={0:0}, guard_malloc_counter={0:0}, head={3:0}] [L903] struct list_head *dev1, *dev2; VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:0}, guard_malloc_counter={0:0}, head={3:0}] [L904] CALL, EXPR my_malloc(sizeof(*dev1)) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, \old(size)=8, elem={0:0}, guard_malloc_counter={0:0}, head={3:0}] [L879] CALL, EXPR __getMemory(size) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, \old(size)=8, elem={0:0}, guard_malloc_counter={0:0}, head={3:0}] [L871] (size > 0) ? (0) : __blast_assert () VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, \old(size)=8, elem={0:0}, guard_malloc_counter={0:0}, head={3:0}, size=8] [L872] guard_malloc_counter++ VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, \old(size)=8, elem={0:0}, guard_malloc_counter={0:1}, head={3:0}, size=8] [L873] COND FALSE !(!__VERIFIER_nondet_int()) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, \old(size)=8, __VERIFIER_nondet_int()=1, elem={0:0}, guard_malloc_counter={0:1}, head={3:0}, size=8] [L875] return (void *) guard_malloc_counter; VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, \old(size)=8, \result={0:1}, elem={0:0}, guard_malloc_counter={0:1}, head={3:0}, size=8] [L879] RET, EXPR __getMemory(size) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, \old(size)=8, __getMemory(size)={0:1}, elem={0:0}, guard_malloc_counter={0:1}, head={3:0}, size=8] [L879] return __getMemory(size); VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, \old(size)=8, \result={0:1}, __getMemory(size)={0:1}, elem={0:0}, guard_malloc_counter={0:1}, head={3:0}, size=8] [L904] RET, EXPR my_malloc(sizeof(*dev1)) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:0}, guard_malloc_counter={0:1}, head={3:0}, my_malloc(sizeof(*dev1))={0:1}] [L904] dev1 = my_malloc(sizeof(*dev1)) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, dev1={0:1}, elem={0:0}, guard_malloc_counter={0:1}, head={3:0}, my_malloc(sizeof(*dev1))={0:1}] [L905] CALL, EXPR my_malloc(sizeof(*dev2)) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=1, \old(size)=8, elem={0:0}, guard_malloc_counter={0:1}, head={3:0}] [L879] CALL, EXPR __getMemory(size) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=1, \old(guard_malloc_counter)=0, \old(size)=8, elem={0:0}, guard_malloc_counter={0:1}, head={3:0}] [L871] (size > 0) ? (0) : __blast_assert () VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=1, \old(guard_malloc_counter)=0, \old(size)=8, elem={0:0}, guard_malloc_counter={0:1}, head={3:0}, size=8] [L872] guard_malloc_counter++ VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=1, \old(guard_malloc_counter)=0, \old(size)=8, elem={0:0}, guard_malloc_counter={0:2}, head={3:0}, size=8] [L873] COND FALSE !(!__VERIFIER_nondet_int()) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=1, \old(size)=8, __VERIFIER_nondet_int()=1, elem={0:0}, guard_malloc_counter={0:2}, head={3:0}, size=8] [L875] return (void *) guard_malloc_counter; VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=1, \old(guard_malloc_counter)=0, \old(size)=8, \result={0:2}, elem={0:0}, guard_malloc_counter={0:2}, head={3:0}, size=8] [L879] RET, EXPR __getMemory(size) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=1, \old(size)=8, __getMemory(size)={0:2}, elem={0:0}, guard_malloc_counter={0:2}, head={3:0}, size=8] [L879] return __getMemory(size); VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=1, \old(size)=8, \result={0:2}, __getMemory(size)={0:2}, elem={0:0}, guard_malloc_counter={0:2}, head={3:0}, size=8] [L905] RET, EXPR my_malloc(sizeof(*dev2)) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, dev1={0:1}, elem={0:0}, guard_malloc_counter={0:2}, head={3:0}, my_malloc(sizeof(*dev2))={0:2}] [L905] dev2 = my_malloc(sizeof(*dev2)) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, dev1={0:1}, dev2={0:2}, elem={0:0}, guard_malloc_counter={0:2}, head={3:0}, my_malloc(sizeof(*dev2))={0:2}] [L906] COND TRUE dev1!=((void *)0) && dev2!=((void *)0) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, dev1={0:1}, dev2={0:2}, elem={0:0}, guard_malloc_counter={0:2}, head={3:0}] [L907] CALL list_add(dev2, &head) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:0}, guard_malloc_counter={0:2}, head={3:0}, head={3:0}, new={0:2}] [L890] (new!=elem) ? (0) : __blast_assert () VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:0}, guard_malloc_counter={0:2}, head={3:0}, head={3:0}, head={3:0}, new={0:2}, new={0:2}] [L891] COND FALSE !(__VERIFIER_nondet_int()) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, __VERIFIER_nondet_int()=0, elem={0:0}, guard_malloc_counter={0:2}, head={3:0}, head={3:0}, head={3:0}, new={0:2}, new={0:2}] [L907] RET list_add(dev2, &head) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, dev1={0:1}, dev2={0:2}, elem={0:0}, guard_malloc_counter={0:2}, head={3:0}] [L908] CALL list_add(dev1, &head) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:0}, guard_malloc_counter={0:2}, head={3:0}, head={3:0}, new={0:1}] [L890] (new!=elem) ? (0) : __blast_assert () VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:0}, guard_malloc_counter={0:2}, head={3:0}, head={3:0}, head={3:0}, new={0:1}, new={0:1}] [L891] COND TRUE __VERIFIER_nondet_int() VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, __VERIFIER_nondet_int()=1, elem={0:0}, guard_malloc_counter={0:2}, head={3:0}, head={3:0}, head={3:0}, new={0:1}, new={0:1}] [L892] elem = new VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:1}, guard_malloc_counter={0:2}, head={3:0}, head={3:0}, head={3:0}, new={0:1}, new={0:1}] [L908] RET list_add(dev1, &head) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, dev1={0:1}, dev2={0:2}, elem={0:1}, guard_malloc_counter={0:2}, head={3:0}] [L909] CALL list_del(dev2) VAL [\old(elem)=0, \old(elem)=1, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:1}, entry={0:2}, guard_malloc_counter={0:2}, head={3:0}] [L896] COND FALSE !(entry==elem) VAL [\old(elem)=0, \old(elem)=1, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:1}, entry={0:2}, entry={0:2}, guard_malloc_counter={0:2}, head={3:0}] [L909] RET list_del(dev2) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, dev1={0:1}, dev2={0:2}, elem={0:1}, guard_malloc_counter={0:2}, head={3:0}] [L910] CALL list_add(dev2, &head) VAL [\old(elem)=1, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:1}, guard_malloc_counter={0:2}, head={3:0}, head={3:0}, new={0:2}] [L890] (new!=elem) ? (0) : __blast_assert () VAL [\old(elem)=1, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:1}, guard_malloc_counter={0:2}, head={3:0}, head={3:0}, head={3:0}, new={0:2}, new={0:2}] [L891] COND FALSE !(__VERIFIER_nondet_int()) VAL [\old(elem)=0, \old(elem)=1, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, __VERIFIER_nondet_int()=0, elem={0:1}, guard_malloc_counter={0:2}, head={3:0}, head={3:0}, head={3:0}, new={0:2}, new={0:2}] [L910] RET list_add(dev2, &head) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, dev1={0:1}, dev2={0:2}, elem={0:1}, guard_malloc_counter={0:2}, head={3:0}] [L913] CALL list_add(dev1, &head) VAL [\old(elem)=1, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:1}, guard_malloc_counter={0:2}, head={3:0}, head={3:0}, new={0:1}] [L890] (new!=elem) ? (0) : __blast_assert () VAL [\old(elem)=1, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:1}, guard_malloc_counter={0:2}, head={3:0}, head={3:0}, head={3:0}, new={0:1}, new={0:1}] [L890] CALL __blast_assert () VAL [\old(elem)=0, \old(elem)=1, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:1}, guard_malloc_counter={0:2}, head={3:0}] [L6] __VERIFIER_error() VAL [\old(elem)=1, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:1}, guard_malloc_counter={0:2}, head={3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 71 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 17.3s, OverallIterations: 12, TraceHistogramMax: 4, AutomataDifference: 12.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 629 SDtfs, 1113 SDslu, 2232 SDs, 0 SdLazy, 7486 SolverSat, 605 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 454 GetRequests, 141 SyntacticMatches, 1 SemanticMatches, 312 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1428 ImplicationChecksByTransitivity, 7.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 72 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 875 NumberOfCodeBlocks, 875 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 770 ConstructedInterpolants, 0 QuantifiedInterpolants, 225364 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 2 PerfectInterpolantSequences, 170/259 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...