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-f4eb214f-m [2019-10-13 21:55:52,229 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:55:52,231 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:55:52,243 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:55:52,243 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:55:52,244 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:55:52,246 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:55:52,247 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:55:52,249 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:55:52,250 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:55:52,251 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:55:52,252 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:55:52,252 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:55:52,253 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:55:52,254 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:55:52,255 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:55:52,256 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:55:52,257 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:55:52,259 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:55:52,261 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:55:52,262 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:55:52,263 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:55:52,264 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:55:52,265 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:55:52,267 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:55:52,268 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:55:52,268 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:55:52,269 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:55:52,269 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:55:52,270 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:55:52,270 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:55:52,271 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:55:52,272 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:55:52,272 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:55:52,273 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:55:52,274 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:55:52,274 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:55:52,275 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:55:52,275 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:55:52,276 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:55:52,276 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:55:52,277 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-10-13 21:55:52,291 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:55:52,291 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:55:52,293 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:55:52,293 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:55:52,293 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:55:52,293 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:55:52,293 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:55:52,294 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:55:52,294 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:55:52,294 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:55:52,294 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:55:52,294 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:55:52,295 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:55:52,295 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:55:52,295 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:55:52,295 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:55:52,295 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:55:52,296 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:55:52,296 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:55:52,296 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:55:52,296 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:55:52,296 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:55:52,297 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:55:52,297 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:55:52,297 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:55:52,297 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:55:52,297 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:55:52,298 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:55:52,298 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-10-13 21:55:52,575 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:55:52,592 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:55:52,597 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:55:52,598 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:55:52,599 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:55:52,600 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-10-13 21:55:52,670 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57ec47916/b6846e7af6004e7db61b4e20ae75e553/FLAG7cf0c07f9 [2019-10-13 21:55:53,197 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:55:53,198 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-2.i [2019-10-13 21:55:53,218 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57ec47916/b6846e7af6004e7db61b4e20ae75e553/FLAG7cf0c07f9 [2019-10-13 21:55:53,432 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57ec47916/b6846e7af6004e7db61b4e20ae75e553 [2019-10-13 21:55:53,441 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:55:53,443 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:55:53,443 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:55:53,444 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:55:53,447 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:55:53,448 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:55:53" (1/1) ... [2019-10-13 21:55:53,451 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6912290 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:55:53, skipping insertion in model container [2019-10-13 21:55:53,451 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:55:53" (1/1) ... [2019-10-13 21:55:53,458 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:55:53,510 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:55:53,967 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:55:53,974 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:55:54,020 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:55:54,068 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:55:54,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:55:54 WrapperNode [2019-10-13 21:55:54,069 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:55:54,070 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:55:54,070 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:55:54,070 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:55:54,083 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:55:54" (1/1) ... [2019-10-13 21:55:54,084 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:55:54" (1/1) ... [2019-10-13 21:55:54,105 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:55:54" (1/1) ... [2019-10-13 21:55:54,105 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:55:54" (1/1) ... [2019-10-13 21:55:54,125 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:55:54" (1/1) ... [2019-10-13 21:55:54,136 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:55:54" (1/1) ... [2019-10-13 21:55:54,140 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:55:54" (1/1) ... [2019-10-13 21:55:54,147 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:55:54,147 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:55:54,147 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:55:54,147 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:55:54,148 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:55:54" (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-10-13 21:55:54,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:55:54,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:55:54,195 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:55:54,195 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-13 21:55:54,196 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-13 21:55:54,196 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-13 21:55:54,196 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-13 21:55:54,196 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-13 21:55:54,196 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-13 21:55:54,197 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-13 21:55:54,197 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-13 21:55:54,197 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-13 21:55:54,197 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-13 21:55:54,197 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-13 21:55:54,197 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-13 21:55:54,198 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-13 21:55:54,198 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-13 21:55:54,198 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-13 21:55:54,198 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-13 21:55:54,198 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-13 21:55:54,198 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-13 21:55:54,199 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-13 21:55:54,199 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-13 21:55:54,199 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-13 21:55:54,199 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-13 21:55:54,199 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-13 21:55:54,199 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-13 21:55:54,200 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-13 21:55:54,200 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-13 21:55:54,200 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-13 21:55:54,200 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-13 21:55:54,200 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-13 21:55:54,200 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-13 21:55:54,201 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-13 21:55:54,201 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-13 21:55:54,201 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-13 21:55:54,201 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-13 21:55:54,201 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-13 21:55:54,201 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-13 21:55:54,202 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-13 21:55:54,202 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-13 21:55:54,202 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-13 21:55:54,202 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-13 21:55:54,202 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-13 21:55:54,202 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-13 21:55:54,203 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-13 21:55:54,203 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-13 21:55:54,203 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-13 21:55:54,203 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-13 21:55:54,203 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-13 21:55:54,203 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-13 21:55:54,204 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-13 21:55:54,204 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-13 21:55:54,204 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 21:55:54,204 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-13 21:55:54,204 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-13 21:55:54,204 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 21:55:54,204 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-13 21:55:54,205 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-13 21:55:54,205 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-13 21:55:54,205 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-13 21:55:54,205 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-13 21:55:54,205 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-13 21:55:54,205 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-13 21:55:54,206 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-13 21:55:54,206 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-13 21:55:54,206 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 21:55:54,206 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-13 21:55:54,206 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-13 21:55:54,206 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-13 21:55:54,207 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-13 21:55:54,207 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-13 21:55:54,207 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-13 21:55:54,207 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-13 21:55:54,207 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-13 21:55:54,208 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-13 21:55:54,208 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-13 21:55:54,208 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-13 21:55:54,208 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-13 21:55:54,208 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-13 21:55:54,208 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-13 21:55:54,208 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-13 21:55:54,209 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-13 21:55:54,209 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-13 21:55:54,209 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-13 21:55:54,209 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-13 21:55:54,209 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-13 21:55:54,209 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-13 21:55:54,210 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-13 21:55:54,210 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-13 21:55:54,210 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-13 21:55:54,210 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-13 21:55:54,210 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-13 21:55:54,210 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-13 21:55:54,210 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-13 21:55:54,211 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-13 21:55:54,211 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-13 21:55:54,211 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-13 21:55:54,211 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-13 21:55:54,211 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-13 21:55:54,211 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-13 21:55:54,212 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-13 21:55:54,212 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-13 21:55:54,212 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-13 21:55:54,212 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-13 21:55:54,212 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-13 21:55:54,212 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:55:54,212 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:55:54,212 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:55:54,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 21:55:54,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 21:55:54,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 21:55:54,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:55:54,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:55:54,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:55:55,045 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:55:55,046 INFO L284 CfgBuilder]: Removed 30 assume(true) statements. [2019-10-13 21:55:55,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:55:55 BoogieIcfgContainer [2019-10-13 21:55:55,047 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:55:55,049 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:55:55,049 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:55:55,052 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:55:55,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:55:53" (1/3) ... [2019-10-13 21:55:55,054 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eaaa538 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:55:55, skipping insertion in model container [2019-10-13 21:55:55,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:55:54" (2/3) ... [2019-10-13 21:55:55,054 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eaaa538 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:55:55, skipping insertion in model container [2019-10-13 21:55:55,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:55:55" (3/3) ... [2019-10-13 21:55:55,058 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-01-2.i [2019-10-13 21:55:55,068 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:55:55,077 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2019-10-13 21:55:55,088 INFO L249 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2019-10-13 21:55:55,126 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:55:55,126 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:55:55,127 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:55:55,132 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:55:55,132 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:55:55,133 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:55:55,133 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:55:55,133 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:55:55,158 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2019-10-13 21:55:55,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-10-13 21:55:55,164 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:55:55,165 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:55:55,167 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:55:55,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:55:55,173 INFO L82 PathProgramCache]: Analyzing trace with hash -445938275, now seen corresponding path program 1 times [2019-10-13 21:55:55,182 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:55:55,183 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037500285] [2019-10-13 21:55:55,183 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:55:55,183 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:55:55,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:55:55,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:55:55,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:55:55,359 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037500285] [2019-10-13 21:55:55,360 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:55:55,360 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:55:55,360 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181828623] [2019-10-13 21:55:55,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:55:55,366 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:55:55,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:55:55,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:55:55,383 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 3 states. [2019-10-13 21:55:55,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:55:55,469 INFO L93 Difference]: Finished difference Result 171 states and 270 transitions. [2019-10-13 21:55:55,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:55:55,471 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-10-13 21:55:55,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:55:55,483 INFO L225 Difference]: With dead ends: 171 [2019-10-13 21:55:55,483 INFO L226 Difference]: Without dead ends: 93 [2019-10-13 21:55:55,487 INFO L600 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-10-13 21:55:55,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-10-13 21:55:55,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 75. [2019-10-13 21:55:55,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-13 21:55:55,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2019-10-13 21:55:55,554 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 7 [2019-10-13 21:55:55,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:55:55,554 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2019-10-13 21:55:55,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:55:55,555 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2019-10-13 21:55:55,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-13 21:55:55,556 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:55:55,556 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:55:55,556 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:55:55,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:55:55,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1701000262, now seen corresponding path program 1 times [2019-10-13 21:55:55,558 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:55:55,559 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808912415] [2019-10-13 21:55:55,559 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:55:55,559 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:55:55,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:55:55,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:55:55,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:55:55,679 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808912415] [2019-10-13 21:55:55,680 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:55:55,680 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:55:55,680 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163756744] [2019-10-13 21:55:55,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:55:55,682 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:55:55,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:55:55,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:55:55,682 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 3 states. [2019-10-13 21:55:55,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:55:55,691 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2019-10-13 21:55:55,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:55:55,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-10-13 21:55:55,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:55:55,693 INFO L225 Difference]: With dead ends: 75 [2019-10-13 21:55:55,693 INFO L226 Difference]: Without dead ends: 73 [2019-10-13 21:55:55,694 INFO L600 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-10-13 21:55:55,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-10-13 21:55:55,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-10-13 21:55:55,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-10-13 21:55:55,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2019-10-13 21:55:55,703 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 11 [2019-10-13 21:55:55,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:55:55,703 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2019-10-13 21:55:55,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:55:55,703 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2019-10-13 21:55:55,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-13 21:55:55,704 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:55:55,704 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:55:55,705 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:55:55,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:55:55,705 INFO L82 PathProgramCache]: Analyzing trace with hash 781316733, now seen corresponding path program 1 times [2019-10-13 21:55:55,705 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:55:55,706 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479324201] [2019-10-13 21:55:55,706 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:55:55,706 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:55:55,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:55:55,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:55:55,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:55:55,839 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479324201] [2019-10-13 21:55:55,839 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:55:55,840 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:55:55,840 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238341158] [2019-10-13 21:55:55,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:55:55,841 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:55:55,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:55:55,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:55:55,841 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 6 states. [2019-10-13 21:55:56,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:55:56,003 INFO L93 Difference]: Finished difference Result 131 states and 139 transitions. [2019-10-13 21:55:56,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:55:56,003 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-10-13 21:55:56,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:55:56,005 INFO L225 Difference]: With dead ends: 131 [2019-10-13 21:55:56,005 INFO L226 Difference]: Without dead ends: 107 [2019-10-13 21:55:56,006 INFO L600 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-10-13 21:55:56,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-10-13 21:55:56,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 68. [2019-10-13 21:55:56,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-13 21:55:56,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2019-10-13 21:55:56,022 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 16 [2019-10-13 21:55:56,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:55:56,022 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2019-10-13 21:55:56,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:55:56,024 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2019-10-13 21:55:56,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 21:55:56,025 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:55:56,025 INFO L380 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-10-13 21:55:56,026 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:55:56,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:55:56,028 INFO L82 PathProgramCache]: Analyzing trace with hash -52979580, now seen corresponding path program 1 times [2019-10-13 21:55:56,028 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:55:56,028 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765913838] [2019-10-13 21:55:56,028 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:55:56,029 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:55:56,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:55:56,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:55:56,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:55:56,107 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765913838] [2019-10-13 21:55:56,107 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:55:56,108 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:55:56,108 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392923992] [2019-10-13 21:55:56,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:55:56,112 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:55:56,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:55:56,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:55:56,113 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 3 states. [2019-10-13 21:55:56,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:55:56,143 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2019-10-13 21:55:56,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:55:56,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-13 21:55:56,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:55:56,144 INFO L225 Difference]: With dead ends: 68 [2019-10-13 21:55:56,144 INFO L226 Difference]: Without dead ends: 66 [2019-10-13 21:55:56,145 INFO L600 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-10-13 21:55:56,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-13 21:55:56,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-10-13 21:55:56,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-13 21:55:56,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2019-10-13 21:55:56,151 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 21 [2019-10-13 21:55:56,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:55:56,151 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2019-10-13 21:55:56,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:55:56,152 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2019-10-13 21:55:56,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 21:55:56,152 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:55:56,153 INFO L380 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-10-13 21:55:56,153 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:55:56,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:55:56,154 INFO L82 PathProgramCache]: Analyzing trace with hash -52970068, now seen corresponding path program 1 times [2019-10-13 21:55:56,154 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:55:56,154 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131210381] [2019-10-13 21:55:56,154 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:55:56,154 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:55:56,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:55:56,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:55:56,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:55:56,215 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131210381] [2019-10-13 21:55:56,216 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:55:56,216 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:55:56,216 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121121322] [2019-10-13 21:55:56,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:55:56,217 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:55:56,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:55:56,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:55:56,217 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 3 states. [2019-10-13 21:55:56,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:55:56,236 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2019-10-13 21:55:56,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:55:56,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-13 21:55:56,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:55:56,240 INFO L225 Difference]: With dead ends: 91 [2019-10-13 21:55:56,240 INFO L226 Difference]: Without dead ends: 89 [2019-10-13 21:55:56,240 INFO L600 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-10-13 21:55:56,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-10-13 21:55:56,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 68. [2019-10-13 21:55:56,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-13 21:55:56,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2019-10-13 21:55:56,252 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 21 [2019-10-13 21:55:56,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:55:56,255 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2019-10-13 21:55:56,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:55:56,256 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2019-10-13 21:55:56,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-13 21:55:56,257 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:55:56,257 INFO L380 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-10-13 21:55:56,257 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:55:56,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:55:56,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1706116094, now seen corresponding path program 1 times [2019-10-13 21:55:56,258 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:55:56,258 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758578881] [2019-10-13 21:55:56,260 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:55:56,260 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:55:56,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:55:56,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:55:56,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:55:56,341 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758578881] [2019-10-13 21:55:56,341 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:55:56,341 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:55:56,341 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032205005] [2019-10-13 21:55:56,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:55:56,342 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:55:56,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:55:56,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:55:56,343 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand 3 states. [2019-10-13 21:55:56,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:55:56,349 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2019-10-13 21:55:56,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:55:56,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-13 21:55:56,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:55:56,351 INFO L225 Difference]: With dead ends: 68 [2019-10-13 21:55:56,351 INFO L226 Difference]: Without dead ends: 66 [2019-10-13 21:55:56,351 INFO L600 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-10-13 21:55:56,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-13 21:55:56,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-10-13 21:55:56,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-13 21:55:56,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2019-10-13 21:55:56,362 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 22 [2019-10-13 21:55:56,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:55:56,362 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2019-10-13 21:55:56,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:55:56,362 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2019-10-13 21:55:56,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-13 21:55:56,366 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:55:56,366 INFO L380 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-10-13 21:55:56,366 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:55:56,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:55:56,367 INFO L82 PathProgramCache]: Analyzing trace with hash -2057575781, now seen corresponding path program 1 times [2019-10-13 21:55:56,367 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:55:56,367 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898864239] [2019-10-13 21:55:56,367 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:55:56,368 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:55:56,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:55:56,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:55:56,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:55:56,791 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898864239] [2019-10-13 21:55:56,792 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:55:56,792 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:55:56,796 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332032117] [2019-10-13 21:55:56,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:55:56,797 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:55:56,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:55:56,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:55:56,798 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand 9 states. [2019-10-13 21:55:57,164 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-10-13 21:55:57,285 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-10-13 21:55:57,463 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-10-13 21:55:57,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:55:57,759 INFO L93 Difference]: Finished difference Result 152 states and 165 transitions. [2019-10-13 21:55:57,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 21:55:57,764 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2019-10-13 21:55:57,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:55:57,767 INFO L225 Difference]: With dead ends: 152 [2019-10-13 21:55:57,767 INFO L226 Difference]: Without dead ends: 150 [2019-10-13 21:55:57,767 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2019-10-13 21:55:57,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-10-13 21:55:57,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 83. [2019-10-13 21:55:57,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-10-13 21:55:57,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions. [2019-10-13 21:55:57,786 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 24 [2019-10-13 21:55:57,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:55:57,787 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions. [2019-10-13 21:55:57,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:55:57,787 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2019-10-13 21:55:57,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-13 21:55:57,788 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:55:57,788 INFO L380 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-10-13 21:55:57,789 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:55:57,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:55:57,790 INFO L82 PathProgramCache]: Analyzing trace with hash 537268982, now seen corresponding path program 1 times [2019-10-13 21:55:57,790 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:55:57,790 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653754969] [2019-10-13 21:55:57,790 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:55:57,791 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:55:57,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:55:57,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:55:58,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:55:58,112 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653754969] [2019-10-13 21:55:58,113 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:55:58,113 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:55:58,113 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170077385] [2019-10-13 21:55:58,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:55:58,114 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:55:58,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:55:58,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:55:58,114 INFO L87 Difference]: Start difference. First operand 83 states and 92 transitions. Second operand 9 states. [2019-10-13 21:55:58,460 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-10-13 21:55:58,912 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-10-13 21:55:59,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:55:59,127 INFO L93 Difference]: Finished difference Result 161 states and 174 transitions. [2019-10-13 21:55:59,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 21:55:59,127 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2019-10-13 21:55:59,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:55:59,130 INFO L225 Difference]: With dead ends: 161 [2019-10-13 21:55:59,130 INFO L226 Difference]: Without dead ends: 159 [2019-10-13 21:55:59,131 INFO L600 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-10-13 21:55:59,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-10-13 21:55:59,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 90. [2019-10-13 21:55:59,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-10-13 21:55:59,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2019-10-13 21:55:59,139 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 27 [2019-10-13 21:55:59,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:55:59,139 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2019-10-13 21:55:59,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:55:59,139 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2019-10-13 21:55:59,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-13 21:55:59,140 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:55:59,140 INFO L380 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-10-13 21:55:59,141 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:55:59,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:55:59,141 INFO L82 PathProgramCache]: Analyzing trace with hash 272164207, now seen corresponding path program 1 times [2019-10-13 21:55:59,142 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:55:59,142 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401097537] [2019-10-13 21:55:59,142 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:55:59,142 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:55:59,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:55:59,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:55:59,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:55:59,174 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401097537] [2019-10-13 21:55:59,174 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:55:59,174 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:55:59,175 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899373962] [2019-10-13 21:55:59,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:55:59,175 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:55:59,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:55:59,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:55:59,176 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand 3 states. [2019-10-13 21:55:59,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:55:59,215 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2019-10-13 21:55:59,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:55:59,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-13 21:55:59,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:55:59,217 INFO L225 Difference]: With dead ends: 91 [2019-10-13 21:55:59,217 INFO L226 Difference]: Without dead ends: 89 [2019-10-13 21:55:59,217 INFO L600 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-10-13 21:55:59,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-10-13 21:55:59,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2019-10-13 21:55:59,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-10-13 21:55:59,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2019-10-13 21:55:59,224 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 27 [2019-10-13 21:55:59,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:55:59,225 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2019-10-13 21:55:59,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:55:59,225 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2019-10-13 21:55:59,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-13 21:55:59,226 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:55:59,226 INFO L380 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-10-13 21:55:59,227 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:55:59,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:55:59,227 INFO L82 PathProgramCache]: Analyzing trace with hash -841141344, now seen corresponding path program 1 times [2019-10-13 21:55:59,227 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:55:59,227 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417858578] [2019-10-13 21:55:59,228 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:55:59,228 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:55:59,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:55:59,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:55:59,320 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:55:59,320 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417858578] [2019-10-13 21:55:59,321 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139917026] [2019-10-13 21:55:59,321 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-10-13 21:55:59,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:55:59,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-13 21:55:59,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:55:59,496 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-10-13 21:55:59,496 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 21:55:59,512 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 21:55:59,518 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:55:59,520 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-10-13 21:55:59,521 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 21:55:59,533 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 21:55:59,537 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:55:59,539 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-10-13 21:55:59,539 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 21:55:59,550 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 21:55:59,550 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 21:55:59,550 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:42, output treesize:41 [2019-10-13 21:55:59,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:55:59,604 INFO L392 ElimStorePlain]: Different costs {0=[|v_#valid_32|], 1=[v_prenex_1]} [2019-10-13 21:55:59,618 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-10-13 21:55:59,619 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 21:55:59,832 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-10-13 21:55:59,833 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 21:55:59,863 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 21:55:59,864 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-10-13 21:55:59,865 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 21:56:00,019 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-10-13 21:56:00,019 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 21:56:00,025 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.base_50|, |v_#memory_$Pointer$.offset_50|], 26=[v_prenex_2, v_prenex_3]} [2019-10-13 21:56:00,038 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:56:00,041 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:56:00,043 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:56:00,059 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-10-13 21:56:00,060 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 21:56:00,224 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-10-13 21:56:00,224 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 21:56:00,231 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:56:00,234 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:56:00,237 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:56:00,250 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-10-13 21:56:00,250 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 21:56:00,516 WARN L191 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-10-13 21:56:00,516 INFO L567 ElimStorePlain]: treesize reduction 8, result has 98.2 percent of original size [2019-10-13 21:56:00,520 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:56:00,524 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:56:00,528 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:56:00,529 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:56:00,724 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-10-13 21:56:00,724 INFO L341 Elim1Store]: treesize reduction 226, result has 52.8 percent of original size [2019-10-13 21:56:00,725 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-10-13 21:56:00,727 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-13 21:56:00,878 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-10-13 21:56:00,879 INFO L567 ElimStorePlain]: treesize reduction 220, result has 50.0 percent of original size [2019-10-13 21:56:00,883 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:56:00,887 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:56:00,887 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:56:00,889 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:56:00,891 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:56:00,894 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 21:56:00,929 INFO L341 Elim1Store]: treesize reduction 18, result has 64.7 percent of original size [2019-10-13 21:56:00,930 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-10-13 21:56:00,931 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-13 21:56:01,055 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-10-13 21:56:01,056 INFO L567 ElimStorePlain]: treesize reduction 16, result has 89.5 percent of original size [2019-10-13 21:56:01,057 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-10-13 21:56:01,057 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:460, output treesize:152 [2019-10-13 21:56:01,395 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-10-13 21:56:01,396 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 21:56:01,404 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 21:56:01,407 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 21:56:01,408 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-10-13 21:56:01,408 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 21:56:01,412 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 21:56:01,412 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 21:56:01,412 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:7 [2019-10-13 21:56:01,421 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:56:01,421 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:56:01,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:56:01,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:56:01,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:56:03,523 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-10-13 21:56:03,565 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:56:03,569 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1914955543] [2019-10-13 21:56:03,600 INFO L162 IcfgInterpreter]: Started Sifa with 28 locations of interest [2019-10-13 21:56:03,600 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:56:03,606 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:56:03,613 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:56:03,614 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:56:03,687 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 24 for LOIs [2019-10-13 21:56:04,135 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:56:04,139 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:56:04,140 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:56:04,140 INFO L193 IcfgInterpreter]: Reachable states at location L1027-3 satisfy 252#(and (<= 1 main_~len~0) (<= main_~len~0 1) (= main_~len~0 1)) [2019-10-13 21:56:04,140 INFO L193 IcfgInterpreter]: Reachable states at location L995-14 satisfy 91#(and (= |#NULL.base| 0) (<= 0 |main_#t~malloc0.offset|) (<= |#NULL.base| 0) (<= 0 main_~list~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc0.offset| 0) (<= |main_#t~malloc0.offset| 0) (= |#NULL.offset| 0) (<= main_~list~0.offset 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:56:04,140 INFO L193 IcfgInterpreter]: Reachable states at location L995-15 satisfy 57#(and (= |#NULL.base| 0) (<= 0 |main_#t~malloc0.offset|) (<= |#NULL.base| 0) (<= 0 main_~list~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc0.offset| 0) (<= |main_#t~malloc0.offset| 0) (= |#NULL.offset| 0) (<= main_~list~0.offset 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:56:04,140 INFO L193 IcfgInterpreter]: Reachable states at location L995-16 satisfy 100#(and (= |#NULL.base| 0) (<= 0 |main_#t~malloc0.offset|) (<= |#NULL.base| 0) (<= 0 main_~list~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc0.offset| 0) (<= |main_#t~malloc0.offset| 0) (= |#NULL.offset| 0) (<= main_~list~0.offset 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:56:04,141 INFO L193 IcfgInterpreter]: Reachable states at location mainErr7ASSERT_VIOLATIONERROR_FUNCTION satisfy 305#(and (<= 1 main_~len~0) (<= main_~len~0 1) (= main_~len~0 1)) [2019-10-13 21:56:04,141 INFO L193 IcfgInterpreter]: Reachable states at location L1032-2 satisfy 238#(and (<= 0 main_~inner~0.offset) (<= main_~len~0 0) (<= main_~inner~0.base 0) (<= 0 main_~len~0) (<= 0 main_~inner~0.base) (or (and (= 0 main_~inner~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8)) main_~inner~0.offset) (= main_~len~0 0) (not (= main_~end~0.offset 0)) (<= main_~len~0 1) (= main_~inner~0.base 0) (= main_~inner~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))) (and (= 0 main_~inner~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8)) main_~inner~0.offset) (= main_~len~0 0) (not (= 0 main_~end~0.base)) (<= main_~len~0 1) (= main_~inner~0.base 0) (= main_~inner~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))))) (<= main_~inner~0.offset 0)) [2019-10-13 21:56:04,141 INFO L193 IcfgInterpreter]: Reachable states at location L1021-2 satisfy 228#(and (<= main_~len~0 0) (or (and (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8)) main_~inner~0.offset) (= main_~len~0 0) (not (= main_~end~0.offset 0)) (= main_~inner~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))) (and (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8)) main_~inner~0.offset) (= main_~len~0 0) (not (= 0 main_~end~0.base)) (= main_~inner~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))))) (<= 0 main_~len~0)) [2019-10-13 21:56:04,141 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:56:04,142 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-10-13 21:56:04,142 INFO L193 IcfgInterpreter]: Reachable states at location L1032-3 satisfy 233#(and (<= 0 main_~inner~0.offset) (<= main_~len~0 0) (<= main_~inner~0.base 0) (<= 0 main_~len~0) (<= 0 main_~inner~0.base) (or (and (= 0 main_~inner~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8)) main_~inner~0.offset) (= main_~len~0 0) (not (= main_~end~0.offset 0)) (= main_~inner~0.base 0) (= main_~inner~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))) (and (= 0 main_~inner~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8)) main_~inner~0.offset) (= main_~len~0 0) (not (= 0 main_~end~0.base)) (= main_~inner~0.base 0) (= main_~inner~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))))) (<= main_~inner~0.offset 0)) [2019-10-13 21:56:04,142 INFO L193 IcfgInterpreter]: Reachable states at location L1032-4 satisfy 243#(and (<= 0 main_~inner~0.offset) (<= main_~len~0 0) (<= main_~inner~0.base 0) (<= 0 main_~len~0) (<= 0 main_~inner~0.base) (or (and (= 0 main_~inner~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8)) main_~inner~0.offset) (= main_~len~0 0) (not (= main_~end~0.offset 0)) (<= main_~len~0 1) (= main_~inner~0.base 0) (= main_~inner~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))) (and (= 0 main_~inner~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8)) main_~inner~0.offset) (= main_~len~0 0) (not (= 0 main_~end~0.base)) (<= main_~len~0 1) (= main_~inner~0.base 0) (= main_~inner~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))))) (<= main_~inner~0.offset 0)) [2019-10-13 21:56:04,142 INFO L193 IcfgInterpreter]: Reachable states at location L1028 satisfy 279#(and (<= 1 main_~len~0) (<= main_~len~0 1) (= main_~len~0 1)) [2019-10-13 21:56:04,142 INFO L193 IcfgInterpreter]: Reachable states at location L1028-1 satisfy 292#(and (<= 1 main_~len~0) (<= main_~len~0 1) (= main_~len~0 1)) [2019-10-13 21:56:04,143 INFO L193 IcfgInterpreter]: Reachable states at location L1017-1 satisfy 223#true [2019-10-13 21:56:04,143 INFO L193 IcfgInterpreter]: Reachable states at location L995-3 satisfy 43#(and (<= 0 |main_#t~malloc0.offset|) (or (and (= 0 |#NULL.base|) (= (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0)) |#memory_$Pointer$.offset|) (= 0 |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 12)) (= 0 (select |old(#valid)| 0)) (not (= main_~list~0.offset 0)) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |main_#t~malloc0.base| main_~list~0.base) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= |#NULL.offset| 0) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0))) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|)) (and (= 0 |#NULL.base|) (= (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0)) |#memory_$Pointer$.offset|) (= 0 |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 12)) (= 0 (select |old(#valid)| 0)) (not (= 0 main_~list~0.base)) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |main_#t~malloc0.base| main_~list~0.base) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= |#NULL.offset| 0) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0))) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|))) (<= |#NULL.base| 0) (<= 0 main_~list~0.offset) (<= 0 |#NULL.base|) (<= |main_#t~malloc0.offset| 0) (<= main_~list~0.offset 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:56:04,143 INFO L193 IcfgInterpreter]: Reachable states at location L1028-4 satisfy 270#(and (<= 1 main_~len~0) (<= main_~len~0 1) (= main_~len~0 1)) [2019-10-13 21:56:04,143 INFO L193 IcfgInterpreter]: Reachable states at location L995-4 satisfy 38#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0)) |#memory_$Pointer$.offset|) (= 0 |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 12)) (<= 0 |#NULL.base|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_#t~malloc0.offset|) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |main_#t~malloc0.base| main_~list~0.base) (<= 0 main_~list~0.offset) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (<= |main_#t~malloc0.offset| 0) (not (= |main_#t~malloc0.base| 0)) (= |#NULL.offset| 0) (<= main_~list~0.offset 0) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0))) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|)) [2019-10-13 21:56:04,143 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 309#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:56:04,144 INFO L193 IcfgInterpreter]: Reachable states at location L1015-3 satisfy 149#(and (= |#NULL.base| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 main_~end~0.offset) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_#t~malloc0.offset|) (<= 0 main_~list~0.offset) (= |main_#t~malloc0.offset| 0) (<= main_~end~0.offset 0) (<= |main_#t~malloc0.offset| 0) (= |#NULL.offset| 0) (<= main_~list~0.offset 0)) [2019-10-13 21:56:04,144 INFO L193 IcfgInterpreter]: Reachable states at location L995-5 satisfy 48#(and (<= 0 |main_#t~malloc0.offset|) (or (and (= 0 |#NULL.base|) (= (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0)) |#memory_$Pointer$.offset|) (= 0 |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 12)) (= 0 (select |old(#valid)| 0)) (not (= main_~list~0.offset 0)) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |main_#t~malloc0.base| main_~list~0.base) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= |#NULL.offset| 0) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0))) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|)) (and (= 0 |#NULL.base|) (= (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0)) |#memory_$Pointer$.offset|) (= 0 |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 12)) (= 0 (select |old(#valid)| 0)) (not (= 0 main_~list~0.base)) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |main_#t~malloc0.base| main_~list~0.base) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= |#NULL.offset| 0) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0))) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|))) (<= |#NULL.base| 0) (<= 0 main_~list~0.offset) (<= 0 |#NULL.base|) (<= |main_#t~malloc0.offset| 0) (<= main_~list~0.offset 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:56:04,144 INFO L193 IcfgInterpreter]: Reachable states at location L1015-4 satisfy 136#(and (= |#NULL.base| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 main_~end~0.offset) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_#t~malloc0.offset|) (<= 0 main_~list~0.offset) (= |main_#t~malloc0.offset| 0) (<= main_~end~0.offset 0) (<= |main_#t~malloc0.offset| 0) (= |#NULL.offset| 0) (<= main_~list~0.offset 0)) [2019-10-13 21:56:04,144 INFO L193 IcfgInterpreter]: Reachable states at location L1000-1 satisfy 118#(and (= |#NULL.base| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 main_~end~0.offset) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_#t~malloc0.offset|) (<= |main_#t~nondet8| 2147483647) (<= 0 main_~list~0.offset) (= |main_#t~malloc0.offset| 0) (<= 0 (+ |main_#t~nondet8| 2147483648)) (<= main_~end~0.offset 0) (<= |main_#t~malloc0.offset| 0) (= |#NULL.offset| 0) (<= main_~list~0.offset 0)) [2019-10-13 21:56:04,145 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 314#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:56:04,145 INFO L193 IcfgInterpreter]: Reachable states at location L1000-3 satisfy 127#(and (= |#NULL.base| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 main_~end~0.offset) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_#t~malloc0.offset|) (<= 0 main_~list~0.offset) (= |main_#t~malloc0.offset| 0) (<= main_~end~0.offset 0) (<= |main_#t~malloc0.offset| 0) (= |#NULL.offset| 0) (<= main_~list~0.offset 0)) [2019-10-13 21:56:04,145 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:56:04,145 INFO L193 IcfgInterpreter]: Reachable states at location L995-11 satisfy 82#(and (= |#NULL.base| 0) (<= 0 |main_#t~malloc0.offset|) (<= |#NULL.base| 0) (<= 0 main_~list~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc0.offset| 0) (<= |main_#t~malloc0.offset| 0) (= |#NULL.offset| 0) (<= main_~list~0.offset 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:56:04,145 INFO L193 IcfgInterpreter]: Reachable states at location L1008-15 satisfy 109#(and (= |#NULL.base| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 main_~end~0.offset) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_#t~malloc0.offset|) (<= 0 main_~list~0.offset) (= |main_#t~malloc0.offset| 0) (<= main_~end~0.offset 0) (<= |main_#t~malloc0.offset| 0) (= |#NULL.offset| 0) (<= main_~list~0.offset 0)) [2019-10-13 21:56:04,146 INFO L193 IcfgInterpreter]: Reachable states at location L1027-2 satisfy 261#(and (<= 1 main_~len~0) (<= main_~len~0 1) (= main_~len~0 1)) [2019-10-13 21:56:04,482 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-10-13 21:56:05,035 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:56:05,035 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8, 12] total 26 [2019-10-13 21:56:05,035 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471340730] [2019-10-13 21:56:05,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-13 21:56:05,037 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:56:05,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-13 21:56:05,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=520, Unknown=1, NotChecked=46, Total=650 [2019-10-13 21:56:05,038 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand 26 states. [2019-10-13 21:56:16,574 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-10-13 21:56:16,929 WARN L191 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 84 [2019-10-13 21:56:17,271 WARN L191 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 90 [2019-10-13 21:56:17,853 WARN L191 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 93 [2019-10-13 21:56:18,218 WARN L191 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 88 [2019-10-13 21:56:18,542 WARN L191 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 80 [2019-10-13 21:56:18,861 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-10-13 21:56:19,133 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-10-13 21:56:19,751 WARN L191 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 86 [2019-10-13 21:56:20,402 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-10-13 21:56:20,729 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-10-13 21:56:20,922 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-10-13 21:56:21,560 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-10-13 21:56:21,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:56:21,596 INFO L93 Difference]: Finished difference Result 290 states and 318 transitions. [2019-10-13 21:56:21,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-13 21:56:21,597 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 29 [2019-10-13 21:56:21,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:56:21,599 INFO L225 Difference]: With dead ends: 290 [2019-10-13 21:56:21,599 INFO L226 Difference]: Without dead ends: 252 [2019-10-13 21:56:21,601 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 68 SyntacticMatches, 5 SemanticMatches, 53 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 811 ImplicationChecksByTransitivity, 18.6s TimeCoverageRelationStatistics Valid=481, Invalid=2384, Unknown=1, NotChecked=104, Total=2970 [2019-10-13 21:56:21,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2019-10-13 21:56:21,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 106. [2019-10-13 21:56:21,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-10-13 21:56:21,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2019-10-13 21:56:21,611 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 29 [2019-10-13 21:56:21,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:56:21,611 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2019-10-13 21:56:21,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-13 21:56:21,611 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2019-10-13 21:56:21,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-13 21:56:21,612 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:56:21,612 INFO L380 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-10-13 21:56:21,816 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:56:21,817 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:56:21,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:56:21,817 INFO L82 PathProgramCache]: Analyzing trace with hash -850180374, now seen corresponding path program 1 times [2019-10-13 21:56:21,818 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:56:21,818 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444775325] [2019-10-13 21:56:21,818 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:56:21,818 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:56:21,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:56:21,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:56:22,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:56:22,096 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444775325] [2019-10-13 21:56:22,096 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [309740139] [2019-10-13 21:56:22,096 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-10-13 21:56:22,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:56:22,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-13 21:56:22,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:56:22,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:56:22,310 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:56:22,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:56:22,383 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:56:22,383 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 7] total 13 [2019-10-13 21:56:22,383 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876907506] [2019-10-13 21:56:22,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:56:22,384 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:56:22,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:56:22,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:56:22,385 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand 6 states. [2019-10-13 21:56:22,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:56:22,629 INFO L93 Difference]: Finished difference Result 194 states and 221 transitions. [2019-10-13 21:56:22,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:56:22,630 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-10-13 21:56:22,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:56:22,631 INFO L225 Difference]: With dead ends: 194 [2019-10-13 21:56:22,631 INFO L226 Difference]: Without dead ends: 178 [2019-10-13 21:56:22,632 INFO L600 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-10-13 21:56:22,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-10-13 21:56:22,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 139. [2019-10-13 21:56:22,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-10-13 21:56:22,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 163 transitions. [2019-10-13 21:56:22,643 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 163 transitions. Word has length 30 [2019-10-13 21:56:22,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:56:22,644 INFO L462 AbstractCegarLoop]: Abstraction has 139 states and 163 transitions. [2019-10-13 21:56:22,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:56:22,644 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 163 transitions. [2019-10-13 21:56:22,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-13 21:56:22,648 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:56:22,649 INFO L380 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] [2019-10-13 21:56:22,857 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:56:22,858 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:56:22,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:56:22,858 INFO L82 PathProgramCache]: Analyzing trace with hash 729412443, now seen corresponding path program 1 times [2019-10-13 21:56:22,858 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:56:22,858 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316248604] [2019-10-13 21:56:22,858 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:56:22,858 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:56:22,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:56:22,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:56:22,967 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:56:22,968 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316248604] [2019-10-13 21:56:22,968 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512435030] [2019-10-13 21:56:22,968 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-10-13 21:56:23,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:56:23,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-13 21:56:23,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:56:23,141 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:56:23,141 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:56:23,209 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:56:23,209 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1284974232] [2019-10-13 21:56:23,211 INFO L162 IcfgInterpreter]: Started Sifa with 31 locations of interest [2019-10-13 21:56:23,211 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:56:23,212 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:56:23,212 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:56:23,212 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:56:23,246 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 24 for LOIs [2019-10-13 21:56:23,611 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:56:23,614 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:56:23,614 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:56:23,614 INFO L193 IcfgInterpreter]: Reachable states at location L995-14 satisfy 91#(and (= |#NULL.base| 0) (<= 0 |main_#t~malloc0.offset|) (<= |#NULL.base| 0) (<= 0 main_~list~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc0.offset| 0) (<= |main_#t~malloc0.offset| 0) (= |#NULL.offset| 0) (<= main_~list~0.offset 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:56:23,614 INFO L193 IcfgInterpreter]: Reachable states at location L1045 satisfy 311#true [2019-10-13 21:56:23,614 INFO L193 IcfgInterpreter]: Reachable states at location L995-15 satisfy 57#(and (= |#NULL.base| 0) (<= 0 |main_#t~malloc0.offset|) (<= |#NULL.base| 0) (<= 0 main_~list~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc0.offset| 0) (<= |main_#t~malloc0.offset| 0) (= |#NULL.offset| 0) (<= main_~list~0.offset 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:56:23,615 INFO L193 IcfgInterpreter]: Reachable states at location L1045-1 satisfy 324#true [2019-10-13 21:56:23,615 INFO L193 IcfgInterpreter]: Reachable states at location L995-16 satisfy 100#(and (= |#NULL.base| 0) (<= 0 |main_#t~malloc0.offset|) (<= |#NULL.base| 0) (<= 0 main_~list~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc0.offset| 0) (<= |main_#t~malloc0.offset| 0) (= |#NULL.offset| 0) (<= main_~list~0.offset 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:56:23,615 INFO L193 IcfgInterpreter]: Reachable states at location mainErr11ASSERT_VIOLATIONERROR_FUNCTION satisfy 337#true [2019-10-13 21:56:23,615 INFO L193 IcfgInterpreter]: Reachable states at location L1045-4 satisfy 302#true [2019-10-13 21:56:23,615 INFO L193 IcfgInterpreter]: Reachable states at location L1032-2 satisfy 238#(and (<= 0 main_~inner~0.offset) (<= main_~len~0 0) (<= main_~inner~0.base 0) (<= 0 main_~len~0) (<= 0 main_~inner~0.base) (or (and (= 0 main_~inner~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8)) main_~inner~0.offset) (= main_~len~0 0) (not (= main_~end~0.offset 0)) (<= main_~len~0 1) (= main_~inner~0.base 0) (= main_~inner~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))) (and (= 0 main_~inner~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8)) main_~inner~0.offset) (= main_~len~0 0) (not (= 0 main_~end~0.base)) (<= main_~len~0 1) (= main_~inner~0.base 0) (= main_~inner~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))))) (<= main_~inner~0.offset 0)) [2019-10-13 21:56:23,616 INFO L193 IcfgInterpreter]: Reachable states at location L1021-2 satisfy 228#(and (<= main_~len~0 0) (or (and (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8)) main_~inner~0.offset) (= main_~len~0 0) (not (= main_~end~0.offset 0)) (= main_~inner~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))) (and (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8)) main_~inner~0.offset) (= main_~len~0 0) (not (= 0 main_~end~0.base)) (= main_~inner~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))))) (<= 0 main_~len~0)) [2019-10-13 21:56:23,616 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:56:23,616 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-10-13 21:56:23,616 INFO L193 IcfgInterpreter]: Reachable states at location L1032-3 satisfy 233#(and (<= 0 main_~inner~0.offset) (<= main_~len~0 0) (<= main_~inner~0.base 0) (<= 0 main_~len~0) (<= 0 main_~inner~0.base) (or (and (= 0 main_~inner~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8)) main_~inner~0.offset) (= main_~len~0 0) (not (= main_~end~0.offset 0)) (= main_~inner~0.base 0) (= main_~inner~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))) (and (= 0 main_~inner~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8)) main_~inner~0.offset) (= main_~len~0 0) (not (= 0 main_~end~0.base)) (= main_~inner~0.base 0) (= main_~inner~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))))) (<= main_~inner~0.offset 0)) [2019-10-13 21:56:23,616 INFO L193 IcfgInterpreter]: Reachable states at location L1032-4 satisfy 243#(and (<= 0 main_~inner~0.offset) (<= main_~len~0 0) (<= main_~inner~0.base 0) (<= 0 main_~len~0) (<= 0 main_~inner~0.base) (or (and (= 0 main_~inner~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8)) main_~inner~0.offset) (= main_~len~0 0) (not (= main_~end~0.offset 0)) (<= main_~len~0 1) (= main_~inner~0.base 0) (= main_~inner~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))) (and (= 0 main_~inner~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8)) main_~inner~0.offset) (= main_~len~0 0) (not (= 0 main_~end~0.base)) (<= main_~len~0 1) (= main_~inner~0.base 0) (= main_~inner~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))))) (<= main_~inner~0.offset 0)) [2019-10-13 21:56:23,616 INFO L193 IcfgInterpreter]: Reachable states at location L1017-1 satisfy 223#true [2019-10-13 21:56:23,617 INFO L193 IcfgInterpreter]: Reachable states at location L995-3 satisfy 43#(and (<= 0 |main_#t~malloc0.offset|) (or (and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0)) |#memory_$Pointer$.offset|) (= 0 |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 12)) (= 0 (select |old(#valid)| 0)) (not (= 0 main_~list~0.base)) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |main_#t~malloc0.base| main_~list~0.base) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= |#NULL.offset| 0) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0)))) (and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0)) |#memory_$Pointer$.offset|) (= 0 |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 12)) (= 0 (select |old(#valid)| 0)) (not (= main_~list~0.offset 0)) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |main_#t~malloc0.base| main_~list~0.base) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= |#NULL.offset| 0) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0))))) (<= 0 main_~list~0.offset) (<= 0 |#NULL.base|) (<= |main_#t~malloc0.offset| 0) (<= main_~list~0.offset 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:56:23,617 INFO L193 IcfgInterpreter]: Reachable states at location L995-4 satisfy 38#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0)) |#memory_$Pointer$.offset|) (= 0 |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 12)) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |main_#t~malloc0.offset|) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |main_#t~malloc0.base| main_~list~0.base) (<= 0 main_~list~0.offset) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (<= |main_#t~malloc0.offset| 0) (not (= |main_#t~malloc0.base| 0)) (= |#NULL.offset| 0) (<= main_~list~0.offset 0) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0)))) [2019-10-13 21:56:23,617 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 346#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:56:23,617 INFO L193 IcfgInterpreter]: Reachable states at location L1015-3 satisfy 149#(and (= |#NULL.base| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 main_~end~0.offset) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_#t~malloc0.offset|) (<= 0 main_~list~0.offset) (= |main_#t~malloc0.offset| 0) (<= main_~end~0.offset 0) (<= |main_#t~malloc0.offset| 0) (= |#NULL.offset| 0) (<= main_~list~0.offset 0)) [2019-10-13 21:56:23,617 INFO L193 IcfgInterpreter]: Reachable states at location L995-5 satisfy 48#(and (<= 0 |main_#t~malloc0.offset|) (or (and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0)) |#memory_$Pointer$.offset|) (= 0 |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 12)) (= 0 (select |old(#valid)| 0)) (not (= 0 main_~list~0.base)) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |main_#t~malloc0.base| main_~list~0.base) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= |#NULL.offset| 0) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0)))) (and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0)) |#memory_$Pointer$.offset|) (= 0 |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 12)) (= 0 (select |old(#valid)| 0)) (not (= main_~list~0.offset 0)) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |main_#t~malloc0.base| main_~list~0.base) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= |#NULL.offset| 0) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0))))) (<= 0 main_~list~0.offset) (<= 0 |#NULL.base|) (<= |main_#t~malloc0.offset| 0) (<= main_~list~0.offset 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:56:23,618 INFO L193 IcfgInterpreter]: Reachable states at location L1015-4 satisfy 136#(and (= |#NULL.base| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 main_~end~0.offset) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_#t~malloc0.offset|) (<= 0 main_~list~0.offset) (= |main_#t~malloc0.offset| 0) (<= main_~end~0.offset 0) (<= |main_#t~malloc0.offset| 0) (= |#NULL.offset| 0) (<= main_~list~0.offset 0)) [2019-10-13 21:56:23,618 INFO L193 IcfgInterpreter]: Reachable states at location L1042 satisfy 275#(or (and (not (= main_~list~0.offset 0)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8)))) (and (not (= 0 main_~list~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))) [2019-10-13 21:56:23,618 INFO L193 IcfgInterpreter]: Reachable states at location L1000-1 satisfy 118#(and (= |#NULL.base| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 main_~end~0.offset) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_#t~malloc0.offset|) (<= |main_#t~nondet8| 2147483647) (<= 0 main_~list~0.offset) (= |main_#t~malloc0.offset| 0) (<= 0 (+ |main_#t~nondet8| 2147483648)) (<= main_~end~0.offset 0) (<= |main_#t~malloc0.offset| 0) (= |#NULL.offset| 0) (<= main_~list~0.offset 0)) [2019-10-13 21:56:23,618 INFO L193 IcfgInterpreter]: Reachable states at location L1044-3 satisfy 293#true [2019-10-13 21:56:23,618 INFO L193 IcfgInterpreter]: Reachable states at location L1042-2 satisfy 342#(and (or (and (= 0 main_~end~0.base) (not (= main_~list~0.offset 0)) (= main_~end~0.offset 0) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8)))) (and (= 0 main_~end~0.base) (not (= 0 main_~list~0.base)) (= main_~end~0.offset 0) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))) (<= 0 main_~end~0.base) (<= 0 main_~end~0.offset) (<= main_~end~0.offset 0) (<= main_~end~0.base 0)) [2019-10-13 21:56:23,622 INFO L193 IcfgInterpreter]: Reachable states at location L1044-4 satisfy 284#true [2019-10-13 21:56:23,623 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 351#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:56:23,624 INFO L193 IcfgInterpreter]: Reachable states at location L1000-3 satisfy 127#(and (= |#NULL.base| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 main_~end~0.offset) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_#t~malloc0.offset|) (<= 0 main_~list~0.offset) (= |main_#t~malloc0.offset| 0) (<= main_~end~0.offset 0) (<= |main_#t~malloc0.offset| 0) (= |#NULL.offset| 0) (<= main_~list~0.offset 0)) [2019-10-13 21:56:23,624 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:56:23,624 INFO L193 IcfgInterpreter]: Reachable states at location L995-11 satisfy 82#(and (= |#NULL.base| 0) (<= 0 |main_#t~malloc0.offset|) (<= |#NULL.base| 0) (<= 0 main_~list~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc0.offset| 0) (<= |main_#t~malloc0.offset| 0) (= |#NULL.offset| 0) (<= main_~list~0.offset 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:56:23,624 INFO L193 IcfgInterpreter]: Reachable states at location L1038-1 satisfy 270#(or (exists ((v_prenex_18 Int) (v_prenex_17 Int) (v_main_~list~0.base_24 Int) (v_main_~list~0.offset_24 Int)) (or (and (= main_~list~0.offset main_~end~0.offset) (= (select (select |#memory_$Pointer$.base| v_main_~list~0.base_24) v_main_~list~0.offset_24) main_~end~0.base) (= (select |#valid| v_main_~list~0.base_24) 0) (= main_~list~0.base main_~end~0.base) (not (= 0 v_main_~list~0.base_24)) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| v_main_~list~0.base_24) v_main_~list~0.offset_24)) (= 0 (select (select |#memory_$Pointer$.offset| v_main_~list~0.base_24) (+ v_main_~list~0.offset_24 8))) (= (select (select |#memory_$Pointer$.base| v_main_~list~0.base_24) (+ v_main_~list~0.offset_24 8)) 0)) (and (= main_~list~0.offset main_~end~0.offset) (= (select (select |#memory_$Pointer$.base| v_prenex_17) v_prenex_18) main_~end~0.base) (= (select |#valid| v_prenex_17) 0) (= main_~list~0.base main_~end~0.base) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| v_prenex_17) v_prenex_18)) (= 0 (select (select |#memory_$Pointer$.offset| v_prenex_17) (+ v_prenex_18 8))) (= (select (select |#memory_$Pointer$.base| v_prenex_17) (+ v_prenex_18 8)) 0) (not (= 0 v_prenex_18))))) (and (= 0 main_~end~0.base) (= main_~end~0.offset 0))) [2019-10-13 21:56:23,624 INFO L193 IcfgInterpreter]: Reachable states at location L1008-15 satisfy 109#(and (= |#NULL.base| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 main_~end~0.offset) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_#t~malloc0.offset|) (<= 0 main_~list~0.offset) (= |main_#t~malloc0.offset| 0) (<= main_~end~0.offset 0) (<= |main_#t~malloc0.offset| 0) (= |#NULL.offset| 0) (<= main_~list~0.offset 0)) [2019-10-13 21:56:23,879 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-10-13 21:56:24,464 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:56:24,464 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 14] total 21 [2019-10-13 21:56:24,465 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378656995] [2019-10-13 21:56:24,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-13 21:56:24,466 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:56:24,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-13 21:56:24,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-10-13 21:56:24,467 INFO L87 Difference]: Start difference. First operand 139 states and 163 transitions. Second operand 21 states. [2019-10-13 21:56:25,277 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2019-10-13 21:56:27,001 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2019-10-13 21:56:27,205 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2019-10-13 21:56:27,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:56:27,981 INFO L93 Difference]: Finished difference Result 303 states and 347 transitions. [2019-10-13 21:56:27,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-10-13 21:56:27,982 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 33 [2019-10-13 21:56:27,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:56:27,984 INFO L225 Difference]: With dead ends: 303 [2019-10-13 21:56:27,984 INFO L226 Difference]: Without dead ends: 274 [2019-10-13 21:56:27,985 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 90 SyntacticMatches, 5 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 823 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=450, Invalid=2412, Unknown=0, NotChecked=0, Total=2862 [2019-10-13 21:56:27,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-10-13 21:56:27,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 173. [2019-10-13 21:56:27,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-10-13 21:56:27,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 205 transitions. [2019-10-13 21:56:27,996 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 205 transitions. Word has length 33 [2019-10-13 21:56:27,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:56:27,996 INFO L462 AbstractCegarLoop]: Abstraction has 173 states and 205 transitions. [2019-10-13 21:56:27,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-13 21:56:27,997 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 205 transitions. [2019-10-13 21:56:28,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-13 21:56:28,003 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:56:28,003 INFO L380 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, 1] [2019-10-13 21:56:28,207 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:56:28,208 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:56:28,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:56:28,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1665686661, now seen corresponding path program 1 times [2019-10-13 21:56:28,209 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:56:28,209 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949082319] [2019-10-13 21:56:28,210 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:56:28,210 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:56:28,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:56:28,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:56:28,684 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 37 [2019-10-13 21:56:28,957 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:56:28,957 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949082319] [2019-10-13 21:56:28,957 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172908375] [2019-10-13 21:56:28,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:56:29,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:56:29,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 42 conjunts are in the unsatisfiable core [2019-10-13 21:56:29,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:56:29,491 WARN L191 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2019-10-13 21:56:29,771 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-10-13 21:56:29,970 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2019-10-13 21:56:30,864 WARN L191 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 76 [2019-10-13 21:56:31,583 WARN L191 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-10-13 21:56:31,784 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-10-13 21:56:32,074 WARN L191 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2019-10-13 21:56:32,424 WARN L191 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 83