/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/forester-heap/dll-01-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 02:07:53,288 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 02:07:53,290 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 02:07:53,302 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 02:07:53,302 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 02:07:53,303 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 02:07:53,304 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 02:07:53,306 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 02:07:53,308 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 02:07:53,308 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 02:07:53,309 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 02:07:53,310 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 02:07:53,311 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 02:07:53,312 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 02:07:53,313 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 02:07:53,314 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 02:07:53,314 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 02:07:53,315 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 02:07:53,317 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 02:07:53,319 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 02:07:53,320 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 02:07:53,321 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 02:07:53,322 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 02:07:53,323 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 02:07:53,325 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 02:07:53,326 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 02:07:53,326 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 02:07:53,327 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 02:07:53,327 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 02:07:53,328 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 02:07:53,328 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 02:07:53,329 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 02:07:53,330 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 02:07:53,330 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 02:07:53,331 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 02:07:53,331 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 02:07:53,332 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 02:07:53,332 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 02:07:53,333 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 02:07:53,333 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 02:07:53,334 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 02:07:53,335 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-07 02:07:53,353 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 02:07:53,353 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 02:07:53,355 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 02:07:53,355 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 02:07:53,355 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 02:07:53,355 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 02:07:53,356 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 02:07:53,356 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 02:07:53,357 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 02:07:53,357 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 02:07:53,357 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 02:07:53,357 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 02:07:53,357 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 02:07:53,357 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 02:07:53,358 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 02:07:53,358 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 02:07:53,358 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 02:07:53,358 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 02:07:53,359 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 02:07:53,360 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 02:07:53,360 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 02:07:53,360 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 02:07:53,361 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 02:07:53,361 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 02:07:53,361 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 02:07:53,361 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 02:07:53,361 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 02:07:53,362 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 02:07:53,362 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-11-07 02:07:53,677 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 02:07:53,700 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 02:07:53,703 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 02:07:53,705 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 02:07:53,705 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 02:07:53,706 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-01-2.i [2019-11-07 02:07:53,778 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb7e03d37/313c2c97d9ee4a018971ead602a5e07f/FLAGa039409fa [2019-11-07 02:07:54,340 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 02:07:54,341 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-2.i [2019-11-07 02:07:54,362 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb7e03d37/313c2c97d9ee4a018971ead602a5e07f/FLAGa039409fa [2019-11-07 02:07:54,613 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb7e03d37/313c2c97d9ee4a018971ead602a5e07f [2019-11-07 02:07:54,623 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 02:07:54,625 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 02:07:54,626 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 02:07:54,626 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 02:07:54,629 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 02:07:54,630 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:07:54" (1/1) ... [2019-11-07 02:07:54,633 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64e5d574 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:07:54, skipping insertion in model container [2019-11-07 02:07:54,634 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:07:54" (1/1) ... [2019-11-07 02:07:54,642 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 02:07:54,699 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 02:07:55,201 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 02:07:55,218 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 02:07:55,312 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 02:07:55,358 INFO L192 MainTranslator]: Completed translation [2019-11-07 02:07:55,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:07:55 WrapperNode [2019-11-07 02:07:55,359 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 02:07:55,360 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 02:07:55,360 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 02:07:55,360 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 02:07:55,374 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:07:55" (1/1) ... [2019-11-07 02:07:55,374 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:07:55" (1/1) ... [2019-11-07 02:07:55,390 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:07:55" (1/1) ... [2019-11-07 02:07:55,390 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:07:55" (1/1) ... [2019-11-07 02:07:55,410 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:07:55" (1/1) ... [2019-11-07 02:07:55,427 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:07:55" (1/1) ... [2019-11-07 02:07:55,432 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:07:55" (1/1) ... [2019-11-07 02:07:55,439 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 02:07:55,439 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 02:07:55,440 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 02:07:55,440 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 02:07:55,441 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:07:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 02:07:55,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 02:07:55,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 02:07:55,493 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 02:07:55,493 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-07 02:07:55,493 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-07 02:07:55,494 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-07 02:07:55,494 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-07 02:07:55,494 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-07 02:07:55,494 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-07 02:07:55,494 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-07 02:07:55,494 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-07 02:07:55,495 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-07 02:07:55,495 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-07 02:07:55,495 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-07 02:07:55,495 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-07 02:07:55,495 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-07 02:07:55,495 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-07 02:07:55,496 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-07 02:07:55,496 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-07 02:07:55,496 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-07 02:07:55,496 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-07 02:07:55,496 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-07 02:07:55,496 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-07 02:07:55,497 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-07 02:07:55,497 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-07 02:07:55,497 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-07 02:07:55,497 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-07 02:07:55,497 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-07 02:07:55,497 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-07 02:07:55,498 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-07 02:07:55,498 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-07 02:07:55,498 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-07 02:07:55,498 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-07 02:07:55,498 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-07 02:07:55,498 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-07 02:07:55,498 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-07 02:07:55,499 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-07 02:07:55,499 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-07 02:07:55,499 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-07 02:07:55,499 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-07 02:07:55,499 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-07 02:07:55,499 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-07 02:07:55,500 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-07 02:07:55,500 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-07 02:07:55,500 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-07 02:07:55,500 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-07 02:07:55,500 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-07 02:07:55,500 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-07 02:07:55,500 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-07 02:07:55,500 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-07 02:07:55,501 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-07 02:07:55,501 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-07 02:07:55,501 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-07 02:07:55,501 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-07 02:07:55,501 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-07 02:07:55,501 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-07 02:07:55,501 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-07 02:07:55,502 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-07 02:07:55,502 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-07 02:07:55,502 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-07 02:07:55,502 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-07 02:07:55,502 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-07 02:07:55,502 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-07 02:07:55,503 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-07 02:07:55,503 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-07 02:07:55,503 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-07 02:07:55,503 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-07 02:07:55,503 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-07 02:07:55,503 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-07 02:07:55,504 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-07 02:07:55,504 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-07 02:07:55,504 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-07 02:07:55,504 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-07 02:07:55,504 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-07 02:07:55,504 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-07 02:07:55,504 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-07 02:07:55,505 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-07 02:07:55,505 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-07 02:07:55,505 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-07 02:07:55,505 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-07 02:07:55,505 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-07 02:07:55,505 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-07 02:07:55,506 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-07 02:07:55,506 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-07 02:07:55,506 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-07 02:07:55,506 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-07 02:07:55,506 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-07 02:07:55,506 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-07 02:07:55,506 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-07 02:07:55,507 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-07 02:07:55,507 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-07 02:07:55,507 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-07 02:07:55,507 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-07 02:07:55,507 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-07 02:07:55,507 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-07 02:07:55,507 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-07 02:07:55,508 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-07 02:07:55,508 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-07 02:07:55,508 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-07 02:07:55,508 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-07 02:07:55,508 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-07 02:07:55,508 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-07 02:07:55,509 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-07 02:07:55,509 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-07 02:07:55,509 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-07 02:07:55,509 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-07 02:07:55,509 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-07 02:07:55,509 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 02:07:55,509 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 02:07:55,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-07 02:07:55,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-07 02:07:55,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-07 02:07:55,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-07 02:07:55,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 02:07:55,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 02:07:56,290 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 02:07:56,290 INFO L284 CfgBuilder]: Removed 30 assume(true) statements. [2019-11-07 02:07:56,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:07:56 BoogieIcfgContainer [2019-11-07 02:07:56,291 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 02:07:56,293 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 02:07:56,293 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 02:07:56,296 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 02:07:56,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 02:07:54" (1/3) ... [2019-11-07 02:07:56,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@689ed68e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:07:56, skipping insertion in model container [2019-11-07 02:07:56,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:07:55" (2/3) ... [2019-11-07 02:07:56,298 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@689ed68e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:07:56, skipping insertion in model container [2019-11-07 02:07:56,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:07:56" (3/3) ... [2019-11-07 02:07:56,300 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-01-2.i [2019-11-07 02:07:56,309 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 02:07:56,317 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2019-11-07 02:07:56,328 INFO L249 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2019-11-07 02:07:56,353 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 02:07:56,354 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 02:07:56,354 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 02:07:56,354 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 02:07:56,355 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 02:07:56,356 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 02:07:56,356 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 02:07:56,356 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 02:07:56,376 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2019-11-07 02:07:56,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-07 02:07:56,382 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 02:07:56,383 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-07 02:07:56,385 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 02:07:56,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 02:07:56,391 INFO L82 PathProgramCache]: Analyzing trace with hash -445938275, now seen corresponding path program 1 times [2019-11-07 02:07:56,401 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 02:07:56,401 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885988543] [2019-11-07 02:07:56,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 02:07:56,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 02:07:56,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 02:07:56,577 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885988543] [2019-11-07 02:07:56,578 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 02:07:56,578 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 02:07:56,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461732489] [2019-11-07 02:07:56,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 02:07:56,585 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 02:07:56,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 02:07:56,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 02:07:56,602 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 3 states. [2019-11-07 02:07:56,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 02:07:56,669 INFO L93 Difference]: Finished difference Result 171 states and 270 transitions. [2019-11-07 02:07:56,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 02:07:56,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-11-07 02:07:56,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 02:07:56,681 INFO L225 Difference]: With dead ends: 171 [2019-11-07 02:07:56,682 INFO L226 Difference]: Without dead ends: 93 [2019-11-07 02:07:56,685 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 02:07:56,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-11-07 02:07:56,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 75. [2019-11-07 02:07:56,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-07 02:07:56,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2019-11-07 02:07:56,729 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 7 [2019-11-07 02:07:56,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 02:07:56,729 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2019-11-07 02:07:56,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 02:07:56,730 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2019-11-07 02:07:56,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-07 02:07:56,730 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 02:07:56,731 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 02:07:56,731 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 02:07:56,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 02:07:56,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1701000262, now seen corresponding path program 1 times [2019-11-07 02:07:56,732 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 02:07:56,732 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104538167] [2019-11-07 02:07:56,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 02:07:56,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 02:07:56,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 02:07:56,830 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104538167] [2019-11-07 02:07:56,830 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 02:07:56,832 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 02:07:56,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120771376] [2019-11-07 02:07:56,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 02:07:56,834 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 02:07:56,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 02:07:56,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 02:07:56,834 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 3 states. [2019-11-07 02:07:56,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 02:07:56,845 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2019-11-07 02:07:56,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 02:07:56,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-07 02:07:56,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 02:07:56,847 INFO L225 Difference]: With dead ends: 75 [2019-11-07 02:07:56,847 INFO L226 Difference]: Without dead ends: 73 [2019-11-07 02:07:56,848 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 02:07:56,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-07 02:07:56,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-11-07 02:07:56,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-07 02:07:56,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2019-11-07 02:07:56,856 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 11 [2019-11-07 02:07:56,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 02:07:56,856 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2019-11-07 02:07:56,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 02:07:56,857 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2019-11-07 02:07:56,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-07 02:07:56,857 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 02:07:56,858 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 02:07:56,858 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 02:07:56,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 02:07:56,858 INFO L82 PathProgramCache]: Analyzing trace with hash 781316733, now seen corresponding path program 1 times [2019-11-07 02:07:56,859 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 02:07:56,859 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253971329] [2019-11-07 02:07:56,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 02:07:56,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 02:07:56,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 02:07:56,981 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253971329] [2019-11-07 02:07:56,982 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 02:07:56,982 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 02:07:56,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947324705] [2019-11-07 02:07:56,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 02:07:56,983 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 02:07:56,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 02:07:56,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 02:07:56,983 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 6 states. [2019-11-07 02:07:57,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 02:07:57,176 INFO L93 Difference]: Finished difference Result 131 states and 139 transitions. [2019-11-07 02:07:57,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 02:07:57,177 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-07 02:07:57,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 02:07:57,178 INFO L225 Difference]: With dead ends: 131 [2019-11-07 02:07:57,178 INFO L226 Difference]: Without dead ends: 107 [2019-11-07 02:07:57,180 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-07 02:07:57,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-07 02:07:57,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 68. [2019-11-07 02:07:57,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-07 02:07:57,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2019-11-07 02:07:57,193 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 16 [2019-11-07 02:07:57,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 02:07:57,194 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2019-11-07 02:07:57,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 02:07:57,198 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2019-11-07 02:07:57,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-07 02:07:57,199 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 02:07:57,199 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 02:07:57,200 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 02:07:57,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 02:07:57,200 INFO L82 PathProgramCache]: Analyzing trace with hash -52979580, now seen corresponding path program 1 times [2019-11-07 02:07:57,201 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 02:07:57,201 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675529532] [2019-11-07 02:07:57,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 02:07:57,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 02:07:57,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 02:07:57,272 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675529532] [2019-11-07 02:07:57,272 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 02:07:57,272 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 02:07:57,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113506449] [2019-11-07 02:07:57,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 02:07:57,273 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 02:07:57,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 02:07:57,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 02:07:57,276 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 3 states. [2019-11-07 02:07:57,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 02:07:57,305 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2019-11-07 02:07:57,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 02:07:57,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-07 02:07:57,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 02:07:57,310 INFO L225 Difference]: With dead ends: 68 [2019-11-07 02:07:57,310 INFO L226 Difference]: Without dead ends: 66 [2019-11-07 02:07:57,311 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 02:07:57,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-07 02:07:57,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-11-07 02:07:57,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-07 02:07:57,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2019-11-07 02:07:57,322 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 21 [2019-11-07 02:07:57,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 02:07:57,322 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2019-11-07 02:07:57,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 02:07:57,322 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2019-11-07 02:07:57,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-07 02:07:57,326 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 02:07:57,326 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 02:07:57,327 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 02:07:57,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 02:07:57,327 INFO L82 PathProgramCache]: Analyzing trace with hash -52970068, now seen corresponding path program 1 times [2019-11-07 02:07:57,327 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 02:07:57,328 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419701931] [2019-11-07 02:07:57,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 02:07:57,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 02:07:57,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 02:07:57,399 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419701931] [2019-11-07 02:07:57,399 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 02:07:57,399 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 02:07:57,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578976273] [2019-11-07 02:07:57,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 02:07:57,400 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 02:07:57,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 02:07:57,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 02:07:57,401 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 3 states. [2019-11-07 02:07:57,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 02:07:57,418 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2019-11-07 02:07:57,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 02:07:57,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-07 02:07:57,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 02:07:57,426 INFO L225 Difference]: With dead ends: 91 [2019-11-07 02:07:57,426 INFO L226 Difference]: Without dead ends: 89 [2019-11-07 02:07:57,427 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 02:07:57,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-07 02:07:57,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 68. [2019-11-07 02:07:57,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-07 02:07:57,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2019-11-07 02:07:57,435 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 21 [2019-11-07 02:07:57,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 02:07:57,435 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2019-11-07 02:07:57,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 02:07:57,436 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2019-11-07 02:07:57,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-07 02:07:57,436 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 02:07:57,439 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 02:07:57,440 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 02:07:57,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 02:07:57,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1706116094, now seen corresponding path program 1 times [2019-11-07 02:07:57,441 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 02:07:57,441 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231091209] [2019-11-07 02:07:57,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 02:07:57,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 02:07:57,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 02:07:57,535 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231091209] [2019-11-07 02:07:57,536 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 02:07:57,536 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 02:07:57,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78885371] [2019-11-07 02:07:57,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 02:07:57,537 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 02:07:57,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 02:07:57,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 02:07:57,537 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand 3 states. [2019-11-07 02:07:57,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 02:07:57,548 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2019-11-07 02:07:57,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 02:07:57,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-07 02:07:57,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 02:07:57,551 INFO L225 Difference]: With dead ends: 68 [2019-11-07 02:07:57,551 INFO L226 Difference]: Without dead ends: 66 [2019-11-07 02:07:57,552 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 02:07:57,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-07 02:07:57,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-11-07 02:07:57,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-07 02:07:57,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2019-11-07 02:07:57,561 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 22 [2019-11-07 02:07:57,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 02:07:57,562 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2019-11-07 02:07:57,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 02:07:57,562 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2019-11-07 02:07:57,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-07 02:07:57,563 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 02:07:57,563 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 02:07:57,563 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 02:07:57,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 02:07:57,564 INFO L82 PathProgramCache]: Analyzing trace with hash -2057575781, now seen corresponding path program 1 times [2019-11-07 02:07:57,564 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 02:07:57,564 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176658572] [2019-11-07 02:07:57,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 02:07:57,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 02:07:57,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 02:07:57,943 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176658572] [2019-11-07 02:07:57,943 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 02:07:57,943 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 02:07:57,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503800426] [2019-11-07 02:07:57,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 02:07:57,944 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 02:07:57,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 02:07:57,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-07 02:07:57,945 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand 9 states. [2019-11-07 02:07:58,342 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-11-07 02:07:58,643 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-11-07 02:07:58,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 02:07:58,963 INFO L93 Difference]: Finished difference Result 152 states and 165 transitions. [2019-11-07 02:07:58,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-07 02:07:58,963 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2019-11-07 02:07:58,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 02:07:58,966 INFO L225 Difference]: With dead ends: 152 [2019-11-07 02:07:58,966 INFO L226 Difference]: Without dead ends: 150 [2019-11-07 02:07:58,967 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2019-11-07 02:07:58,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-11-07 02:07:58,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 83. [2019-11-07 02:07:58,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-07 02:07:58,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions. [2019-11-07 02:07:58,978 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 24 [2019-11-07 02:07:58,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 02:07:58,978 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions. [2019-11-07 02:07:58,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 02:07:58,979 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2019-11-07 02:07:58,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-07 02:07:58,980 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 02:07:58,980 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 02:07:58,981 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 02:07:58,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 02:07:58,981 INFO L82 PathProgramCache]: Analyzing trace with hash 537268982, now seen corresponding path program 1 times [2019-11-07 02:07:58,981 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 02:07:58,981 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322297255] [2019-11-07 02:07:58,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 02:07:59,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 02:07:59,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 02:07:59,294 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322297255] [2019-11-07 02:07:59,295 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 02:07:59,295 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 02:07:59,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371198273] [2019-11-07 02:07:59,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 02:07:59,296 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 02:07:59,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 02:07:59,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-07 02:07:59,296 INFO L87 Difference]: Start difference. First operand 83 states and 92 transitions. Second operand 9 states. [2019-11-07 02:07:59,675 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-11-07 02:08:00,101 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-11-07 02:08:00,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 02:08:00,328 INFO L93 Difference]: Finished difference Result 161 states and 174 transitions. [2019-11-07 02:08:00,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-07 02:08:00,329 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2019-11-07 02:08:00,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 02:08:00,330 INFO L225 Difference]: With dead ends: 161 [2019-11-07 02:08:00,330 INFO L226 Difference]: Without dead ends: 159 [2019-11-07 02:08:00,331 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2019-11-07 02:08:00,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-07 02:08:00,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 90. [2019-11-07 02:08:00,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-07 02:08:00,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2019-11-07 02:08:00,340 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 27 [2019-11-07 02:08:00,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 02:08:00,340 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2019-11-07 02:08:00,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 02:08:00,341 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2019-11-07 02:08:00,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-07 02:08:00,342 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 02:08:00,342 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 02:08:00,342 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 02:08:00,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 02:08:00,343 INFO L82 PathProgramCache]: Analyzing trace with hash 272164207, now seen corresponding path program 1 times [2019-11-07 02:08:00,343 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 02:08:00,343 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171314834] [2019-11-07 02:08:00,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 02:08:00,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 02:08:00,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-07 02:08:00,370 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171314834] [2019-11-07 02:08:00,370 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 02:08:00,371 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 02:08:00,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569817188] [2019-11-07 02:08:00,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 02:08:00,372 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 02:08:00,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 02:08:00,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 02:08:00,372 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand 3 states. [2019-11-07 02:08:00,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 02:08:00,419 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2019-11-07 02:08:00,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 02:08:00,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-07 02:08:00,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 02:08:00,420 INFO L225 Difference]: With dead ends: 91 [2019-11-07 02:08:00,420 INFO L226 Difference]: Without dead ends: 89 [2019-11-07 02:08:00,421 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 02:08:00,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-07 02:08:00,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2019-11-07 02:08:00,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-07 02:08:00,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2019-11-07 02:08:00,437 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 27 [2019-11-07 02:08:00,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 02:08:00,438 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2019-11-07 02:08:00,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 02:08:00,438 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2019-11-07 02:08:00,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-07 02:08:00,440 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 02:08:00,441 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 02:08:00,441 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 02:08:00,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 02:08:00,441 INFO L82 PathProgramCache]: Analyzing trace with hash -841141344, now seen corresponding path program 1 times [2019-11-07 02:08:00,442 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 02:08:00,443 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252967419] [2019-11-07 02:08:00,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 02:08:00,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 02:08:00,588 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 02:08:00,588 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252967419] [2019-11-07 02:08:00,589 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825601102] [2019-11-07 02:08:00,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 02:08:00,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 02:08:00,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-07 02:08:00,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 02:08:00,788 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-07 02:08:00,789 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-07 02:08:00,802 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 02:08:00,815 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-07 02:08:00,817 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2019-11-07 02:08:00,817 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-07 02:08:00,829 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 02:08:00,835 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-07 02:08:00,837 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2019-11-07 02:08:00,837 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-07 02:08:00,848 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 02:08:00,848 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-07 02:08:00,848 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:42, output treesize:41 [2019-11-07 02:08:00,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:08:00,896 INFO L392 ElimStorePlain]: Different costs {0=[|v_#valid_32|], 1=[v_prenex_1]} [2019-11-07 02:08:00,911 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 65 [2019-11-07 02:08:00,912 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-07 02:08:01,121 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-11-07 02:08:01,121 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 02:08:01,150 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 02:08:01,151 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 392 treesize of output 396 [2019-11-07 02:08:01,152 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-07 02:08:01,328 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-11-07 02:08:01,329 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 02:08:01,334 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.base_50|, |v_#memory_$Pointer$.offset_50|], 26=[v_prenex_2, v_prenex_3]} [2019-11-07 02:08:01,351 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-07 02:08:01,354 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-07 02:08:01,356 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-07 02:08:01,371 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 64 [2019-11-07 02:08:01,372 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-07 02:08:01,560 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-11-07 02:08:01,561 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 02:08:01,571 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-07 02:08:01,573 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-07 02:08:01,578 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-07 02:08:01,592 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 60 [2019-11-07 02:08:01,593 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-07 02:08:01,848 WARN L191 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-11-07 02:08:01,848 INFO L567 ElimStorePlain]: treesize reduction 8, result has 98.2 percent of original size [2019-11-07 02:08:01,854 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-07 02:08:01,866 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-07 02:08:01,867 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-07 02:08:01,870 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-07 02:08:02,060 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-11-07 02:08:02,061 INFO L341 Elim1Store]: treesize reduction 226, result has 52.8 percent of original size [2019-11-07 02:08:02,062 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 176 treesize of output 391 [2019-11-07 02:08:02,063 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-07 02:08:02,246 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-11-07 02:08:02,247 INFO L567 ElimStorePlain]: treesize reduction 220, result has 50.0 percent of original size [2019-11-07 02:08:02,264 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-07 02:08:02,268 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-07 02:08:02,269 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-07 02:08:02,270 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-07 02:08:02,273 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-07 02:08:02,275 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-07 02:08:02,317 INFO L341 Elim1Store]: treesize reduction 18, result has 64.7 percent of original size [2019-11-07 02:08:02,318 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 93 treesize of output 104 [2019-11-07 02:08:02,319 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-07 02:08:02,427 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-11-07 02:08:02,428 INFO L567 ElimStorePlain]: treesize reduction 16, result has 89.5 percent of original size [2019-11-07 02:08:02,429 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-07 02:08:02,429 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:460, output treesize:152 [2019-11-07 02:08:02,716 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-07 02:08:02,717 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-07 02:08:02,725 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 02:08:02,729 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 02:08:02,729 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 13 [2019-11-07 02:08:02,730 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-07 02:08:02,734 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 02:08:02,734 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-07 02:08:02,734 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:7 [2019-11-07 02:08:02,743 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 02:08:02,743 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 02:08:02,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:08:02,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:08:02,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:08:04,866 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_main_~list~0.offset 8))) (and (forall ((|v_main_#t~malloc2.base_7| Int)) (let ((.cse1 (+ c_main_~list~0.offset 8))) (let ((.cse0 (select (let ((.cse2 (let ((.cse5 (store |c_#memory_$Pointer$.base| c_main_~list~0.base (store (select |c_#memory_$Pointer$.base| c_main_~list~0.base) .cse1 |v_main_#t~malloc2.base_7|)))) (store .cse5 |v_main_#t~malloc2.base_7| (store (select .cse5 |v_main_#t~malloc2.base_7|) 0 0))))) (let ((.cse3 (select (select .cse2 c_main_~list~0.base) .cse1))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| c_main_~list~0.base (store (select |c_#memory_$Pointer$.offset| c_main_~list~0.base) .cse1 0)))) (store .cse4 |v_main_#t~malloc2.base_7| (store (select .cse4 |v_main_#t~malloc2.base_7|) 0 0))) c_main_~list~0.base) .cse1) 8) 0)))) c_main_~list~0.base))) (or (= 0 (select .cse0 c_main_~list~0.offset)) (not (= (select |c_#valid| |v_main_#t~malloc2.base_7|) 0)) (not (= 0 (select .cse0 .cse1))) (= |v_main_#t~malloc2.base_7| 0))))) (= (select (store (select |c_#memory_$Pointer$.base| c_main_~list~0.base) .cse6 0) c_main_~list~0.offset) 0) (= (select (store (select |c_#memory_$Pointer$.offset| c_main_~list~0.base) .cse6 0) c_main_~list~0.offset) 0) (forall ((v_prenex_4 Int)) (let ((.cse10 (+ c_main_~list~0.offset 8))) (let ((.cse11 (let ((.cse13 (store |c_#memory_$Pointer$.offset| c_main_~list~0.base (store (select |c_#memory_$Pointer$.offset| c_main_~list~0.base) .cse10 0)))) (store .cse13 v_prenex_4 (store (select .cse13 v_prenex_4) 0 0)))) (.cse7 (let ((.cse12 (store |c_#memory_$Pointer$.base| c_main_~list~0.base (store (select |c_#memory_$Pointer$.base| c_main_~list~0.base) .cse10 v_prenex_4)))) (store .cse12 v_prenex_4 (store (select .cse12 v_prenex_4) 0 0))))) (let ((.cse8 (select (select .cse7 c_main_~list~0.base) .cse10)) (.cse9 (+ (select (select .cse11 c_main_~list~0.base) .cse10) 8))) (or (= v_prenex_4 0) (not (= (select |c_#valid| v_prenex_4) 0)) (not (= 0 (select (select (store .cse7 .cse8 (store (select .cse7 .cse8) .cse9 0)) c_main_~list~0.base) .cse10))) (= (select (select (store .cse11 .cse8 (store (select .cse11 .cse8) .cse9 0)) c_main_~list~0.base) c_main_~list~0.offset) 0)))))))) is different from false [2019-11-07 02:08:04,908 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 02:08:04,909 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [562502949] [2019-11-07 02:08:04,938 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2019-11-07 02:08:04,938 INFO L166 IcfgInterpreter]: Building call graph [2019-11-07 02:08:04,945 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-07 02:08:04,952 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-07 02:08:04,954 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-07 02:08:05,056 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 24 for LOIs [2019-11-07 02:08:05,410 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-11-07 02:08:05,417 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-07 02:08:05,754 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-11-07 02:08:06,663 WARN L191 SmtUtils]: Spent 625.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 90 [2019-11-07 02:08:07,805 WARN L191 SmtUtils]: Spent 937.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 108 [2019-11-07 02:08:09,033 WARN L191 SmtUtils]: Spent 604.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 94 [2019-11-07 02:08:10,058 WARN L191 SmtUtils]: Spent 756.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 100 [2019-11-07 02:08:10,507 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-11-07 02:08:10,507 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8, 16] total 30 [2019-11-07 02:08:10,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099221666] [2019-11-07 02:08:10,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-07 02:08:10,509 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 02:08:10,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-07 02:08:10,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=688, Unknown=1, NotChecked=54, Total=870 [2019-11-07 02:08:10,510 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand 30 states. [2019-11-07 02:08:12,618 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_main_~list~0.offset 8)) (.cse1 (+ c_main_~list~0.offset 4))) (and (= (select (store (select |c_#memory_$Pointer$.base| c_main_~list~0.base) .cse0 0) c_main_~list~0.offset) 0) (= (store |c_old(#memory_$Pointer$.offset)| c_main_~list~0.base (store (store (select |c_old(#memory_$Pointer$.offset)| c_main_~list~0.base) c_main_~list~0.offset 0) .cse1 0)) |c_#memory_$Pointer$.offset|) (<= |c_#NULL.base| 0) (= 0 |c_main_#t~malloc0.offset|) (= |c_#length| (store |c_old(#length)| |c_main_#t~malloc0.base| 12)) (= (select (store (select |c_#memory_$Pointer$.offset| c_main_~list~0.base) .cse0 0) c_main_~list~0.offset) 0) (<= 0 |c_#NULL.base|) (= 0 (select |c_old(#valid)| 0)) (forall ((|v_main_#t~malloc2.base_7| Int)) (let ((.cse3 (+ c_main_~list~0.offset 8))) (let ((.cse2 (select (let ((.cse4 (let ((.cse7 (store |c_#memory_$Pointer$.base| c_main_~list~0.base (store (select |c_#memory_$Pointer$.base| c_main_~list~0.base) .cse3 |v_main_#t~malloc2.base_7|)))) (store .cse7 |v_main_#t~malloc2.base_7| (store (select .cse7 |v_main_#t~malloc2.base_7|) 0 0))))) (let ((.cse5 (select (select .cse4 c_main_~list~0.base) .cse3))) (store .cse4 .cse5 (store (select .cse4 .cse5) (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$.offset| c_main_~list~0.base (store (select |c_#memory_$Pointer$.offset| c_main_~list~0.base) .cse3 0)))) (store .cse6 |v_main_#t~malloc2.base_7| (store (select .cse6 |v_main_#t~malloc2.base_7|) 0 0))) c_main_~list~0.base) .cse3) 8) 0)))) c_main_~list~0.base))) (or (= 0 (select .cse2 c_main_~list~0.offset)) (not (= (select |c_#valid| |v_main_#t~malloc2.base_7|) 0)) (not (= 0 (select .cse2 .cse3))) (= |v_main_#t~malloc2.base_7| 0))))) (= c_main_~list~0.offset |c_main_#t~malloc0.offset|) (= |c_main_#t~malloc0.base| c_main_~list~0.base) (= (select |c_old(#valid)| |c_main_#t~malloc0.base|) 0) (< |c_#StackHeapBarrier| |c_main_#t~malloc0.base|) (= |c_#NULL.offset| 0) (not (= |c_main_#t~malloc0.base| 0)) (forall ((v_prenex_4 Int)) (let ((.cse11 (+ c_main_~list~0.offset 8))) (let ((.cse12 (let ((.cse14 (store |c_#memory_$Pointer$.offset| c_main_~list~0.base (store (select |c_#memory_$Pointer$.offset| c_main_~list~0.base) .cse11 0)))) (store .cse14 v_prenex_4 (store (select .cse14 v_prenex_4) 0 0)))) (.cse8 (let ((.cse13 (store |c_#memory_$Pointer$.base| c_main_~list~0.base (store (select |c_#memory_$Pointer$.base| c_main_~list~0.base) .cse11 v_prenex_4)))) (store .cse13 v_prenex_4 (store (select .cse13 v_prenex_4) 0 0))))) (let ((.cse9 (select (select .cse8 c_main_~list~0.base) .cse11)) (.cse10 (+ (select (select .cse12 c_main_~list~0.base) .cse11) 8))) (or (= v_prenex_4 0) (not (= (select |c_#valid| v_prenex_4) 0)) (not (= 0 (select (select (store .cse8 .cse9 (store (select .cse8 .cse9) .cse10 0)) c_main_~list~0.base) .cse11))) (= (select (select (store .cse12 .cse9 (store (select .cse12 .cse9) .cse10 0)) c_main_~list~0.base) c_main_~list~0.offset) 0)))))) (= (store |c_old(#valid)| |c_main_#t~malloc0.base| 1) |c_#valid|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| c_main_~list~0.base (store (store (select |c_old(#memory_$Pointer$.base)| c_main_~list~0.base) c_main_~list~0.offset 0) .cse1 0))))) is different from false [2019-11-07 02:08:14,386 WARN L191 SmtUtils]: Spent 731.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 105 [2019-11-07 02:08:15,047 WARN L191 SmtUtils]: Spent 500.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 95 [2019-11-07 02:08:15,514 WARN L191 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 66 [2019-11-07 02:08:16,402 WARN L191 SmtUtils]: Spent 552.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 104 [2019-11-07 02:08:17,246 WARN L191 SmtUtils]: Spent 738.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 96 [2019-11-07 02:08:18,232 WARN L191 SmtUtils]: Spent 648.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 94 [2019-11-07 02:08:19,699 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-11-07 02:08:19,875 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-11-07 02:08:20,261 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-11-07 02:08:20,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 02:08:20,581 INFO L93 Difference]: Finished difference Result 210 states and 226 transitions. [2019-11-07 02:08:20,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-07 02:08:20,581 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 29 [2019-11-07 02:08:20,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 02:08:20,582 INFO L225 Difference]: With dead ends: 210 [2019-11-07 02:08:20,583 INFO L226 Difference]: Without dead ends: 172 [2019-11-07 02:08:20,584 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 61 SyntacticMatches, 6 SemanticMatches, 51 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 764 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=373, Invalid=2183, Unknown=2, NotChecked=198, Total=2756 [2019-11-07 02:08:20,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-11-07 02:08:20,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 93. [2019-11-07 02:08:20,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-07 02:08:20,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2019-11-07 02:08:20,593 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 29 [2019-11-07 02:08:20,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 02:08:20,593 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2019-11-07 02:08:20,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-07 02:08:20,594 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2019-11-07 02:08:20,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-07 02:08:20,594 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 02:08:20,595 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 02:08:20,800 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 02:08:20,800 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 02:08:20,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 02:08:20,801 INFO L82 PathProgramCache]: Analyzing trace with hash -850180374, now seen corresponding path program 1 times [2019-11-07 02:08:20,801 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 02:08:20,801 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644148770] [2019-11-07 02:08:20,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 02:08:20,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 02:08:21,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 02:08:21,128 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644148770] [2019-11-07 02:08:21,128 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668225689] [2019-11-07 02:08:21,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 02:08:21,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 02:08:21,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-07 02:08:21,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 02:08:21,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 02:08:21,340 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 02:08:21,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 02:08:21,395 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-07 02:08:21,395 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 7] total 13 [2019-11-07 02:08:21,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761687163] [2019-11-07 02:08:21,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 02:08:21,396 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 02:08:21,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 02:08:21,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-11-07 02:08:21,397 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand 6 states. [2019-11-07 02:08:21,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 02:08:21,638 INFO L93 Difference]: Finished difference Result 159 states and 176 transitions. [2019-11-07 02:08:21,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-07 02:08:21,638 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-11-07 02:08:21,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 02:08:21,640 INFO L225 Difference]: With dead ends: 159 [2019-11-07 02:08:21,640 INFO L226 Difference]: Without dead ends: 143 [2019-11-07 02:08:21,641 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-11-07 02:08:21,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-11-07 02:08:21,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 115. [2019-11-07 02:08:21,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-07 02:08:21,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 132 transitions. [2019-11-07 02:08:21,650 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 132 transitions. Word has length 30 [2019-11-07 02:08:21,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 02:08:21,650 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 132 transitions. [2019-11-07 02:08:21,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 02:08:21,650 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 132 transitions. [2019-11-07 02:08:21,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-07 02:08:21,651 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 02:08:21,652 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 02:08:21,855 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 02:08:21,855 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 02:08:21,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 02:08:21,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1076227278, now seen corresponding path program 1 times [2019-11-07 02:08:21,864 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 02:08:21,864 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506557673] [2019-11-07 02:08:21,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 02:08:21,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 02:08:21,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 02:08:21,985 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506557673] [2019-11-07 02:08:21,986 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403153105] [2019-11-07 02:08:21,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 02:08:22,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 02:08:22,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-07 02:08:22,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 02:08:22,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 02:08:22,113 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 02:08:22,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 02:08:22,122 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [471852310] [2019-11-07 02:08:22,125 INFO L159 IcfgInterpreter]: Started Sifa with 31 locations of interest [2019-11-07 02:08:22,125 INFO L166 IcfgInterpreter]: Building call graph [2019-11-07 02:08:22,126 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-07 02:08:22,126 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-07 02:08:22,126 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-07 02:08:22,155 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 24 for LOIs [2019-11-07 02:08:22,429 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-11-07 02:08:22,436 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-07 02:08:23,439 WARN L191 SmtUtils]: Spent 624.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 90 [2019-11-07 02:08:24,460 WARN L191 SmtUtils]: Spent 926.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 108 [2019-11-07 02:08:25,443 WARN L191 SmtUtils]: Spent 615.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 94 [2019-11-07 02:08:26,285 WARN L191 SmtUtils]: Spent 693.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 100 [2019-11-07 02:08:27,093 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-11-07 02:08:27,282 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-11-07 02:08:27,355 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-11-07 02:08:27,355 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [4, 4, 4] total 24 [2019-11-07 02:08:27,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220661493] [2019-11-07 02:08:27,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-07 02:08:27,357 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 02:08:27,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-07 02:08:27,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2019-11-07 02:08:27,358 INFO L87 Difference]: Start difference. First operand 115 states and 132 transitions. Second operand 21 states. [2019-11-07 02:08:29,226 WARN L191 SmtUtils]: Spent 756.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 98 [2019-11-07 02:08:30,189 WARN L191 SmtUtils]: Spent 801.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 107 [2019-11-07 02:08:31,142 WARN L191 SmtUtils]: Spent 866.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 103 [2019-11-07 02:08:32,449 WARN L191 SmtUtils]: Spent 960.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 117 [2019-11-07 02:08:33,410 WARN L191 SmtUtils]: Spent 799.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 101 [2019-11-07 02:08:34,596 WARN L191 SmtUtils]: Spent 964.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 115 [2019-11-07 02:08:35,328 WARN L191 SmtUtils]: Spent 589.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 97 [2019-11-07 02:08:36,162 WARN L191 SmtUtils]: Spent 629.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 105 [2019-11-07 02:08:37,830 WARN L191 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 113 DAG size of output: 102 [2019-11-07 02:08:39,390 WARN L191 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 110 DAG size of output: 100 [2019-11-07 02:08:40,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 02:08:40,733 INFO L93 Difference]: Finished difference Result 202 states and 228 transitions. [2019-11-07 02:08:40,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-07 02:08:40,734 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 31 [2019-11-07 02:08:40,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 02:08:40,735 INFO L225 Difference]: With dead ends: 202 [2019-11-07 02:08:40,736 INFO L226 Difference]: Without dead ends: 150 [2019-11-07 02:08:40,737 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 71 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=364, Invalid=1616, Unknown=0, NotChecked=0, Total=1980 [2019-11-07 02:08:40,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-11-07 02:08:40,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 118. [2019-11-07 02:08:40,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-11-07 02:08:40,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 134 transitions. [2019-11-07 02:08:40,746 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 134 transitions. Word has length 31 [2019-11-07 02:08:40,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 02:08:40,746 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 134 transitions. [2019-11-07 02:08:40,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-07 02:08:40,746 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 134 transitions. [2019-11-07 02:08:40,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-07 02:08:40,748 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 02:08:40,748 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]