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-rb-sentinel-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 03:48:23,035 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 03:48:23,037 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 03:48:23,051 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 03:48:23,051 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 03:48:23,052 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 03:48:23,054 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 03:48:23,056 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 03:48:23,058 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 03:48:23,059 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 03:48:23,060 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 03:48:23,061 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 03:48:23,061 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 03:48:23,062 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 03:48:23,063 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 03:48:23,064 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 03:48:23,065 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 03:48:23,066 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 03:48:23,068 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 03:48:23,070 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 03:48:23,072 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 03:48:23,073 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 03:48:23,074 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 03:48:23,075 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 03:48:23,077 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 03:48:23,078 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 03:48:23,078 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 03:48:23,079 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 03:48:23,079 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 03:48:23,080 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 03:48:23,081 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 03:48:23,081 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 03:48:23,084 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 03:48:23,085 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 03:48:23,086 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 03:48:23,086 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 03:48:23,087 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 03:48:23,087 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 03:48:23,089 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 03:48:23,090 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 03:48:23,091 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 03:48:23,092 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-07 03:48:23,115 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 03:48:23,115 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 03:48:23,118 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 03:48:23,118 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 03:48:23,118 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 03:48:23,118 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 03:48:23,119 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 03:48:23,119 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 03:48:23,119 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 03:48:23,119 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 03:48:23,120 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 03:48:23,121 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 03:48:23,121 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 03:48:23,121 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 03:48:23,121 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 03:48:23,122 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 03:48:23,122 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 03:48:23,122 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 03:48:23,122 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 03:48:23,123 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 03:48:23,123 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 03:48:23,123 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 03:48:23,124 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 03:48:23,124 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 03:48:23,124 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 03:48:23,124 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 03:48:23,124 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 03:48:23,125 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 03:48:23,125 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-07 03:48:23,440 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 03:48:23,453 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 03:48:23,457 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 03:48:23,458 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 03:48:23,459 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 03:48:23,459 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-rb-sentinel-2.i [2019-10-07 03:48:23,521 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6902a336/fa36a2c8c1034bd781317188f62d1d6c/FLAGe22f31536 [2019-10-07 03:48:24,065 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 03:48:24,065 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-rb-sentinel-2.i [2019-10-07 03:48:24,079 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6902a336/fa36a2c8c1034bd781317188f62d1d6c/FLAGe22f31536 [2019-10-07 03:48:24,359 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6902a336/fa36a2c8c1034bd781317188f62d1d6c [2019-10-07 03:48:24,373 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 03:48:24,375 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 03:48:24,378 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 03:48:24,378 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 03:48:24,381 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 03:48:24,381 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:48:24" (1/1) ... [2019-10-07 03:48:24,384 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11498c8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:48:24, skipping insertion in model container [2019-10-07 03:48:24,384 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:48:24" (1/1) ... [2019-10-07 03:48:24,391 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 03:48:24,438 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 03:48:24,909 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 03:48:24,922 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 03:48:24,974 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 03:48:25,043 INFO L192 MainTranslator]: Completed translation [2019-10-07 03:48:25,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:48:25 WrapperNode [2019-10-07 03:48:25,043 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 03:48:25,044 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 03:48:25,044 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 03:48:25,044 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 03:48:25,059 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:48:25" (1/1) ... [2019-10-07 03:48:25,059 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:48:25" (1/1) ... [2019-10-07 03:48:25,081 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:48:25" (1/1) ... [2019-10-07 03:48:25,081 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:48:25" (1/1) ... [2019-10-07 03:48:25,101 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:48:25" (1/1) ... [2019-10-07 03:48:25,113 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:48:25" (1/1) ... [2019-10-07 03:48:25,119 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:48:25" (1/1) ... [2019-10-07 03:48:25,126 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 03:48:25,127 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 03:48:25,127 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 03:48:25,127 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 03:48:25,128 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:48:25" (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-07 03:48:25,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 03:48:25,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 03:48:25,200 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 03:48:25,200 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-07 03:48:25,201 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-07 03:48:25,201 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-07 03:48:25,201 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-07 03:48:25,201 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-07 03:48:25,201 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-07 03:48:25,201 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-07 03:48:25,202 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-07 03:48:25,202 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-07 03:48:25,202 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-07 03:48:25,202 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-07 03:48:25,202 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-07 03:48:25,203 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-07 03:48:25,203 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-07 03:48:25,203 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-07 03:48:25,203 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-07 03:48:25,203 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-07 03:48:25,203 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-07 03:48:25,204 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-07 03:48:25,204 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-07 03:48:25,204 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-07 03:48:25,204 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-07 03:48:25,204 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-07 03:48:25,204 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-07 03:48:25,205 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-07 03:48:25,205 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-07 03:48:25,205 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-07 03:48:25,205 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-07 03:48:25,205 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-07 03:48:25,205 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-07 03:48:25,205 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-07 03:48:25,206 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-07 03:48:25,206 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-07 03:48:25,206 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-07 03:48:25,206 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-07 03:48:25,206 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-07 03:48:25,207 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-07 03:48:25,207 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-07 03:48:25,207 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-07 03:48:25,207 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-07 03:48:25,207 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-07 03:48:25,207 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-07 03:48:25,207 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-07 03:48:25,207 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-07 03:48:25,207 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-07 03:48:25,207 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-07 03:48:25,207 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-07 03:48:25,208 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-07 03:48:25,208 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-07 03:48:25,208 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-07 03:48:25,208 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-07 03:48:25,208 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-07 03:48:25,208 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-07 03:48:25,208 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-07 03:48:25,208 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-07 03:48:25,208 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-07 03:48:25,209 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-07 03:48:25,209 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-07 03:48:25,209 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-07 03:48:25,209 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-07 03:48:25,209 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-07 03:48:25,209 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-07 03:48:25,209 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-07 03:48:25,210 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-07 03:48:25,210 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-07 03:48:25,210 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-07 03:48:25,210 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-07 03:48:25,210 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-07 03:48:25,210 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-07 03:48:25,210 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-07 03:48:25,211 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-07 03:48:25,211 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-07 03:48:25,211 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-07 03:48:25,211 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-07 03:48:25,211 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-07 03:48:25,211 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-07 03:48:25,211 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-07 03:48:25,212 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-07 03:48:25,212 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-07 03:48:25,212 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-07 03:48:25,212 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-07 03:48:25,212 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-07 03:48:25,212 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-07 03:48:25,213 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-07 03:48:25,213 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-07 03:48:25,213 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-07 03:48:25,213 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-07 03:48:25,213 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-07 03:48:25,213 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-07 03:48:25,213 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-07 03:48:25,214 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-07 03:48:25,214 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-07 03:48:25,214 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-07 03:48:25,214 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-07 03:48:25,214 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-07 03:48:25,214 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-07 03:48:25,214 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-07 03:48:25,214 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-07 03:48:25,214 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-07 03:48:25,215 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-07 03:48:25,215 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-07 03:48:25,215 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-07 03:48:25,215 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-07 03:48:25,215 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 03:48:25,215 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 03:48:25,215 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 03:48:25,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-07 03:48:25,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-07 03:48:25,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 03:48:25,215 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-07 03:48:25,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 03:48:25,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 03:48:25,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 03:48:25,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 03:48:26,107 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 03:48:26,108 INFO L284 CfgBuilder]: Removed 17 assume(true) statements. [2019-10-07 03:48:26,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:48:26 BoogieIcfgContainer [2019-10-07 03:48:26,109 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 03:48:26,111 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 03:48:26,111 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 03:48:26,114 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 03:48:26,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 03:48:24" (1/3) ... [2019-10-07 03:48:26,116 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27487a6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:48:26, skipping insertion in model container [2019-10-07 03:48:26,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:48:25" (2/3) ... [2019-10-07 03:48:26,116 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27487a6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:48:26, skipping insertion in model container [2019-10-07 03:48:26,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:48:26" (3/3) ... [2019-10-07 03:48:26,118 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel-2.i [2019-10-07 03:48:26,129 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 03:48:26,137 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-10-07 03:48:26,149 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-10-07 03:48:26,176 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 03:48:26,176 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 03:48:26,177 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 03:48:26,177 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 03:48:26,177 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 03:48:26,177 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 03:48:26,178 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 03:48:26,178 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 03:48:26,196 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-10-07 03:48:26,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-10-07 03:48:26,202 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:48:26,203 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:48:26,205 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:48:26,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:48:26,212 INFO L82 PathProgramCache]: Analyzing trace with hash 299738079, now seen corresponding path program 1 times [2019-10-07 03:48:26,221 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:48:26,222 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:26,222 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:26,222 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:26,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:48:26,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:48:26,408 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-07 03:48:26,409 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:26,409 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:48:26,410 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-07 03:48:26,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-07 03:48:26,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-07 03:48:26,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-07 03:48:26,436 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 2 states. [2019-10-07 03:48:26,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:48:26,472 INFO L93 Difference]: Finished difference Result 89 states and 139 transitions. [2019-10-07 03:48:26,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-07 03:48:26,474 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2019-10-07 03:48:26,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:48:26,487 INFO L225 Difference]: With dead ends: 89 [2019-10-07 03:48:26,487 INFO L226 Difference]: Without dead ends: 43 [2019-10-07 03:48:26,490 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-07 03:48:26,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-07 03:48:26,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-10-07 03:48:26,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-07 03:48:26,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2019-10-07 03:48:26,526 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 9 [2019-10-07 03:48:26,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:48:26,527 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2019-10-07 03:48:26,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-07 03:48:26,527 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2019-10-07 03:48:26,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-07 03:48:26,528 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:48:26,528 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:48:26,528 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:48:26,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:48:26,529 INFO L82 PathProgramCache]: Analyzing trace with hash 644598331, now seen corresponding path program 1 times [2019-10-07 03:48:26,529 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:48:26,529 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:26,530 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:26,530 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:26,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:48:26,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:48:26,786 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-07 03:48:26,787 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:26,787 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:48:26,787 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 03:48:26,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 03:48:26,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 03:48:26,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 03:48:26,790 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 4 states. [2019-10-07 03:48:27,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:48:27,141 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2019-10-07 03:48:27,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 03:48:27,142 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-10-07 03:48:27,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:48:27,143 INFO L225 Difference]: With dead ends: 43 [2019-10-07 03:48:27,143 INFO L226 Difference]: Without dead ends: 41 [2019-10-07 03:48:27,144 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-07 03:48:27,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-07 03:48:27,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-10-07 03:48:27,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-07 03:48:27,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2019-10-07 03:48:27,155 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 10 [2019-10-07 03:48:27,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:48:27,157 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2019-10-07 03:48:27,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 03:48:27,157 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2019-10-07 03:48:27,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-07 03:48:27,158 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:48:27,158 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:48:27,158 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:48:27,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:48:27,159 INFO L82 PathProgramCache]: Analyzing trace with hash 639051341, now seen corresponding path program 1 times [2019-10-07 03:48:27,159 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:48:27,159 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:27,160 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:27,160 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:27,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:48:27,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:48:27,249 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-07 03:48:27,251 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:27,252 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:48:27,252 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 03:48:27,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 03:48:27,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 03:48:27,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 03:48:27,255 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 4 states. [2019-10-07 03:48:27,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:48:27,390 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2019-10-07 03:48:27,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 03:48:27,391 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-10-07 03:48:27,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:48:27,392 INFO L225 Difference]: With dead ends: 47 [2019-10-07 03:48:27,392 INFO L226 Difference]: Without dead ends: 45 [2019-10-07 03:48:27,393 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-07 03:48:27,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-07 03:48:27,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2019-10-07 03:48:27,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-07 03:48:27,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2019-10-07 03:48:27,399 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 10 [2019-10-07 03:48:27,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:48:27,399 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2019-10-07 03:48:27,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 03:48:27,400 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2019-10-07 03:48:27,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-07 03:48:27,400 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:48:27,400 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:48:27,401 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:48:27,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:48:27,401 INFO L82 PathProgramCache]: Analyzing trace with hash 434039850, now seen corresponding path program 1 times [2019-10-07 03:48:27,402 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:48:27,402 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:27,402 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:27,402 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:27,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:48:27,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:48:27,539 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-07 03:48:27,539 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:27,540 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:48:27,540 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 03:48:27,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 03:48:27,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 03:48:27,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 03:48:27,541 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 4 states. [2019-10-07 03:48:27,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:48:27,736 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2019-10-07 03:48:27,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 03:48:27,738 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-10-07 03:48:27,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:48:27,739 INFO L225 Difference]: With dead ends: 39 [2019-10-07 03:48:27,739 INFO L226 Difference]: Without dead ends: 37 [2019-10-07 03:48:27,739 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-07 03:48:27,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-10-07 03:48:27,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-10-07 03:48:27,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-07 03:48:27,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2019-10-07 03:48:27,744 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 13 [2019-10-07 03:48:27,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:48:27,745 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2019-10-07 03:48:27,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 03:48:27,745 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2019-10-07 03:48:27,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-07 03:48:27,746 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:48:27,746 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:48:27,746 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:48:27,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:48:27,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1607525391, now seen corresponding path program 1 times [2019-10-07 03:48:27,747 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:48:27,747 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:27,747 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:27,748 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:27,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:48:27,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:48:27,883 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-07 03:48:27,883 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:27,884 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:48:27,884 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 03:48:27,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 03:48:27,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 03:48:27,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-07 03:48:27,888 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 6 states. [2019-10-07 03:48:28,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:48:28,246 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2019-10-07 03:48:28,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 03:48:28,246 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-10-07 03:48:28,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:48:28,247 INFO L225 Difference]: With dead ends: 62 [2019-10-07 03:48:28,247 INFO L226 Difference]: Without dead ends: 60 [2019-10-07 03:48:28,248 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-07 03:48:28,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-07 03:48:28,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 44. [2019-10-07 03:48:28,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-07 03:48:28,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2019-10-07 03:48:28,255 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 13 [2019-10-07 03:48:28,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:48:28,256 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2019-10-07 03:48:28,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 03:48:28,256 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2019-10-07 03:48:28,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-07 03:48:28,257 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:48:28,257 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:48:28,257 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:48:28,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:48:28,258 INFO L82 PathProgramCache]: Analyzing trace with hash 500595918, now seen corresponding path program 1 times [2019-10-07 03:48:28,258 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:48:28,258 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:28,258 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:28,258 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:28,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:48:28,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:48:28,403 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-07 03:48:28,403 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:28,403 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:48:28,404 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 03:48:28,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 03:48:28,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 03:48:28,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 03:48:28,405 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 4 states. [2019-10-07 03:48:28,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:48:28,507 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2019-10-07 03:48:28,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 03:48:28,509 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-10-07 03:48:28,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:48:28,510 INFO L225 Difference]: With dead ends: 44 [2019-10-07 03:48:28,510 INFO L226 Difference]: Without dead ends: 42 [2019-10-07 03:48:28,510 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-07 03:48:28,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-07 03:48:28,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-10-07 03:48:28,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-07 03:48:28,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2019-10-07 03:48:28,516 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 15 [2019-10-07 03:48:28,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:48:28,517 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2019-10-07 03:48:28,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 03:48:28,517 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2019-10-07 03:48:28,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-07 03:48:28,518 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:48:28,518 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:48:28,518 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:48:28,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:48:28,519 INFO L82 PathProgramCache]: Analyzing trace with hash -2116307816, now seen corresponding path program 1 times [2019-10-07 03:48:28,519 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:48:28,519 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:28,519 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:28,520 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:28,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:48:28,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:48:28,636 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-07 03:48:28,637 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:28,637 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:48:28,637 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 03:48:28,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 03:48:28,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 03:48:28,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 03:48:28,638 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 5 states. [2019-10-07 03:48:28,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:48:28,901 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2019-10-07 03:48:28,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 03:48:28,901 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-10-07 03:48:28,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:48:28,902 INFO L225 Difference]: With dead ends: 57 [2019-10-07 03:48:28,902 INFO L226 Difference]: Without dead ends: 45 [2019-10-07 03:48:28,903 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-07 03:48:28,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-07 03:48:28,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-10-07 03:48:28,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-07 03:48:28,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2019-10-07 03:48:28,908 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 17 [2019-10-07 03:48:28,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:48:28,909 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2019-10-07 03:48:28,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 03:48:28,909 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2019-10-07 03:48:28,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-07 03:48:28,910 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:48:28,910 INFO L385 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:48:28,910 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:48:28,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:48:28,911 INFO L82 PathProgramCache]: Analyzing trace with hash 17922409, now seen corresponding path program 1 times [2019-10-07 03:48:28,911 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:48:28,911 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:28,911 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:28,911 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:28,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:48:28,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:48:28,973 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-07 03:48:28,974 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:28,974 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 03:48:28,974 INFO L95 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-07 03:48:29,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:48:29,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-07 03:48:29,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 03:48:29,145 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 03:48:29,146 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 03:48:29,147 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 03:48:29,160 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2019-10-07 03:48:29,161 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 03:48:29,177 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:29,190 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 03:48:29,191 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 03:48:29,192 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 03:48:29,193 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2019-10-07 03:48:29,194 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-07 03:48:29,203 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:29,204 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-07 03:48:29,204 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-10-07 03:48:29,261 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 03:48:29,263 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 24 treesize of output 10 [2019-10-07 03:48:29,264 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 03:48:29,274 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:29,279 INFO L341 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-10-07 03:48:29,279 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 10 [2019-10-07 03:48:29,280 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-07 03:48:29,285 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:29,286 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-07 03:48:29,286 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:7 [2019-10-07 03:48:29,302 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-07 03:48:29,302 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 03:48:29,354 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-07 03:48:29,354 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 03:48:29,381 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-07 03:48:29,381 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 03:48:29,387 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 03:48:29,395 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 03:48:29,396 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 03:48:29,509 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-07 03:48:29,925 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 03:48:29,931 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 03:48:29,931 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 03:48:29,932 INFO L193 IcfgInterpreter]: Reachable states at location L1038-4 satisfy 53#(exists ((v_DerPreprocessor_6 Int) (v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int)) (and (= |#memory_$Pointer$.offset| (store (store |old(#memory_$Pointer$.offset)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_5)) main_~list~0.base (store (store (store (select (store |old(#memory_$Pointer$.offset)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_5)) main_~list~0.base) main_~list~0.offset main_~null~0.offset) (+ main_~list~0.offset 4) main_~null~0.offset) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))) (= 0 |#NULL.base|) (= main_~list~0.base main_~end~0.base) (= 0 |main_#t~malloc0.offset|) (= |main_#t~malloc1.offset| 0) (= |main_#t~malloc1.base| main_~list~0.base) (<= 0 |#NULL.base|) (= (store (store |old(#memory_int)| main_~null~0.base (store (store (store (select |old(#memory_int)| main_~null~0.base) main_~null~0.offset v_DerPreprocessor_1) (+ main_~null~0.offset 4) v_DerPreprocessor_4) (+ main_~null~0.offset 8) ~unnamed1~0~BLACK)) main_~list~0.base (store (store (store (select (store |old(#memory_int)| main_~null~0.base (store (store (store (select |old(#memory_int)| main_~null~0.base) main_~null~0.offset v_DerPreprocessor_1) (+ main_~null~0.offset 4) v_DerPreprocessor_4) (+ main_~null~0.offset 8) ~unnamed1~0~BLACK)) main_~list~0.base) main_~list~0.offset v_DerPreprocessor_3) (+ main_~list~0.offset 4) v_DerPreprocessor_2) (+ main_~list~0.offset 8) ~unnamed1~0~BLACK)) |#memory_int|) (<= 0 |#NULL.offset|) (= (select (store |old(#valid)| |main_#t~malloc0.base| 1) |main_#t~malloc1.base|) 0) (= main_~list~0.offset |main_#t~malloc1.offset|) (= (store (store |old(#memory_$Pointer$.base)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_6)) main_~list~0.base (store (store (store (select (store |old(#memory_$Pointer$.base)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_6)) main_~list~0.base) main_~list~0.offset main_~null~0.base) (+ main_~list~0.offset 4) main_~null~0.base) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) |#memory_$Pointer$.base|) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= main_~null~0.offset |main_#t~malloc0.offset|) (= |main_#t~malloc0.base| main_~null~0.base) (<= |#NULL.base| 0) (= |#length| (store (store |old(#length)| |main_#t~malloc0.base| 12) |main_#t~malloc1.base| 12)) (< |#StackHeapBarrier| |main_#t~malloc1.base|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= main_~list~0.offset main_~end~0.offset) (= |#valid| (store (store |old(#valid)| |main_#t~malloc0.base| 1) |main_#t~malloc1.base| 1)) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (= |#NULL.offset| 0) (not (= |main_#t~malloc1.base| 0)))) [2019-10-07 03:48:29,932 INFO L193 IcfgInterpreter]: Reachable states at location mainErr5ASSERT_VIOLATIONERROR_FUNCTION satisfy 137#(and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base) (exists ((v_main_~end~0.offset_44 Int) (v_main_~end~0.base_44 Int)) (or (and (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_44) v_main_~end~0.offset_44) main_~end~0.base) (= (select (select |#memory_$Pointer$.offset| v_main_~end~0.base_44) v_main_~end~0.offset_44) main_~end~0.offset) (not (= v_main_~end~0.offset_44 main_~null~0.offset)) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_44) (+ v_main_~end~0.offset_44 8)))) (and (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_44) v_main_~end~0.offset_44) main_~end~0.base) (= (select (select |#memory_$Pointer$.offset| v_main_~end~0.base_44) v_main_~end~0.offset_44) main_~end~0.offset) (not (= v_main_~end~0.base_44 main_~null~0.base)) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_44) (+ v_main_~end~0.offset_44 8))))))) [2019-10-07 03:48:29,933 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 146#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 03:48:29,933 INFO L193 IcfgInterpreter]: Reachable states at location L1045-1 satisfy 132#(and (= main_~end~0.offset main_~null~0.offset) (= main_~null~0.base main_~end~0.base) (exists ((v_main_~end~0.offset_44 Int) (v_main_~end~0.base_44 Int)) (or (and (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_44) v_main_~end~0.offset_44) main_~end~0.base) (= (select (select |#memory_$Pointer$.offset| v_main_~end~0.base_44) v_main_~end~0.offset_44) main_~end~0.offset) (not (= v_main_~end~0.offset_44 main_~null~0.offset)) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_44) (+ v_main_~end~0.offset_44 8)))) (and (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_44) v_main_~end~0.offset_44) main_~end~0.base) (= (select (select |#memory_$Pointer$.offset| v_main_~end~0.base_44) v_main_~end~0.offset_44) main_~end~0.offset) (not (= v_main_~end~0.base_44 main_~null~0.base)) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_44) (+ v_main_~end~0.offset_44 8))))))) [2019-10-07 03:48:29,933 INFO L193 IcfgInterpreter]: Reachable states at location L1042 satisfy 122#(or (and (= |main_#t~mem13| (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8))) (not (= main_~null~0.base main_~end~0.base))) (and (= |main_#t~mem13| (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8))) (not (= main_~end~0.offset main_~null~0.offset)))) [2019-10-07 03:48:29,933 INFO L193 IcfgInterpreter]: Reachable states at location L1042-1 satisfy 142#(or (and (not (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8)) ~unnamed1~0~RED)) (not (= main_~end~0.offset main_~null~0.offset))) (and (not (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8)) ~unnamed1~0~RED)) (not (= main_~null~0.base main_~end~0.base)))) [2019-10-07 03:48:29,934 INFO L193 IcfgInterpreter]: Reachable states at location L1045-4 satisfy 127#(exists ((v_main_~end~0.offset_44 Int) (v_main_~end~0.base_44 Int)) (or (and (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_44) v_main_~end~0.offset_44) main_~end~0.base) (= (select (select |#memory_$Pointer$.offset| v_main_~end~0.base_44) v_main_~end~0.offset_44) main_~end~0.offset) (not (= v_main_~end~0.offset_44 main_~null~0.offset)) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_44) (+ v_main_~end~0.offset_44 8)))) (and (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_44) v_main_~end~0.offset_44) main_~end~0.base) (= (select (select |#memory_$Pointer$.offset| v_main_~end~0.base_44) v_main_~end~0.offset_44) main_~end~0.offset) (not (= v_main_~end~0.base_44 main_~null~0.base)) (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_44) (+ v_main_~end~0.offset_44 8)))))) [2019-10-07 03:48:29,934 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-07 03:48:29,934 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#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-07 03:48:29,934 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 151#(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-07 03:48:29,934 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 03:48:29,935 INFO L193 IcfgInterpreter]: Reachable states at location L1008-1 satisfy 43#(and (<= 0 (+ |main_#t~nondet2| 2147483648)) (exists ((v_DerPreprocessor_6 Int) (v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int)) (and (= |#memory_$Pointer$.offset| (store (store |old(#memory_$Pointer$.offset)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_5)) main_~list~0.base (store (store (store (select (store |old(#memory_$Pointer$.offset)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_5)) main_~list~0.base) main_~list~0.offset main_~null~0.offset) (+ main_~list~0.offset 4) main_~null~0.offset) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))) (= 0 |#NULL.base|) (= main_~list~0.base main_~end~0.base) (= 0 |main_#t~malloc0.offset|) (= |main_#t~malloc1.offset| 0) (= |main_#t~malloc1.base| main_~list~0.base) (<= 0 |#NULL.base|) (= (store (store |old(#memory_int)| main_~null~0.base (store (store (store (select |old(#memory_int)| main_~null~0.base) main_~null~0.offset v_DerPreprocessor_1) (+ main_~null~0.offset 4) v_DerPreprocessor_4) (+ main_~null~0.offset 8) ~unnamed1~0~BLACK)) main_~list~0.base (store (store (store (select (store |old(#memory_int)| main_~null~0.base (store (store (store (select |old(#memory_int)| main_~null~0.base) main_~null~0.offset v_DerPreprocessor_1) (+ main_~null~0.offset 4) v_DerPreprocessor_4) (+ main_~null~0.offset 8) ~unnamed1~0~BLACK)) main_~list~0.base) main_~list~0.offset v_DerPreprocessor_3) (+ main_~list~0.offset 4) v_DerPreprocessor_2) (+ main_~list~0.offset 8) ~unnamed1~0~BLACK)) |#memory_int|) (<= 0 |#NULL.offset|) (= (select (store |old(#valid)| |main_#t~malloc0.base| 1) |main_#t~malloc1.base|) 0) (= main_~list~0.offset |main_#t~malloc1.offset|) (= (store (store |old(#memory_$Pointer$.base)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_6)) main_~list~0.base (store (store (store (select (store |old(#memory_$Pointer$.base)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_6)) main_~list~0.base) main_~list~0.offset main_~null~0.base) (+ main_~list~0.offset 4) main_~null~0.base) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) |#memory_$Pointer$.base|) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= main_~null~0.offset |main_#t~malloc0.offset|) (= |main_#t~malloc0.base| main_~null~0.base) (<= |#NULL.base| 0) (= |#length| (store (store |old(#length)| |main_#t~malloc0.base| 12) |main_#t~malloc1.base| 12)) (< |#StackHeapBarrier| |main_#t~malloc1.base|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= main_~list~0.offset main_~end~0.offset) (= |#valid| (store (store |old(#valid)| |main_#t~malloc0.base| 1) |main_#t~malloc1.base| 1)) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (= |#NULL.offset| 0) (not (= |main_#t~malloc1.base| 0)))) (<= |main_#t~nondet2| 2147483647)) [2019-10-07 03:48:29,935 INFO L193 IcfgInterpreter]: Reachable states at location L1039 satisfy 68#(or (and (= |main_#t~mem12| (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8))) (exists ((v_DerPreprocessor_6 Int) (v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int)) (and (= |#memory_$Pointer$.offset| (store (store |old(#memory_$Pointer$.offset)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_5)) main_~list~0.base (store (store (store (select (store |old(#memory_$Pointer$.offset)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_5)) main_~list~0.base) main_~list~0.offset main_~null~0.offset) (+ main_~list~0.offset 4) main_~null~0.offset) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))) (= 0 |#NULL.base|) (= main_~list~0.base main_~end~0.base) (= 0 |main_#t~malloc0.offset|) (= |main_#t~malloc1.offset| 0) (= |main_#t~malloc1.base| main_~list~0.base) (<= 0 |#NULL.base|) (= (store (store |old(#memory_int)| main_~null~0.base (store (store (store (select |old(#memory_int)| main_~null~0.base) main_~null~0.offset v_DerPreprocessor_1) (+ main_~null~0.offset 4) v_DerPreprocessor_4) (+ main_~null~0.offset 8) ~unnamed1~0~BLACK)) main_~list~0.base (store (store (store (select (store |old(#memory_int)| main_~null~0.base (store (store (store (select |old(#memory_int)| main_~null~0.base) main_~null~0.offset v_DerPreprocessor_1) (+ main_~null~0.offset 4) v_DerPreprocessor_4) (+ main_~null~0.offset 8) ~unnamed1~0~BLACK)) main_~list~0.base) main_~list~0.offset v_DerPreprocessor_3) (+ main_~list~0.offset 4) v_DerPreprocessor_2) (+ main_~list~0.offset 8) ~unnamed1~0~BLACK)) |#memory_int|) (<= 0 |#NULL.offset|) (= (select (store |old(#valid)| |main_#t~malloc0.base| 1) |main_#t~malloc1.base|) 0) (= main_~list~0.offset |main_#t~malloc1.offset|) (= (store (store |old(#memory_$Pointer$.base)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_6)) main_~list~0.base (store (store (store (select (store |old(#memory_$Pointer$.base)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_6)) main_~list~0.base) main_~list~0.offset main_~null~0.base) (+ main_~list~0.offset 4) main_~null~0.base) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) |#memory_$Pointer$.base|) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= main_~null~0.offset |main_#t~malloc0.offset|) (= |main_#t~malloc0.base| main_~null~0.base) (<= |#NULL.base| 0) (= |#length| (store (store |old(#length)| |main_#t~malloc0.base| 12) |main_#t~malloc1.base| 12)) (< |#StackHeapBarrier| |main_#t~malloc1.base|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= main_~list~0.offset main_~end~0.offset) (= |#valid| (store (store |old(#valid)| |main_#t~malloc0.base| 1) |main_#t~malloc1.base| 1)) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (= |#NULL.offset| 0) (not (= |main_#t~malloc1.base| 0)))) (not (= main_~null~0.base main_~end~0.base))) (and (= |main_#t~mem12| (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8))) (not (= main_~end~0.offset main_~null~0.offset)) (exists ((v_DerPreprocessor_6 Int) (v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int)) (and (= |#memory_$Pointer$.offset| (store (store |old(#memory_$Pointer$.offset)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_5)) main_~list~0.base (store (store (store (select (store |old(#memory_$Pointer$.offset)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_5)) main_~list~0.base) main_~list~0.offset main_~null~0.offset) (+ main_~list~0.offset 4) main_~null~0.offset) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))) (= 0 |#NULL.base|) (= main_~list~0.base main_~end~0.base) (= 0 |main_#t~malloc0.offset|) (= |main_#t~malloc1.offset| 0) (= |main_#t~malloc1.base| main_~list~0.base) (<= 0 |#NULL.base|) (= (store (store |old(#memory_int)| main_~null~0.base (store (store (store (select |old(#memory_int)| main_~null~0.base) main_~null~0.offset v_DerPreprocessor_1) (+ main_~null~0.offset 4) v_DerPreprocessor_4) (+ main_~null~0.offset 8) ~unnamed1~0~BLACK)) main_~list~0.base (store (store (store (select (store |old(#memory_int)| main_~null~0.base (store (store (store (select |old(#memory_int)| main_~null~0.base) main_~null~0.offset v_DerPreprocessor_1) (+ main_~null~0.offset 4) v_DerPreprocessor_4) (+ main_~null~0.offset 8) ~unnamed1~0~BLACK)) main_~list~0.base) main_~list~0.offset v_DerPreprocessor_3) (+ main_~list~0.offset 4) v_DerPreprocessor_2) (+ main_~list~0.offset 8) ~unnamed1~0~BLACK)) |#memory_int|) (<= 0 |#NULL.offset|) (= (select (store |old(#valid)| |main_#t~malloc0.base| 1) |main_#t~malloc1.base|) 0) (= main_~list~0.offset |main_#t~malloc1.offset|) (= (store (store |old(#memory_$Pointer$.base)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_6)) main_~list~0.base (store (store (store (select (store |old(#memory_$Pointer$.base)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_6)) main_~list~0.base) main_~list~0.offset main_~null~0.base) (+ main_~list~0.offset 4) main_~null~0.base) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) |#memory_$Pointer$.base|) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= main_~null~0.offset |main_#t~malloc0.offset|) (= |main_#t~malloc0.base| main_~null~0.base) (<= |#NULL.base| 0) (= |#length| (store (store |old(#length)| |main_#t~malloc0.base| 12) |main_#t~malloc1.base| 12)) (< |#StackHeapBarrier| |main_#t~malloc1.base|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= main_~list~0.offset main_~end~0.offset) (= |#valid| (store (store |old(#valid)| |main_#t~malloc0.base| 1) |main_#t~malloc1.base| 1)) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (= |#NULL.offset| 0) (not (= |main_#t~malloc1.base| 0)))))) [2019-10-07 03:48:29,935 INFO L193 IcfgInterpreter]: Reachable states at location L1040-1 satisfy 117#true [2019-10-07 03:48:29,936 INFO L193 IcfgInterpreter]: Reachable states at location L1031-4 satisfy 38#(exists ((v_DerPreprocessor_6 Int) (v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int)) (and (= |#memory_$Pointer$.offset| (store (store |old(#memory_$Pointer$.offset)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_5)) main_~list~0.base (store (store (store (select (store |old(#memory_$Pointer$.offset)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_5)) main_~list~0.base) main_~list~0.offset main_~null~0.offset) (+ main_~list~0.offset 4) main_~null~0.offset) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))) (= 0 |#NULL.base|) (= main_~list~0.base main_~end~0.base) (= 0 |main_#t~malloc0.offset|) (= |main_#t~malloc1.offset| 0) (= |main_#t~malloc1.base| main_~list~0.base) (<= 0 |#NULL.base|) (= (store (store |old(#memory_int)| main_~null~0.base (store (store (store (select |old(#memory_int)| main_~null~0.base) main_~null~0.offset v_DerPreprocessor_1) (+ main_~null~0.offset 4) v_DerPreprocessor_4) (+ main_~null~0.offset 8) ~unnamed1~0~BLACK)) main_~list~0.base (store (store (store (select (store |old(#memory_int)| main_~null~0.base (store (store (store (select |old(#memory_int)| main_~null~0.base) main_~null~0.offset v_DerPreprocessor_1) (+ main_~null~0.offset 4) v_DerPreprocessor_4) (+ main_~null~0.offset 8) ~unnamed1~0~BLACK)) main_~list~0.base) main_~list~0.offset v_DerPreprocessor_3) (+ main_~list~0.offset 4) v_DerPreprocessor_2) (+ main_~list~0.offset 8) ~unnamed1~0~BLACK)) |#memory_int|) (<= 0 |#NULL.offset|) (= (select (store |old(#valid)| |main_#t~malloc0.base| 1) |main_#t~malloc1.base|) 0) (= main_~list~0.offset |main_#t~malloc1.offset|) (= (store (store |old(#memory_$Pointer$.base)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_6)) main_~list~0.base (store (store (store (select (store |old(#memory_$Pointer$.base)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_6)) main_~list~0.base) main_~list~0.offset main_~null~0.base) (+ main_~list~0.offset 4) main_~null~0.base) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) |#memory_$Pointer$.base|) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= main_~null~0.offset |main_#t~malloc0.offset|) (= |main_#t~malloc0.base| main_~null~0.base) (<= |#NULL.base| 0) (= |#length| (store (store |old(#length)| |main_#t~malloc0.base| 12) |main_#t~malloc1.base| 12)) (< |#StackHeapBarrier| |main_#t~malloc1.base|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= main_~list~0.offset main_~end~0.offset) (= |#valid| (store (store |old(#valid)| |main_#t~malloc0.base| 1) |main_#t~malloc1.base| 1)) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (= |#NULL.offset| 0) (not (= |main_#t~malloc1.base| 0)))) [2019-10-07 03:48:29,936 INFO L193 IcfgInterpreter]: Reachable states at location L1008-3 satisfy 48#(exists ((v_DerPreprocessor_6 Int) (v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int)) (and (= |#memory_$Pointer$.offset| (store (store |old(#memory_$Pointer$.offset)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_5)) main_~list~0.base (store (store (store (select (store |old(#memory_$Pointer$.offset)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_5)) main_~list~0.base) main_~list~0.offset main_~null~0.offset) (+ main_~list~0.offset 4) main_~null~0.offset) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))) (= 0 |#NULL.base|) (= main_~list~0.base main_~end~0.base) (= 0 |main_#t~malloc0.offset|) (= |main_#t~malloc1.offset| 0) (= |main_#t~malloc1.base| main_~list~0.base) (<= 0 |#NULL.base|) (= (store (store |old(#memory_int)| main_~null~0.base (store (store (store (select |old(#memory_int)| main_~null~0.base) main_~null~0.offset v_DerPreprocessor_1) (+ main_~null~0.offset 4) v_DerPreprocessor_4) (+ main_~null~0.offset 8) ~unnamed1~0~BLACK)) main_~list~0.base (store (store (store (select (store |old(#memory_int)| main_~null~0.base (store (store (store (select |old(#memory_int)| main_~null~0.base) main_~null~0.offset v_DerPreprocessor_1) (+ main_~null~0.offset 4) v_DerPreprocessor_4) (+ main_~null~0.offset 8) ~unnamed1~0~BLACK)) main_~list~0.base) main_~list~0.offset v_DerPreprocessor_3) (+ main_~list~0.offset 4) v_DerPreprocessor_2) (+ main_~list~0.offset 8) ~unnamed1~0~BLACK)) |#memory_int|) (<= 0 |#NULL.offset|) (= (select (store |old(#valid)| |main_#t~malloc0.base| 1) |main_#t~malloc1.base|) 0) (= main_~list~0.offset |main_#t~malloc1.offset|) (= (store (store |old(#memory_$Pointer$.base)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_6)) main_~list~0.base (store (store (store (select (store |old(#memory_$Pointer$.base)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_6)) main_~list~0.base) main_~list~0.offset main_~null~0.base) (+ main_~list~0.offset 4) main_~null~0.base) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) |#memory_$Pointer$.base|) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= main_~null~0.offset |main_#t~malloc0.offset|) (= |main_#t~malloc0.base| main_~null~0.base) (<= |#NULL.base| 0) (= |#length| (store (store |old(#length)| |main_#t~malloc0.base| 12) |main_#t~malloc1.base| 12)) (< |#StackHeapBarrier| |main_#t~malloc1.base|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= main_~list~0.offset main_~end~0.offset) (= |#valid| (store (store |old(#valid)| |main_#t~malloc0.base| 1) |main_#t~malloc1.base| 1)) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (= |#NULL.offset| 0) (not (= |main_#t~malloc1.base| 0)))) [2019-10-07 03:48:29,937 INFO L193 IcfgInterpreter]: Reachable states at location L1039-3 satisfy 73#(exists ((v_DerPreprocessor_6 Int) (v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int)) (or (and (= |#memory_$Pointer$.offset| (store (store |old(#memory_$Pointer$.offset)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_5)) main_~list~0.base (store (store (store (select (store |old(#memory_$Pointer$.offset)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_5)) main_~list~0.base) main_~list~0.offset main_~null~0.offset) (+ main_~list~0.offset 4) main_~null~0.offset) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))) (= 0 |#NULL.base|) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8))) (= main_~list~0.base main_~end~0.base) (= 0 |main_#t~malloc0.offset|) (= |main_#t~malloc1.offset| 0) (= |main_#t~malloc1.base| main_~list~0.base) (<= 0 |#NULL.base|) (= (store (store |old(#memory_int)| main_~null~0.base (store (store (store (select |old(#memory_int)| main_~null~0.base) main_~null~0.offset v_DerPreprocessor_1) (+ main_~null~0.offset 4) v_DerPreprocessor_4) (+ main_~null~0.offset 8) ~unnamed1~0~BLACK)) main_~list~0.base (store (store (store (select (store |old(#memory_int)| main_~null~0.base (store (store (store (select |old(#memory_int)| main_~null~0.base) main_~null~0.offset v_DerPreprocessor_1) (+ main_~null~0.offset 4) v_DerPreprocessor_4) (+ main_~null~0.offset 8) ~unnamed1~0~BLACK)) main_~list~0.base) main_~list~0.offset v_DerPreprocessor_3) (+ main_~list~0.offset 4) v_DerPreprocessor_2) (+ main_~list~0.offset 8) ~unnamed1~0~BLACK)) |#memory_int|) (<= 0 |#NULL.offset|) (not (= main_~null~0.base main_~end~0.base)) (= (select (store |old(#valid)| |main_#t~malloc0.base| 1) |main_#t~malloc1.base|) 0) (= main_~list~0.offset |main_#t~malloc1.offset|) (= (store (store |old(#memory_$Pointer$.base)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_6)) main_~list~0.base (store (store (store (select (store |old(#memory_$Pointer$.base)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_6)) main_~list~0.base) main_~list~0.offset main_~null~0.base) (+ main_~list~0.offset 4) main_~null~0.base) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) |#memory_$Pointer$.base|) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= main_~null~0.offset |main_#t~malloc0.offset|) (= |main_#t~malloc0.base| main_~null~0.base) (<= |#NULL.base| 0) (= |#length| (store (store |old(#length)| |main_#t~malloc0.base| 12) |main_#t~malloc1.base| 12)) (< |#StackHeapBarrier| |main_#t~malloc1.base|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= main_~list~0.offset main_~end~0.offset) (= |#valid| (store (store |old(#valid)| |main_#t~malloc0.base| 1) |main_#t~malloc1.base| 1)) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (= |#NULL.offset| 0) (not (= |main_#t~malloc1.base| 0))) (and (= |#memory_$Pointer$.offset| (store (store |old(#memory_$Pointer$.offset)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_5)) main_~list~0.base (store (store (store (select (store |old(#memory_$Pointer$.offset)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_5)) main_~list~0.base) main_~list~0.offset main_~null~0.offset) (+ main_~list~0.offset 4) main_~null~0.offset) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))) (= 0 |#NULL.base|) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8))) (= main_~list~0.base main_~end~0.base) (= 0 |main_#t~malloc0.offset|) (= |main_#t~malloc1.offset| 0) (= |main_#t~malloc1.base| main_~list~0.base) (<= 0 |#NULL.base|) (= (store (store |old(#memory_int)| main_~null~0.base (store (store (store (select |old(#memory_int)| main_~null~0.base) main_~null~0.offset v_DerPreprocessor_1) (+ main_~null~0.offset 4) v_DerPreprocessor_4) (+ main_~null~0.offset 8) ~unnamed1~0~BLACK)) main_~list~0.base (store (store (store (select (store |old(#memory_int)| main_~null~0.base (store (store (store (select |old(#memory_int)| main_~null~0.base) main_~null~0.offset v_DerPreprocessor_1) (+ main_~null~0.offset 4) v_DerPreprocessor_4) (+ main_~null~0.offset 8) ~unnamed1~0~BLACK)) main_~list~0.base) main_~list~0.offset v_DerPreprocessor_3) (+ main_~list~0.offset 4) v_DerPreprocessor_2) (+ main_~list~0.offset 8) ~unnamed1~0~BLACK)) |#memory_int|) (<= 0 |#NULL.offset|) (not (= main_~end~0.offset main_~null~0.offset)) (= (select (store |old(#valid)| |main_#t~malloc0.base| 1) |main_#t~malloc1.base|) 0) (= main_~list~0.offset |main_#t~malloc1.offset|) (= (store (store |old(#memory_$Pointer$.base)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_6)) main_~list~0.base (store (store (store (select (store |old(#memory_$Pointer$.base)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_6)) main_~list~0.base) main_~list~0.offset main_~null~0.base) (+ main_~list~0.offset 4) main_~null~0.base) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) |#memory_$Pointer$.base|) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= main_~null~0.offset |main_#t~malloc0.offset|) (= |main_#t~malloc0.base| main_~null~0.base) (<= |#NULL.base| 0) (= |#length| (store (store |old(#length)| |main_#t~malloc0.base| 12) |main_#t~malloc1.base| 12)) (< |#StackHeapBarrier| |main_#t~malloc1.base|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= main_~list~0.offset main_~end~0.offset) (= |#valid| (store (store |old(#valid)| |main_#t~malloc0.base| 1) |main_#t~malloc1.base| 1)) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (= |#NULL.offset| 0) (not (= |main_#t~malloc1.base| 0))))) [2019-10-07 03:48:29,937 INFO L193 IcfgInterpreter]: Reachable states at location L1038-3 satisfy 58#(or (and (exists ((v_DerPreprocessor_6 Int) (v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int)) (and (= |#memory_$Pointer$.offset| (store (store |old(#memory_$Pointer$.offset)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_5)) main_~list~0.base (store (store (store (select (store |old(#memory_$Pointer$.offset)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_5)) main_~list~0.base) main_~list~0.offset main_~null~0.offset) (+ main_~list~0.offset 4) main_~null~0.offset) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))) (= 0 |#NULL.base|) (= main_~list~0.base main_~end~0.base) (= 0 |main_#t~malloc0.offset|) (= |main_#t~malloc1.offset| 0) (= |main_#t~malloc1.base| main_~list~0.base) (<= 0 |#NULL.base|) (= (store (store |old(#memory_int)| main_~null~0.base (store (store (store (select |old(#memory_int)| main_~null~0.base) main_~null~0.offset v_DerPreprocessor_1) (+ main_~null~0.offset 4) v_DerPreprocessor_4) (+ main_~null~0.offset 8) ~unnamed1~0~BLACK)) main_~list~0.base (store (store (store (select (store |old(#memory_int)| main_~null~0.base (store (store (store (select |old(#memory_int)| main_~null~0.base) main_~null~0.offset v_DerPreprocessor_1) (+ main_~null~0.offset 4) v_DerPreprocessor_4) (+ main_~null~0.offset 8) ~unnamed1~0~BLACK)) main_~list~0.base) main_~list~0.offset v_DerPreprocessor_3) (+ main_~list~0.offset 4) v_DerPreprocessor_2) (+ main_~list~0.offset 8) ~unnamed1~0~BLACK)) |#memory_int|) (<= 0 |#NULL.offset|) (= (select (store |old(#valid)| |main_#t~malloc0.base| 1) |main_#t~malloc1.base|) 0) (= main_~list~0.offset |main_#t~malloc1.offset|) (= (store (store |old(#memory_$Pointer$.base)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_6)) main_~list~0.base (store (store (store (select (store |old(#memory_$Pointer$.base)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_6)) main_~list~0.base) main_~list~0.offset main_~null~0.base) (+ main_~list~0.offset 4) main_~null~0.base) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) |#memory_$Pointer$.base|) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= main_~null~0.offset |main_#t~malloc0.offset|) (= |main_#t~malloc0.base| main_~null~0.base) (<= |#NULL.base| 0) (= |#length| (store (store |old(#length)| |main_#t~malloc0.base| 12) |main_#t~malloc1.base| 12)) (< |#StackHeapBarrier| |main_#t~malloc1.base|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= main_~list~0.offset main_~end~0.offset) (= |#valid| (store (store |old(#valid)| |main_#t~malloc0.base| 1) |main_#t~malloc1.base| 1)) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (= |#NULL.offset| 0) (not (= |main_#t~malloc1.base| 0)))) (not (= main_~null~0.base main_~end~0.base))) (and (not (= main_~end~0.offset main_~null~0.offset)) (exists ((v_DerPreprocessor_6 Int) (v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int)) (and (= |#memory_$Pointer$.offset| (store (store |old(#memory_$Pointer$.offset)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_5)) main_~list~0.base (store (store (store (select (store |old(#memory_$Pointer$.offset)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_5)) main_~list~0.base) main_~list~0.offset main_~null~0.offset) (+ main_~list~0.offset 4) main_~null~0.offset) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))) (= 0 |#NULL.base|) (= main_~list~0.base main_~end~0.base) (= 0 |main_#t~malloc0.offset|) (= |main_#t~malloc1.offset| 0) (= |main_#t~malloc1.base| main_~list~0.base) (<= 0 |#NULL.base|) (= (store (store |old(#memory_int)| main_~null~0.base (store (store (store (select |old(#memory_int)| main_~null~0.base) main_~null~0.offset v_DerPreprocessor_1) (+ main_~null~0.offset 4) v_DerPreprocessor_4) (+ main_~null~0.offset 8) ~unnamed1~0~BLACK)) main_~list~0.base (store (store (store (select (store |old(#memory_int)| main_~null~0.base (store (store (store (select |old(#memory_int)| main_~null~0.base) main_~null~0.offset v_DerPreprocessor_1) (+ main_~null~0.offset 4) v_DerPreprocessor_4) (+ main_~null~0.offset 8) ~unnamed1~0~BLACK)) main_~list~0.base) main_~list~0.offset v_DerPreprocessor_3) (+ main_~list~0.offset 4) v_DerPreprocessor_2) (+ main_~list~0.offset 8) ~unnamed1~0~BLACK)) |#memory_int|) (<= 0 |#NULL.offset|) (= (select (store |old(#valid)| |main_#t~malloc0.base| 1) |main_#t~malloc1.base|) 0) (= main_~list~0.offset |main_#t~malloc1.offset|) (= (store (store |old(#memory_$Pointer$.base)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_6)) main_~list~0.base (store (store (store (select (store |old(#memory_$Pointer$.base)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_6)) main_~list~0.base) main_~list~0.offset main_~null~0.base) (+ main_~list~0.offset 4) main_~null~0.base) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) |#memory_$Pointer$.base|) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= main_~null~0.offset |main_#t~malloc0.offset|) (= |main_#t~malloc0.base| main_~null~0.base) (<= |#NULL.base| 0) (= |#length| (store (store |old(#length)| |main_#t~malloc0.base| 12) |main_#t~malloc1.base| 12)) (< |#StackHeapBarrier| |main_#t~malloc1.base|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= main_~list~0.offset main_~end~0.offset) (= |#valid| (store (store |old(#valid)| |main_#t~malloc0.base| 1) |main_#t~malloc1.base| 1)) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (= |#NULL.offset| 0) (not (= |main_#t~malloc1.base| 0)))))) [2019-10-07 03:48:29,938 INFO L193 IcfgInterpreter]: Reachable states at location L1039-4 satisfy 63#(or (and (exists ((v_DerPreprocessor_6 Int) (v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int)) (and (= |#memory_$Pointer$.offset| (store (store |old(#memory_$Pointer$.offset)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_5)) main_~list~0.base (store (store (store (select (store |old(#memory_$Pointer$.offset)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_5)) main_~list~0.base) main_~list~0.offset main_~null~0.offset) (+ main_~list~0.offset 4) main_~null~0.offset) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))) (= 0 |#NULL.base|) (= main_~list~0.base main_~end~0.base) (= 0 |main_#t~malloc0.offset|) (= |main_#t~malloc1.offset| 0) (= |main_#t~malloc1.base| main_~list~0.base) (<= 0 |#NULL.base|) (= (store (store |old(#memory_int)| main_~null~0.base (store (store (store (select |old(#memory_int)| main_~null~0.base) main_~null~0.offset v_DerPreprocessor_1) (+ main_~null~0.offset 4) v_DerPreprocessor_4) (+ main_~null~0.offset 8) ~unnamed1~0~BLACK)) main_~list~0.base (store (store (store (select (store |old(#memory_int)| main_~null~0.base (store (store (store (select |old(#memory_int)| main_~null~0.base) main_~null~0.offset v_DerPreprocessor_1) (+ main_~null~0.offset 4) v_DerPreprocessor_4) (+ main_~null~0.offset 8) ~unnamed1~0~BLACK)) main_~list~0.base) main_~list~0.offset v_DerPreprocessor_3) (+ main_~list~0.offset 4) v_DerPreprocessor_2) (+ main_~list~0.offset 8) ~unnamed1~0~BLACK)) |#memory_int|) (<= 0 |#NULL.offset|) (= (select (store |old(#valid)| |main_#t~malloc0.base| 1) |main_#t~malloc1.base|) 0) (= main_~list~0.offset |main_#t~malloc1.offset|) (= (store (store |old(#memory_$Pointer$.base)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_6)) main_~list~0.base (store (store (store (select (store |old(#memory_$Pointer$.base)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_6)) main_~list~0.base) main_~list~0.offset main_~null~0.base) (+ main_~list~0.offset 4) main_~null~0.base) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) |#memory_$Pointer$.base|) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= main_~null~0.offset |main_#t~malloc0.offset|) (= |main_#t~malloc0.base| main_~null~0.base) (<= |#NULL.base| 0) (= |#length| (store (store |old(#length)| |main_#t~malloc0.base| 12) |main_#t~malloc1.base| 12)) (< |#StackHeapBarrier| |main_#t~malloc1.base|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= main_~list~0.offset main_~end~0.offset) (= |#valid| (store (store |old(#valid)| |main_#t~malloc0.base| 1) |main_#t~malloc1.base| 1)) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (= |#NULL.offset| 0) (not (= |main_#t~malloc1.base| 0)))) (not (= main_~null~0.base main_~end~0.base))) (and (not (= main_~end~0.offset main_~null~0.offset)) (exists ((v_DerPreprocessor_6 Int) (v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int)) (and (= |#memory_$Pointer$.offset| (store (store |old(#memory_$Pointer$.offset)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_5)) main_~list~0.base (store (store (store (select (store |old(#memory_$Pointer$.offset)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_5)) main_~list~0.base) main_~list~0.offset main_~null~0.offset) (+ main_~list~0.offset 4) main_~null~0.offset) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))) (= 0 |#NULL.base|) (= main_~list~0.base main_~end~0.base) (= 0 |main_#t~malloc0.offset|) (= |main_#t~malloc1.offset| 0) (= |main_#t~malloc1.base| main_~list~0.base) (<= 0 |#NULL.base|) (= (store (store |old(#memory_int)| main_~null~0.base (store (store (store (select |old(#memory_int)| main_~null~0.base) main_~null~0.offset v_DerPreprocessor_1) (+ main_~null~0.offset 4) v_DerPreprocessor_4) (+ main_~null~0.offset 8) ~unnamed1~0~BLACK)) main_~list~0.base (store (store (store (select (store |old(#memory_int)| main_~null~0.base (store (store (store (select |old(#memory_int)| main_~null~0.base) main_~null~0.offset v_DerPreprocessor_1) (+ main_~null~0.offset 4) v_DerPreprocessor_4) (+ main_~null~0.offset 8) ~unnamed1~0~BLACK)) main_~list~0.base) main_~list~0.offset v_DerPreprocessor_3) (+ main_~list~0.offset 4) v_DerPreprocessor_2) (+ main_~list~0.offset 8) ~unnamed1~0~BLACK)) |#memory_int|) (<= 0 |#NULL.offset|) (= (select (store |old(#valid)| |main_#t~malloc0.base| 1) |main_#t~malloc1.base|) 0) (= main_~list~0.offset |main_#t~malloc1.offset|) (= (store (store |old(#memory_$Pointer$.base)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_6)) main_~list~0.base (store (store (store (select (store |old(#memory_$Pointer$.base)| main_~null~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~null~0.base) main_~null~0.offset 0) (+ main_~null~0.offset 4) 0) (+ main_~null~0.offset 8) v_DerPreprocessor_6)) main_~list~0.base) main_~list~0.offset main_~null~0.base) (+ main_~list~0.offset 4) main_~null~0.base) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) |#memory_$Pointer$.base|) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= main_~null~0.offset |main_#t~malloc0.offset|) (= |main_#t~malloc0.base| main_~null~0.base) (<= |#NULL.base| 0) (= |#length| (store (store |old(#length)| |main_#t~malloc0.base| 12) |main_#t~malloc1.base| 12)) (< |#StackHeapBarrier| |main_#t~malloc1.base|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= main_~list~0.offset main_~end~0.offset) (= |#valid| (store (store |old(#valid)| |main_#t~malloc0.base| 1) |main_#t~malloc1.base| 1)) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (= |#NULL.offset| 0) (not (= |main_#t~malloc1.base| 0)))))) [2019-10-07 03:48:30,781 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 116 [2019-10-07 03:48:39,278 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 03:48:39,279 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 13] total 22 [2019-10-07 03:48:39,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-07 03:48:39,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-07 03:48:39,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=373, Unknown=4, NotChecked=0, Total=462 [2019-10-07 03:48:39,281 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 22 states. [2019-10-07 03:49:06,999 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 123 [2019-10-07 03:49:11,294 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-10-07 03:49:13,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:49:13,865 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2019-10-07 03:49:13,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-07 03:49:13,865 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 20 [2019-10-07 03:49:13,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:49:13,866 INFO L225 Difference]: With dead ends: 73 [2019-10-07 03:49:13,866 INFO L226 Difference]: Without dead ends: 51 [2019-10-07 03:49:13,867 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=177, Invalid=810, Unknown=5, NotChecked=0, Total=992 [2019-10-07 03:49:13,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-10-07 03:49:13,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 39. [2019-10-07 03:49:13,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-07 03:49:13,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2019-10-07 03:49:13,876 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 20 [2019-10-07 03:49:13,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:49:13,877 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2019-10-07 03:49:13,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-07 03:49:13,880 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2019-10-07 03:49:13,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-07 03:49:13,881 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:49:13,881 INFO L385 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] [2019-10-07 03:49:14,086 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:49:14,086 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:49:14,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:49:14,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1465232090, now seen corresponding path program 1 times [2019-10-07 03:49:14,087 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:49:14,087 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:49:14,087 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:49:14,088 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:49:14,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:49:14,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:49:14,452 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 27 [2019-10-07 03:49:14,623 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 33 [2019-10-07 03:49:14,854 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-07 03:49:14,855 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:49:14,855 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 03:49:14,855 INFO L95 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-07 03:49:14,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:49:14,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-07 03:49:14,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 03:49:32,451 WARN L191 SmtUtils]: Spent 16.78 s on a formula simplification that was a NOOP. DAG size: 211 [2019-10-07 03:49:56,739 WARN L191 SmtUtils]: Spent 22.48 s on a formula simplification that was a NOOP. DAG size: 208 [2019-10-07 03:50:14,145 WARN L191 SmtUtils]: Spent 16.91 s on a formula simplification that was a NOOP. DAG size: 199 [2019-10-07 03:50:24,595 WARN L191 SmtUtils]: Spent 10.32 s on a formula simplification that was a NOOP. DAG size: 191 [2019-10-07 03:50:32,574 WARN L191 SmtUtils]: Spent 7.79 s on a formula simplification that was a NOOP. DAG size: 183 [2019-10-07 03:50:38,460 WARN L191 SmtUtils]: Spent 5.78 s on a formula simplification that was a NOOP. DAG size: 175 [2019-10-07 03:50:43,013 WARN L191 SmtUtils]: Spent 4.53 s on a formula simplification that was a NOOP. DAG size: 171 [2019-10-07 03:50:47,027 WARN L191 SmtUtils]: Spent 3.96 s on a formula simplification that was a NOOP. DAG size: 168 [2019-10-07 03:50:50,568 WARN L191 SmtUtils]: Spent 3.52 s on a formula simplification that was a NOOP. DAG size: 165 [2019-10-07 03:50:54,237 WARN L191 SmtUtils]: Spent 3.26 s on a formula simplification that was a NOOP. DAG size: 159 [2019-10-07 03:50:57,197 WARN L191 SmtUtils]: Spent 2.54 s on a formula simplification that was a NOOP. DAG size: 153 [2019-10-07 03:51:00,064 WARN L191 SmtUtils]: Spent 2.83 s on a formula simplification that was a NOOP. DAG size: 150 [2019-10-07 03:51:02,474 WARN L191 SmtUtils]: Spent 1.93 s on a formula simplification that was a NOOP. DAG size: 143 [2019-10-07 03:51:03,850 WARN L191 SmtUtils]: Spent 1.25 s on a formula simplification that was a NOOP. DAG size: 137 [2019-10-07 03:51:05,048 WARN L191 SmtUtils]: Spent 1.18 s on a formula simplification that was a NOOP. DAG size: 134 [2019-10-07 03:51:07,173 WARN L191 SmtUtils]: Spent 1.96 s on a formula simplification. DAG size of input: 145 DAG size of output: 132 [2019-10-07 03:51:08,098 WARN L191 SmtUtils]: Spent 711.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 125 [2019-10-07 03:51:08,407 WARN L191 SmtUtils]: Spent 295.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2019-10-07 03:51:08,522 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2019-10-07 03:51:08,844 WARN L191 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 106 [2019-10-07 03:51:09,328 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-07 03:51:09,328 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 03:51:15,339 WARN L191 SmtUtils]: Spent 5.52 s on a formula simplification that was a NOOP. DAG size: 211 [2019-10-07 03:51:18,530 WARN L191 SmtUtils]: Spent 3.15 s on a formula simplification that was a NOOP. DAG size: 202 [2019-10-07 03:51:21,539 WARN L191 SmtUtils]: Spent 2.93 s on a formula simplification that was a NOOP. DAG size: 193 [2019-10-07 03:51:23,068 WARN L191 SmtUtils]: Spent 1.47 s on a formula simplification that was a NOOP. DAG size: 184 [2019-10-07 03:51:25,266 WARN L191 SmtUtils]: Spent 2.17 s on a formula simplification that was a NOOP. DAG size: 180 [2019-10-07 03:51:26,990 WARN L191 SmtUtils]: Spent 1.70 s on a formula simplification that was a NOOP. DAG size: 176 [2019-10-07 03:51:29,150 WARN L191 SmtUtils]: Spent 2.12 s on a formula simplification that was a NOOP. DAG size: 172 [2019-10-07 03:51:30,736 WARN L191 SmtUtils]: Spent 1.55 s on a formula simplification that was a NOOP. DAG size: 168 [2019-10-07 03:51:32,245 WARN L191 SmtUtils]: Spent 1.49 s on a formula simplification that was a NOOP. DAG size: 164 [2019-10-07 03:51:33,647 WARN L191 SmtUtils]: Spent 1.36 s on a formula simplification that was a NOOP. DAG size: 160 [2019-10-07 03:51:34,664 WARN L191 SmtUtils]: Spent 994.00 ms on a formula simplification that was a NOOP. DAG size: 155 [2019-10-07 03:51:35,210 WARN L191 SmtUtils]: Spent 529.00 ms on a formula simplification that was a NOOP. DAG size: 150 [2019-10-07 03:51:35,700 WARN L191 SmtUtils]: Spent 479.00 ms on a formula simplification that was a NOOP. DAG size: 145 [2019-10-07 03:51:35,920 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 72 [2019-10-07 03:51:36,206 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:51:36,207 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:291) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:99) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:287) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:177) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:133) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-10-07 03:51:36,213 INFO L168 Benchmark]: Toolchain (without parser) took 191838.08 ms. Allocated memory was 143.7 MB in the beginning and 317.7 MB in the end (delta: 174.1 MB). Free memory was 100.3 MB in the beginning and 145.9 MB in the end (delta: -45.6 MB). Peak memory consumption was 182.7 MB. Max. memory is 7.1 GB. [2019-10-07 03:51:36,214 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 143.7 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-07 03:51:36,223 INFO L168 Benchmark]: CACSL2BoogieTranslator took 666.27 ms. Allocated memory was 143.7 MB in the beginning and 201.3 MB in the end (delta: 57.7 MB). Free memory was 100.1 MB in the beginning and 167.1 MB in the end (delta: -67.1 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. [2019-10-07 03:51:36,223 INFO L168 Benchmark]: Boogie Preprocessor took 81.69 ms. Allocated memory is still 201.3 MB. Free memory was 167.1 MB in the beginning and 164.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-10-07 03:51:36,224 INFO L168 Benchmark]: RCFGBuilder took 982.61 ms. Allocated memory is still 201.3 MB. Free memory was 164.3 MB in the beginning and 100.1 MB in the end (delta: 64.2 MB). Peak memory consumption was 64.2 MB. Max. memory is 7.1 GB. [2019-10-07 03:51:36,229 INFO L168 Benchmark]: TraceAbstraction took 190100.80 ms. Allocated memory was 201.3 MB in the beginning and 317.7 MB in the end (delta: 116.4 MB). Free memory was 100.1 MB in the beginning and 145.9 MB in the end (delta: -45.8 MB). Peak memory consumption was 124.8 MB. Max. memory is 7.1 GB. [2019-10-07 03:51:36,231 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 143.7 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 666.27 ms. Allocated memory was 143.7 MB in the beginning and 201.3 MB in the end (delta: 57.7 MB). Free memory was 100.1 MB in the beginning and 167.1 MB in the end (delta: -67.1 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 81.69 ms. Allocated memory is still 201.3 MB. Free memory was 167.1 MB in the beginning and 164.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 982.61 ms. Allocated memory is still 201.3 MB. Free memory was 164.3 MB in the beginning and 100.1 MB in the end (delta: 64.2 MB). Peak memory consumption was 64.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 190100.80 ms. Allocated memory was 201.3 MB in the beginning and 317.7 MB in the end (delta: 116.4 MB). Free memory was 100.1 MB in the beginning and 145.9 MB in the end (delta: -45.8 MB). Peak memory consumption was 124.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...