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 -i ../../../trunk/examples/svcomp/list-simple/dll2c_update_all.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 19:12:51,123 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 19:12:51,125 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 19:12:51,138 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 19:12:51,139 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 19:12:51,141 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 19:12:51,143 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 19:12:51,146 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 19:12:51,150 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 19:12:51,152 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 19:12:51,153 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 19:12:51,154 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 19:12:51,155 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 19:12:51,156 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 19:12:51,156 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 19:12:51,157 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 19:12:51,158 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 19:12:51,159 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 19:12:51,161 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 19:12:51,163 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 19:12:51,165 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 19:12:51,166 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 19:12:51,167 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 19:12:51,168 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 19:12:51,170 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 19:12:51,170 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 19:12:51,171 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 19:12:51,172 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 19:12:51,172 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 19:12:51,173 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 19:12:51,173 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 19:12:51,174 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 19:12:51,175 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 19:12:51,175 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 19:12:51,176 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 19:12:51,177 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 19:12:51,177 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 19:12:51,177 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 19:12:51,178 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 19:12:51,179 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 19:12:51,179 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 19:12:51,180 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 19:12:51,194 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 19:12:51,194 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 19:12:51,195 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 19:12:51,196 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 19:12:51,196 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 19:12:51,196 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 19:12:51,196 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 19:12:51,196 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 19:12:51,197 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 19:12:51,197 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 19:12:51,197 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 19:12:51,197 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 19:12:51,197 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 19:12:51,198 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 19:12:51,198 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 19:12:51,198 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 19:12:51,198 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 19:12:51,198 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 19:12:51,199 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 19:12:51,199 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 19:12:51,199 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 19:12:51,199 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:12:51,200 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 19:12:51,200 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 19:12:51,200 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 19:12:51,200 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 19:12:51,200 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 19:12:51,201 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 19:12:51,201 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 19:12:51,529 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 19:12:51,549 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 19:12:51,553 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 19:12:51,555 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 19:12:51,555 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 19:12:51,556 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2c_update_all.i [2019-10-13 19:12:51,617 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f9141c42/46923408ae42484598cccfe722474670/FLAGe686521e5 [2019-10-13 19:12:52,152 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 19:12:52,153 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_update_all.i [2019-10-13 19:12:52,176 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f9141c42/46923408ae42484598cccfe722474670/FLAGe686521e5 [2019-10-13 19:12:52,420 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f9141c42/46923408ae42484598cccfe722474670 [2019-10-13 19:12:52,429 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 19:12:52,431 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 19:12:52,432 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 19:12:52,432 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 19:12:52,436 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 19:12:52,437 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:12:52" (1/1) ... [2019-10-13 19:12:52,440 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3272c0db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:12:52, skipping insertion in model container [2019-10-13 19:12:52,441 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:12:52" (1/1) ... [2019-10-13 19:12:52,449 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 19:12:52,511 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 19:12:52,977 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:12:52,986 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 19:12:53,035 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:12:53,097 INFO L192 MainTranslator]: Completed translation [2019-10-13 19:12:53,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:12:53 WrapperNode [2019-10-13 19:12:53,097 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 19:12:53,098 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 19:12:53,098 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 19:12:53,099 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 19:12:53,113 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:12:53" (1/1) ... [2019-10-13 19:12:53,113 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:12:53" (1/1) ... [2019-10-13 19:12:53,130 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:12:53" (1/1) ... [2019-10-13 19:12:53,131 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:12:53" (1/1) ... [2019-10-13 19:12:53,146 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:12:53" (1/1) ... [2019-10-13 19:12:53,156 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:12:53" (1/1) ... [2019-10-13 19:12:53,160 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:12:53" (1/1) ... [2019-10-13 19:12:53,167 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 19:12:53,171 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 19:12:53,171 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 19:12:53,172 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 19:12:53,173 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:12:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:12:53,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 19:12:53,230 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 19:12:53,230 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-10-13 19:12:53,230 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-10-13 19:12:53,230 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-10-13 19:12:53,230 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-10-13 19:12:53,231 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2019-10-13 19:12:53,231 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_destroy [2019-10-13 19:12:53,231 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_get_data_at [2019-10-13 19:12:53,231 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_update_at [2019-10-13 19:12:53,231 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 19:12:53,232 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 19:12:53,232 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-10-13 19:12:53,232 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-10-13 19:12:53,232 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-13 19:12:53,232 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-13 19:12:53,233 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-13 19:12:53,233 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-13 19:12:53,233 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-13 19:12:53,233 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-13 19:12:53,233 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-13 19:12:53,233 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-13 19:12:53,234 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-13 19:12:53,234 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-13 19:12:53,234 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-13 19:12:53,234 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-13 19:12:53,234 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-13 19:12:53,234 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-13 19:12:53,235 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-13 19:12:53,235 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-13 19:12:53,235 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-13 19:12:53,235 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-13 19:12:53,235 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-13 19:12:53,235 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-13 19:12:53,236 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-13 19:12:53,236 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-13 19:12:53,236 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-13 19:12:53,236 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-13 19:12:53,236 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-13 19:12:53,237 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-13 19:12:53,237 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-13 19:12:53,237 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-13 19:12:53,237 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-13 19:12:53,237 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-13 19:12:53,237 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-13 19:12:53,238 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-13 19:12:53,238 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-13 19:12:53,238 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-13 19:12:53,238 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-13 19:12:53,238 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-13 19:12:53,238 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-13 19:12:53,239 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-13 19:12:53,239 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-13 19:12:53,239 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-13 19:12:53,239 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-13 19:12:53,239 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-13 19:12:53,239 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-13 19:12:53,240 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-13 19:12:53,240 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-13 19:12:53,240 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-13 19:12:53,240 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-13 19:12:53,240 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-13 19:12:53,240 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-13 19:12:53,241 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-13 19:12:53,241 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 19:12:53,241 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-13 19:12:53,241 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-13 19:12:53,241 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 19:12:53,241 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-13 19:12:53,242 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-13 19:12:53,242 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-13 19:12:53,242 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-13 19:12:53,242 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-13 19:12:53,242 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-13 19:12:53,243 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-13 19:12:53,243 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-13 19:12:53,243 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-13 19:12:53,243 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 19:12:53,243 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-13 19:12:53,243 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-13 19:12:53,243 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-13 19:12:53,244 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-13 19:12:53,244 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-13 19:12:53,244 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-13 19:12:53,244 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-13 19:12:53,244 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-13 19:12:53,244 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-13 19:12:53,244 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-13 19:12:53,245 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-13 19:12:53,245 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-13 19:12:53,245 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-13 19:12:53,245 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-13 19:12:53,245 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-13 19:12:53,245 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-13 19:12:53,245 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-13 19:12:53,246 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-13 19:12:53,246 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-13 19:12:53,246 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-13 19:12:53,246 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-13 19:12:53,246 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-13 19:12:53,246 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-13 19:12:53,247 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-13 19:12:53,247 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-13 19:12:53,247 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-13 19:12:53,247 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-13 19:12:53,247 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-13 19:12:53,247 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-13 19:12:53,247 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-13 19:12:53,248 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-13 19:12:53,248 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-13 19:12:53,248 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-13 19:12:53,248 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-13 19:12:53,248 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-13 19:12:53,248 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-13 19:12:53,249 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-13 19:12:53,249 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-13 19:12:53,249 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-13 19:12:53,249 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-10-13 19:12:53,249 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-10-13 19:12:53,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 19:12:53,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 19:12:53,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 19:12:53,250 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2019-10-13 19:12:53,250 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_destroy [2019-10-13 19:12:53,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 19:12:53,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 19:12:53,250 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_get_data_at [2019-10-13 19:12:53,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 19:12:53,251 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_update_at [2019-10-13 19:12:53,251 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 19:12:53,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 19:12:53,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 19:12:53,768 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-10-13 19:12:53,901 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 19:12:53,901 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-10-13 19:12:53,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:12:53 BoogieIcfgContainer [2019-10-13 19:12:53,903 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 19:12:53,904 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 19:12:53,904 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 19:12:53,907 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 19:12:53,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:12:52" (1/3) ... [2019-10-13 19:12:53,909 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eb0211f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:12:53, skipping insertion in model container [2019-10-13 19:12:53,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:12:53" (2/3) ... [2019-10-13 19:12:53,909 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eb0211f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:12:53, skipping insertion in model container [2019-10-13 19:12:53,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:12:53" (3/3) ... [2019-10-13 19:12:53,911 INFO L109 eAbstractionObserver]: Analyzing ICFG dll2c_update_all.i [2019-10-13 19:12:53,921 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 19:12:53,930 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 19:12:53,942 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 19:12:53,964 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 19:12:53,965 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 19:12:53,965 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 19:12:53,965 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 19:12:53,965 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 19:12:53,965 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 19:12:53,965 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 19:12:53,966 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 19:12:53,981 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2019-10-13 19:12:53,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-13 19:12:53,989 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:12:53,990 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:12:53,992 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:12:53,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:12:53,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1661227511, now seen corresponding path program 1 times [2019-10-13 19:12:54,006 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:12:54,007 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585925705] [2019-10-13 19:12:54,007 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:54,007 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:54,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:12:54,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:54,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:54,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:54,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:54,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:54,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:12:54,417 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585925705] [2019-10-13 19:12:54,418 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:12:54,418 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:12:54,419 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686801048] [2019-10-13 19:12:54,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:12:54,425 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:12:54,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:12:54,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:12:54,444 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 4 states. [2019-10-13 19:12:54,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:12:54,701 INFO L93 Difference]: Finished difference Result 101 states and 133 transitions. [2019-10-13 19:12:54,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:12:54,703 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-10-13 19:12:54,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:12:54,714 INFO L225 Difference]: With dead ends: 101 [2019-10-13 19:12:54,714 INFO L226 Difference]: Without dead ends: 45 [2019-10-13 19:12:54,724 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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-13 19:12:54,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-13 19:12:54,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-10-13 19:12:54,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-13 19:12:54,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2019-10-13 19:12:54,797 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 32 [2019-10-13 19:12:54,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:12:54,799 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2019-10-13 19:12:54,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:12:54,799 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2019-10-13 19:12:54,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-13 19:12:54,804 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:12:54,804 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:12:54,806 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:12:54,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:12:54,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1248070634, now seen corresponding path program 1 times [2019-10-13 19:12:54,808 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:12:54,808 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577633371] [2019-10-13 19:12:54,808 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:54,809 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:54,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:12:54,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:54,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:54,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:55,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:55,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:55,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:12:55,081 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577633371] [2019-10-13 19:12:55,081 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:12:55,082 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 19:12:55,082 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061076579] [2019-10-13 19:12:55,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 19:12:55,084 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:12:55,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 19:12:55,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 19:12:55,085 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand 7 states. [2019-10-13 19:12:55,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:12:55,361 INFO L93 Difference]: Finished difference Result 75 states and 87 transitions. [2019-10-13 19:12:55,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 19:12:55,362 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2019-10-13 19:12:55,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:12:55,364 INFO L225 Difference]: With dead ends: 75 [2019-10-13 19:12:55,364 INFO L226 Difference]: Without dead ends: 50 [2019-10-13 19:12:55,365 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-10-13 19:12:55,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-13 19:12:55,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2019-10-13 19:12:55,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-13 19:12:55,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2019-10-13 19:12:55,377 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 32 [2019-10-13 19:12:55,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:12:55,379 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2019-10-13 19:12:55,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 19:12:55,380 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2019-10-13 19:12:55,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-13 19:12:55,381 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:12:55,381 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:12:55,382 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:12:55,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:12:55,383 INFO L82 PathProgramCache]: Analyzing trace with hash -820838434, now seen corresponding path program 1 times [2019-10-13 19:12:55,384 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:12:55,384 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304189517] [2019-10-13 19:12:55,384 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:55,384 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:55,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:12:55,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:55,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:55,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:55,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:55,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:55,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:55,533 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-13 19:12:55,534 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304189517] [2019-10-13 19:12:55,534 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:12:55,534 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 19:12:55,535 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790546001] [2019-10-13 19:12:55,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:12:55,536 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:12:55,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:12:55,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:12:55,537 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 6 states. [2019-10-13 19:12:55,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:12:55,756 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2019-10-13 19:12:55,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 19:12:55,760 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-10-13 19:12:55,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:12:55,762 INFO L225 Difference]: With dead ends: 69 [2019-10-13 19:12:55,762 INFO L226 Difference]: Without dead ends: 56 [2019-10-13 19:12:55,762 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-13 19:12:55,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-10-13 19:12:55,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 47. [2019-10-13 19:12:55,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-13 19:12:55,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2019-10-13 19:12:55,773 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 42 [2019-10-13 19:12:55,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:12:55,773 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2019-10-13 19:12:55,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:12:55,774 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2019-10-13 19:12:55,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-13 19:12:55,775 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:12:55,776 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:12:55,776 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:12:55,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:12:55,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1202630968, now seen corresponding path program 1 times [2019-10-13 19:12:55,777 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:12:55,777 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562370258] [2019-10-13 19:12:55,777 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:55,777 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:55,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:12:55,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:55,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:55,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:55,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:55,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:56,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:56,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:56,026 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-13 19:12:56,027 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562370258] [2019-10-13 19:12:56,027 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538972688] [2019-10-13 19:12:56,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:12:56,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:56,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 19:12:56,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:12:56,231 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-13 19:12:56,232 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:12:56,232 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 10 [2019-10-13 19:12:56,233 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006239276] [2019-10-13 19:12:56,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 19:12:56,233 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:12:56,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 19:12:56,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:12:56,234 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 10 states. [2019-10-13 19:12:56,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:12:56,535 INFO L93 Difference]: Finished difference Result 79 states and 91 transitions. [2019-10-13 19:12:56,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 19:12:56,535 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2019-10-13 19:12:56,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:12:56,537 INFO L225 Difference]: With dead ends: 79 [2019-10-13 19:12:56,537 INFO L226 Difference]: Without dead ends: 66 [2019-10-13 19:12:56,538 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-10-13 19:12:56,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-13 19:12:56,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 50. [2019-10-13 19:12:56,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-13 19:12:56,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2019-10-13 19:12:56,548 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 50 [2019-10-13 19:12:56,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:12:56,548 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2019-10-13 19:12:56,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 19:12:56,549 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2019-10-13 19:12:56,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-13 19:12:56,550 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:12:56,550 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:12:56,755 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:12:56,756 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:12:56,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:12:56,756 INFO L82 PathProgramCache]: Analyzing trace with hash -470871118, now seen corresponding path program 2 times [2019-10-13 19:12:56,756 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:12:56,756 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166355315] [2019-10-13 19:12:56,757 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:56,757 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:56,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:12:56,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:56,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:56,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:56,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:56,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:56,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:56,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:56,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:56,998 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-13 19:12:56,998 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166355315] [2019-10-13 19:12:56,999 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758902193] [2019-10-13 19:12:56,999 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:12:57,246 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-13 19:12:57,246 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 19:12:57,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-13 19:12:57,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:12:57,312 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-13 19:12:57,313 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 19:12:57,313 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 13 [2019-10-13 19:12:57,313 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672849965] [2019-10-13 19:12:57,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:12:57,314 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:12:57,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:12:57,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-13 19:12:57,314 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand 6 states. [2019-10-13 19:12:57,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:12:57,405 INFO L93 Difference]: Finished difference Result 82 states and 95 transitions. [2019-10-13 19:12:57,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 19:12:57,407 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-10-13 19:12:57,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:12:57,410 INFO L225 Difference]: With dead ends: 82 [2019-10-13 19:12:57,410 INFO L226 Difference]: Without dead ends: 61 [2019-10-13 19:12:57,411 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-10-13 19:12:57,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-13 19:12:57,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 54. [2019-10-13 19:12:57,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-13 19:12:57,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2019-10-13 19:12:57,422 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 58 [2019-10-13 19:12:57,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:12:57,423 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2019-10-13 19:12:57,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:12:57,423 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2019-10-13 19:12:57,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-13 19:12:57,424 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:12:57,425 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:12:57,629 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:12:57,630 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:12:57,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:12:57,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1967505627, now seen corresponding path program 1 times [2019-10-13 19:12:57,632 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:12:57,632 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533816693] [2019-10-13 19:12:57,632 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:57,633 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:57,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:12:57,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:58,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:58,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:58,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:58,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:58,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:58,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:58,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:59,004 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 19:12:59,004 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533816693] [2019-10-13 19:12:59,005 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368532985] [2019-10-13 19:12:59,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:12:59,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:59,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 96 conjunts are in the unsatisfiable core [2019-10-13 19:12:59,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:12:59,258 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-13 19:12:59,259 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:59,263 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:59,264 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:59,264 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-10-13 19:12:59,442 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:59,443 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 15 [2019-10-13 19:12:59,443 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:59,449 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:59,449 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:59,449 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-10-13 19:12:59,507 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-13 19:12:59,507 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:59,517 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:59,517 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:59,517 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-10-13 19:12:59,575 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-10-13 19:12:59,575 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:59,582 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:59,583 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 19:12:59,583 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2019-10-13 19:12:59,871 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-10-13 19:12:59,873 INFO L341 Elim1Store]: treesize reduction 67, result has 62.8 percent of original size [2019-10-13 19:12:59,874 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 71 treesize of output 132 [2019-10-13 19:12:59,877 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:59,910 INFO L567 ElimStorePlain]: treesize reduction 155, result has 25.1 percent of original size [2019-10-13 19:12:59,911 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-13 19:12:59,912 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:71, output treesize:52 [2019-10-13 19:13:00,381 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-13 19:13:00,381 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:13:00,387 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:13:00,387 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:13:00,388 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2019-10-13 19:13:00,475 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:13:00,476 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:13:00,478 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:13:00,557 INFO L341 Elim1Store]: treesize reduction 28, result has 65.0 percent of original size [2019-10-13 19:13:00,558 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 81 [2019-10-13 19:13:00,560 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:13:00,592 INFO L567 ElimStorePlain]: treesize reduction 72, result has 41.5 percent of original size [2019-10-13 19:13:00,594 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 19:13:00,594 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:70, output treesize:51 [2019-10-13 19:13:01,422 WARN L860 $PredicateComparison]: unable to prove that (exists ((dll_circular_update_at_~data Int) (dll_circular_update_at_~head.offset Int)) (= (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base|) |c_dll_circular_update_at_#in~head.offset|))) (store |c_old(#memory_int)| .cse0 (store (select |c_old(#memory_int)| .cse0) (+ dll_circular_update_at_~head.offset 8) dll_circular_update_at_~data))) |c_#memory_int|)) is different from true [2019-10-13 19:13:01,435 INFO L392 ElimStorePlain]: Different costs {2=[|v_old(#memory_int)_AFTER_CALL_14|], 6=[|v_old(#memory_$Pointer$.base)_AFTER_CALL_14|]} [2019-10-13 19:13:01,445 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:13:01,446 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-10-13 19:13:01,447 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:13:01,461 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:13:01,476 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:13:01,493 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:13:01,494 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 53 [2019-10-13 19:13:01,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:13:01,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:13:01,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:13:01,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:13:01,503 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 19:13:01,524 INFO L567 ElimStorePlain]: treesize reduction 30, result has 46.4 percent of original size [2019-10-13 19:13:01,526 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:13:01,526 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:72, output treesize:13 [2019-10-13 19:13:02,493 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:13:02,493 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 37 treesize of output 29 [2019-10-13 19:13:02,495 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:13:02,503 INFO L567 ElimStorePlain]: treesize reduction 16, result has 30.4 percent of original size [2019-10-13 19:13:02,503 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:13:02,504 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:37, output treesize:7 [2019-10-13 19:13:02,574 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2019-10-13 19:13:02,575 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:13:02,575 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33] total 60 [2019-10-13 19:13:02,575 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098189818] [2019-10-13 19:13:02,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-10-13 19:13:02,576 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:13:02,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-10-13 19:13:02,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=3249, Unknown=2, NotChecked=114, Total=3540 [2019-10-13 19:13:02,579 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand 60 states. [2019-10-13 19:13:08,649 WARN L191 SmtUtils]: Spent 1.68 s on a formula simplification. DAG size of input: 33 DAG size of output: 26 [2019-10-13 19:13:16,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:13:16,305 INFO L93 Difference]: Finished difference Result 128 states and 165 transitions. [2019-10-13 19:13:16,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-10-13 19:13:16,306 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 59 [2019-10-13 19:13:16,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:13:16,311 INFO L225 Difference]: With dead ends: 128 [2019-10-13 19:13:16,311 INFO L226 Difference]: Without dead ends: 125 [2019-10-13 19:13:16,316 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1747 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=562, Invalid=8549, Unknown=13, NotChecked=188, Total=9312 [2019-10-13 19:13:16,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-10-13 19:13:16,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 107. [2019-10-13 19:13:16,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-10-13 19:13:16,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 139 transitions. [2019-10-13 19:13:16,336 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 139 transitions. Word has length 59 [2019-10-13 19:13:16,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:13:16,337 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 139 transitions. [2019-10-13 19:13:16,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-10-13 19:13:16,337 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 139 transitions. [2019-10-13 19:13:16,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-13 19:13:16,339 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:13:16,339 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:13:16,543 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:13:16,544 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:13:16,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:13:16,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1479492828, now seen corresponding path program 1 times [2019-10-13 19:13:16,545 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:13:16,546 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314511248] [2019-10-13 19:13:16,546 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:13:16,546 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:13:16,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:13:16,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:16,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:16,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:16,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:16,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:16,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:16,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:16,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:16,677 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 19:13:16,677 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314511248] [2019-10-13 19:13:16,677 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276939726] [2019-10-13 19:13:16,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:13:16,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:16,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 19:13:16,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:13:16,919 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 19:13:16,919 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:13:16,920 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 10 [2019-10-13 19:13:16,920 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10157078] [2019-10-13 19:13:16,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 19:13:16,922 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:13:16,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 19:13:16,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:13:16,923 INFO L87 Difference]: Start difference. First operand 107 states and 139 transitions. Second operand 10 states. [2019-10-13 19:13:17,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:13:17,317 INFO L93 Difference]: Finished difference Result 145 states and 184 transitions. [2019-10-13 19:13:17,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 19:13:17,318 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 60 [2019-10-13 19:13:17,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:13:17,321 INFO L225 Difference]: With dead ends: 145 [2019-10-13 19:13:17,321 INFO L226 Difference]: Without dead ends: 119 [2019-10-13 19:13:17,321 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-10-13 19:13:17,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-10-13 19:13:17,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 113. [2019-10-13 19:13:17,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-10-13 19:13:17,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 146 transitions. [2019-10-13 19:13:17,393 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 146 transitions. Word has length 60 [2019-10-13 19:13:17,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:13:17,394 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 146 transitions. [2019-10-13 19:13:17,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 19:13:17,394 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 146 transitions. [2019-10-13 19:13:17,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-13 19:13:17,396 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:13:17,396 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:13:17,601 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:13:17,602 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:13:17,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:13:17,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1118535150, now seen corresponding path program 2 times [2019-10-13 19:13:17,603 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:13:17,603 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679758392] [2019-10-13 19:13:17,603 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:13:17,603 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:13:17,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:13:17,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:17,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:17,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:17,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:17,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:17,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:17,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:17,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:17,765 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 19:13:17,765 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679758392] [2019-10-13 19:13:17,765 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417407474] [2019-10-13 19:13:17,765 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:13:18,048 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-13 19:13:18,049 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 19:13:18,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-13 19:13:18,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:13:18,087 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-13 19:13:18,088 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:13:18,088 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 12 [2019-10-13 19:13:18,088 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918139147] [2019-10-13 19:13:18,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 19:13:18,089 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:13:18,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 19:13:18,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-10-13 19:13:18,090 INFO L87 Difference]: Start difference. First operand 113 states and 146 transitions. Second operand 12 states. [2019-10-13 19:13:18,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:13:18,526 INFO L93 Difference]: Finished difference Result 158 states and 197 transitions. [2019-10-13 19:13:18,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-13 19:13:18,527 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2019-10-13 19:13:18,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:13:18,533 INFO L225 Difference]: With dead ends: 158 [2019-10-13 19:13:18,533 INFO L226 Difference]: Without dead ends: 117 [2019-10-13 19:13:18,535 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2019-10-13 19:13:18,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-10-13 19:13:18,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 109. [2019-10-13 19:13:18,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-10-13 19:13:18,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 134 transitions. [2019-10-13 19:13:18,563 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 134 transitions. Word has length 60 [2019-10-13 19:13:18,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:13:18,564 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 134 transitions. [2019-10-13 19:13:18,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 19:13:18,566 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 134 transitions. [2019-10-13 19:13:18,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-13 19:13:18,568 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:13:18,568 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:13:18,768 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:13:18,769 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:13:18,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:13:18,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1221148414, now seen corresponding path program 3 times [2019-10-13 19:13:18,770 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:13:18,770 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44540618] [2019-10-13 19:13:18,770 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:13:18,770 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:13:18,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:13:18,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:18,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:18,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:18,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:18,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:18,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:18,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:18,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:18,883 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 19:13:18,883 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44540618] [2019-10-13 19:13:18,883 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342742244] [2019-10-13 19:13:18,884 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:13:19,191 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-13 19:13:19,191 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 19:13:19,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 19:13:19,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:13:19,243 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-13 19:13:19,244 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:13:19,244 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 10 [2019-10-13 19:13:19,244 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652622446] [2019-10-13 19:13:19,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 19:13:19,245 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:13:19,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 19:13:19,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:13:19,246 INFO L87 Difference]: Start difference. First operand 109 states and 134 transitions. Second operand 10 states. [2019-10-13 19:13:19,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:13:19,630 INFO L93 Difference]: Finished difference Result 148 states and 177 transitions. [2019-10-13 19:13:19,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 19:13:19,631 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 60 [2019-10-13 19:13:19,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:13:19,633 INFO L225 Difference]: With dead ends: 148 [2019-10-13 19:13:19,633 INFO L226 Difference]: Without dead ends: 115 [2019-10-13 19:13:19,634 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-10-13 19:13:19,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-10-13 19:13:19,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 109. [2019-10-13 19:13:19,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-10-13 19:13:19,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 131 transitions. [2019-10-13 19:13:19,661 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 131 transitions. Word has length 60 [2019-10-13 19:13:19,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:13:19,661 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 131 transitions. [2019-10-13 19:13:19,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 19:13:19,662 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 131 transitions. [2019-10-13 19:13:19,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-13 19:13:19,663 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:13:19,663 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:13:19,876 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:13:19,877 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:13:19,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:13:19,877 INFO L82 PathProgramCache]: Analyzing trace with hash -2045941912, now seen corresponding path program 4 times [2019-10-13 19:13:19,877 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:13:19,877 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559746866] [2019-10-13 19:13:19,877 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:13:19,878 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:13:19,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:13:19,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:19,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:19,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:19,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:19,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:20,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:20,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:20,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:20,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:20,051 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-13 19:13:20,051 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559746866] [2019-10-13 19:13:20,051 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366549566] [2019-10-13 19:13:20,052 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:13:20,177 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 19:13:20,178 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 19:13:20,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-13 19:13:20,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:13:20,248 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-13 19:13:20,248 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 19:13:20,248 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 13 [2019-10-13 19:13:20,249 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338899686] [2019-10-13 19:13:20,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:13:20,252 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:13:20,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:13:20,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-10-13 19:13:20,253 INFO L87 Difference]: Start difference. First operand 109 states and 131 transitions. Second operand 6 states. [2019-10-13 19:13:20,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:13:20,293 INFO L93 Difference]: Finished difference Result 164 states and 193 transitions. [2019-10-13 19:13:20,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 19:13:20,293 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-10-13 19:13:20,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:13:20,296 INFO L225 Difference]: With dead ends: 164 [2019-10-13 19:13:20,296 INFO L226 Difference]: Without dead ends: 112 [2019-10-13 19:13:20,297 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-10-13 19:13:20,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-10-13 19:13:20,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 108. [2019-10-13 19:13:20,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-10-13 19:13:20,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 126 transitions. [2019-10-13 19:13:20,317 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 126 transitions. Word has length 68 [2019-10-13 19:13:20,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:13:20,318 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 126 transitions. [2019-10-13 19:13:20,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:13:20,319 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 126 transitions. [2019-10-13 19:13:20,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-10-13 19:13:20,320 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:13:20,320 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:13:20,520 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:13:20,521 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:13:20,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:13:20,522 INFO L82 PathProgramCache]: Analyzing trace with hash 715119440, now seen corresponding path program 1 times [2019-10-13 19:13:20,522 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:13:20,522 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732091181] [2019-10-13 19:13:20,523 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:13:20,523 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:13:20,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:13:20,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:20,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:20,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:20,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:20,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:20,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:20,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:20,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:20,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:20,665 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-13 19:13:20,665 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732091181] [2019-10-13 19:13:20,666 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426436358] [2019-10-13 19:13:20,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:13:20,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:20,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-13 19:13:20,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:13:20,831 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-13 19:13:20,831 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 19:13:20,832 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2019-10-13 19:13:20,832 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007083493] [2019-10-13 19:13:20,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:13:20,832 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:13:20,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:13:20,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-13 19:13:20,833 INFO L87 Difference]: Start difference. First operand 108 states and 126 transitions. Second operand 6 states. [2019-10-13 19:13:20,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:13:20,896 INFO L93 Difference]: Finished difference Result 114 states and 130 transitions. [2019-10-13 19:13:20,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 19:13:20,897 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-10-13 19:13:20,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:13:20,898 INFO L225 Difference]: With dead ends: 114 [2019-10-13 19:13:20,898 INFO L226 Difference]: Without dead ends: 110 [2019-10-13 19:13:20,899 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-13 19:13:20,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-10-13 19:13:20,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2019-10-13 19:13:20,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-10-13 19:13:20,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 124 transitions. [2019-10-13 19:13:20,909 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 124 transitions. Word has length 69 [2019-10-13 19:13:20,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:13:20,910 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 124 transitions. [2019-10-13 19:13:20,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:13:20,910 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 124 transitions. [2019-10-13 19:13:20,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-10-13 19:13:20,911 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:13:20,911 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:13:21,123 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:13:21,124 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:13:21,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:13:21,125 INFO L82 PathProgramCache]: Analyzing trace with hash 2055631537, now seen corresponding path program 5 times [2019-10-13 19:13:21,125 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:13:21,125 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149180756] [2019-10-13 19:13:21,125 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:13:21,126 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:13:21,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:13:21,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:21,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:21,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:21,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:21,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:21,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:21,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:21,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:21,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:21,354 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-13 19:13:21,354 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149180756] [2019-10-13 19:13:21,355 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873650414] [2019-10-13 19:13:21,355 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:13:21,651 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-10-13 19:13:21,651 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 19:13:21,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-13 19:13:21,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:13:21,675 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-13 19:13:21,675 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:13:21,675 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 10 [2019-10-13 19:13:21,675 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962946208] [2019-10-13 19:13:21,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 19:13:21,676 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:13:21,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 19:13:21,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:13:21,677 INFO L87 Difference]: Start difference. First operand 108 states and 124 transitions. Second operand 10 states. [2019-10-13 19:13:22,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:13:22,024 INFO L93 Difference]: Finished difference Result 121 states and 135 transitions. [2019-10-13 19:13:22,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 19:13:22,026 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 69 [2019-10-13 19:13:22,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:13:22,027 INFO L225 Difference]: With dead ends: 121 [2019-10-13 19:13:22,027 INFO L226 Difference]: Without dead ends: 75 [2019-10-13 19:13:22,028 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-10-13 19:13:22,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-10-13 19:13:22,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-10-13 19:13:22,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-13 19:13:22,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2019-10-13 19:13:22,044 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 69 [2019-10-13 19:13:22,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:13:22,044 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2019-10-13 19:13:22,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 19:13:22,045 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2019-10-13 19:13:22,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-13 19:13:22,045 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:13:22,046 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:13:22,246 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:13:22,247 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:13:22,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:13:22,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1258476015, now seen corresponding path program 1 times [2019-10-13 19:13:22,248 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:13:22,248 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672796721] [2019-10-13 19:13:22,248 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:13:22,249 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:13:22,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:13:22,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:22,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:22,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:22,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:22,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:23,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:23,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:23,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:23,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:23,756 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 19:13:23,757 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672796721] [2019-10-13 19:13:23,757 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932311091] [2019-10-13 19:13:23,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:13:23,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:23,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 110 conjunts are in the unsatisfiable core [2019-10-13 19:13:23,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:13:23,965 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-13 19:13:23,965 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:13:23,966 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:13:23,966 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:13:23,967 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-10-13 19:13:24,240 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:13:24,241 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 15 [2019-10-13 19:13:24,241 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:13:24,245 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:13:24,245 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:13:24,245 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-10-13 19:13:24,288 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-13 19:13:24,288 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:13:24,295 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:13:24,295 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:13:24,296 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-10-13 19:13:24,357 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-10-13 19:13:24,358 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:13:24,366 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:13:24,366 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 19:13:24,367 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2019-10-13 19:13:24,641 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-10-13 19:13:24,642 INFO L341 Elim1Store]: treesize reduction 67, result has 62.8 percent of original size [2019-10-13 19:13:24,643 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 71 treesize of output 132 [2019-10-13 19:13:24,645 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:13:24,682 INFO L567 ElimStorePlain]: treesize reduction 155, result has 25.1 percent of original size [2019-10-13 19:13:24,683 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-13 19:13:24,684 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:71, output treesize:52 [2019-10-13 19:13:25,120 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2019-10-13 19:13:25,120 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:13:25,126 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:13:25,126 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 19:13:25,127 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:23 [2019-10-13 19:13:25,771 WARN L860 $PredicateComparison]: unable to prove that (exists ((dll_circular_update_at_~head.offset Int)) (and (= (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base| (let ((.cse0 (+ dll_circular_update_at_~head.offset 8))) (store (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.base| |c_dll_circular_update_at_#in~head.base|) .cse0)))) |c_#memory_$Pointer$.base|) (<= |c_dll_circular_update_at_#in~head.offset| dll_circular_update_at_~head.offset))) is different from true [2019-10-13 19:13:25,793 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:13:25,794 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:13:25,795 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:13:25,860 INFO L341 Elim1Store]: treesize reduction 28, result has 65.0 percent of original size [2019-10-13 19:13:25,861 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 58 treesize of output 81 [2019-10-13 19:13:25,862 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:13:25,898 INFO L567 ElimStorePlain]: treesize reduction 72, result has 40.0 percent of original size [2019-10-13 19:13:25,899 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 19:13:25,900 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:67, output treesize:45 [2019-10-13 19:13:26,352 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2019-10-13 19:13:26,352 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:13:26,369 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:13:26,370 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:13:26,370 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:104, output treesize:96 [2019-10-13 19:13:26,470 INFO L392 ElimStorePlain]: Different costs {2=[|v_old(#memory_$Pointer$.offset)_AFTER_CALL_51|], 12=[|v_#memory_$Pointer$.base_BEFORE_CALL_8|]} [2019-10-13 19:13:26,475 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:13:26,476 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 80 [2019-10-13 19:13:26,477 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:13:26,499 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:13:26,699 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-10-13 19:13:26,699 INFO L341 Elim1Store]: treesize reduction 10, result has 95.4 percent of original size [2019-10-13 19:13:26,700 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 97 treesize of output 260 [2019-10-13 19:13:26,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:13:26,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:13:26,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:13:26,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:13:26,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:13:26,707 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-10-13 19:13:26,829 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2019-10-13 19:13:26,829 INFO L567 ElimStorePlain]: treesize reduction 566, result has 11.0 percent of original size [2019-10-13 19:13:26,830 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:13:26,830 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:139, output treesize:44 [2019-10-13 19:13:27,859 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.offset|, |#memory_int|], 12=[|#memory_$Pointer$.base|]} [2019-10-13 19:13:27,872 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:13:27,873 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 52 treesize of output 52 [2019-10-13 19:13:27,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:13:27,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:13:27,876 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-13 19:13:27,909 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:13:27,930 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:13:27,931 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 34 [2019-10-13 19:13:27,932 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:13:27,979 INFO L567 ElimStorePlain]: treesize reduction 24, result has 71.8 percent of original size [2019-10-13 19:13:27,986 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:13:27,987 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:13:28,035 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:13:28,035 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 71 [2019-10-13 19:13:28,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:13:28,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:13:28,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:13:28,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:13:28,038 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 19:13:28,052 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:13:28,053 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:13:28,053 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:97, output treesize:7 [2019-10-13 19:13:28,133 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2019-10-13 19:13:28,133 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:13:28,133 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 67 [2019-10-13 19:13:28,134 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996043821] [2019-10-13 19:13:28,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-10-13 19:13:28,135 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:13:28,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-10-13 19:13:28,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=4094, Unknown=1, NotChecked=128, Total=4422 [2019-10-13 19:13:28,136 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand 67 states.