/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 20:57:10,865 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 20:57:10,869 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 20:57:10,887 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 20:57:10,888 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 20:57:10,890 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 20:57:10,892 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 20:57:10,902 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 20:57:10,906 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 20:57:10,910 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 20:57:10,913 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 20:57:10,915 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 20:57:10,915 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 20:57:10,917 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 20:57:10,919 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 20:57:10,920 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 20:57:10,922 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 20:57:10,922 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 20:57:10,924 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 20:57:10,928 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 20:57:10,933 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 20:57:10,935 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 20:57:10,938 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 20:57:10,939 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 20:57:10,943 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 20:57:10,943 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 20:57:10,943 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 20:57:10,945 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 20:57:10,945 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 20:57:10,947 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 20:57:10,947 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 20:57:10,948 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 20:57:10,948 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 20:57:10,949 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 20:57:10,950 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 20:57:10,951 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 20:57:10,951 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 20:57:10,952 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 20:57:10,952 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 20:57:10,953 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 20:57:10,953 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 20:57:10,954 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-06 20:57:10,991 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 20:57:10,991 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 20:57:10,994 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 20:57:10,995 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 20:57:10,995 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 20:57:10,995 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 20:57:10,995 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 20:57:10,996 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 20:57:10,996 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 20:57:10,996 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 20:57:10,996 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 20:57:10,996 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 20:57:10,996 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 20:57:10,997 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 20:57:10,997 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 20:57:10,997 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 20:57:10,997 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 20:57:10,997 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 20:57:10,999 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 20:57:10,999 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 20:57:10,999 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 20:57:10,999 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 20:57:10,999 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 20:57:11,000 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 20:57:11,000 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 20:57:11,000 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 20:57:11,001 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 20:57:11,001 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 20:57:11,001 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 20:57:11,306 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 20:57:11,320 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 20:57:11,323 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 20:57:11,324 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 20:57:11,325 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 20:57:11,325 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point.cil.out.i [2019-11-06 20:57:11,388 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cde88987a/4568e3408b1f4468aea80bc2c6ac507c/FLAGa7856506b [2019-11-06 20:57:12,139 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 20:57:12,140 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point.cil.out.i [2019-11-06 20:57:12,183 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cde88987a/4568e3408b1f4468aea80bc2c6ac507c/FLAGa7856506b [2019-11-06 20:57:12,265 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cde88987a/4568e3408b1f4468aea80bc2c6ac507c [2019-11-06 20:57:12,273 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 20:57:12,274 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 20:57:12,275 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 20:57:12,276 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 20:57:12,279 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 20:57:12,280 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:57:12" (1/1) ... [2019-11-06 20:57:12,283 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@91f3dac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:57:12, skipping insertion in model container [2019-11-06 20:57:12,283 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:57:12" (1/1) ... [2019-11-06 20:57:12,290 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 20:57:12,415 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 20:57:13,569 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 20:57:13,599 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 20:57:13,833 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 20:57:13,906 INFO L192 MainTranslator]: Completed translation [2019-11-06 20:57:13,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:57:13 WrapperNode [2019-11-06 20:57:13,908 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 20:57:13,908 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 20:57:13,909 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 20:57:13,909 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 20:57:13,927 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:57:13" (1/1) ... [2019-11-06 20:57:13,927 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:57:13" (1/1) ... [2019-11-06 20:57:13,981 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:57:13" (1/1) ... [2019-11-06 20:57:13,981 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:57:13" (1/1) ... [2019-11-06 20:57:14,020 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:57:13" (1/1) ... [2019-11-06 20:57:14,071 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:57:13" (1/1) ... [2019-11-06 20:57:14,079 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:57:13" (1/1) ... [2019-11-06 20:57:14,088 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 20:57:14,088 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 20:57:14,089 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 20:57:14,089 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 20:57:14,093 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:57:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 20:57:14,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 20:57:14,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 20:57:14,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~int~TO~int [2019-11-06 20:57:14,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2019-11-06 20:57:14,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-11-06 20:57:14,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-11-06 20:57:14,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2019-11-06 20:57:14,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2019-11-06 20:57:14,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2019-11-06 20:57:14,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ptr [2019-11-06 20:57:14,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ulong [2019-11-06 20:57:14,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2019-11-06 20:57:14,159 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_sock [2019-11-06 20:57:14,159 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_sk [2019-11-06 20:57:14,160 INFO L138 BoogieDeclarations]: Found implementation of procedure register_pppox_proto [2019-11-06 20:57:14,160 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_pppox_proto [2019-11-06 20:57:14,162 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_unbind_sock [2019-11-06 20:57:14,162 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_ioctl [2019-11-06 20:57:14,163 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_create [2019-11-06 20:57:14,163 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_init [2019-11-06 20:57:14,163 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_exit [2019-11-06 20:57:14,163 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 20:57:14,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_try_module_get_5 [2019-11-06 20:57:14,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put_6 [2019-11-06 20:57:14,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2019-11-06 20:57:14,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2019-11-06 20:57:14,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_err_ptr [2019-11-06 20:57:14,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_ptr_err [2019-11-06 20:57:14,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err_or_null [2019-11-06 20:57:14,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_get [2019-11-06 20:57:14,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_try_module_get [2019-11-06 20:57:14,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2019-11-06 20:57:14,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put_and_exit [2019-11-06 20:57:14,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_refcount [2019-11-06 20:57:14,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2019-11-06 20:57:14,165 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_fault [2019-11-06 20:57:14,165 INFO L138 BoogieDeclarations]: Found implementation of procedure __request_module [2019-11-06 20:57:14,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2019-11-06 20:57:14,166 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_sock_nested [2019-11-06 20:57:14,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_channel_index [2019-11-06 20:57:14,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_unregister_channel [2019-11-06 20:57:14,166 INFO L138 BoogieDeclarations]: Found implementation of procedure release_sock [2019-11-06 20:57:14,167 INFO L138 BoogieDeclarations]: Found implementation of procedure sock_register [2019-11-06 20:57:14,167 INFO L138 BoogieDeclarations]: Found implementation of procedure sock_unregister [2019-11-06 20:57:14,167 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2019-11-06 20:57:14,167 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-11-06 20:57:14,168 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-11-06 20:57:14,168 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-06 20:57:14,168 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 20:57:14,168 INFO L130 BoogieDeclarations]: Found specification of procedure __might_fault [2019-11-06 20:57:14,168 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-11-06 20:57:14,168 INFO L130 BoogieDeclarations]: Found specification of procedure __request_module [2019-11-06 20:57:14,168 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_try_module_get_5 [2019-11-06 20:57:14,169 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put_6 [2019-11-06 20:57:14,169 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_try_module_get [2019-11-06 20:57:14,169 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2019-11-06 20:57:14,169 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-06 20:57:14,170 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-06 20:57:14,170 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 20:57:14,170 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-11-06 20:57:14,170 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-11-06 20:57:14,170 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-06 20:57:14,170 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-11-06 20:57:14,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-06 20:57:14,171 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-11-06 20:57:14,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-06 20:57:14,171 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2019-11-06 20:57:14,171 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2019-11-06 20:57:14,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-11-06 20:57:14,172 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2019-11-06 20:57:14,172 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ptr [2019-11-06 20:57:14,172 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ulong [2019-11-06 20:57:14,172 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2019-11-06 20:57:14,172 INFO L130 BoogieDeclarations]: Found specification of procedure sock_register [2019-11-06 20:57:14,173 INFO L130 BoogieDeclarations]: Found specification of procedure sock_unregister [2019-11-06 20:57:14,173 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_unregister_channel [2019-11-06 20:57:14,173 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_channel_index [2019-11-06 20:57:14,173 INFO L130 BoogieDeclarations]: Found specification of procedure lock_sock_nested [2019-11-06 20:57:14,174 INFO L130 BoogieDeclarations]: Found specification of procedure lock_sock [2019-11-06 20:57:14,174 INFO L130 BoogieDeclarations]: Found specification of procedure release_sock [2019-11-06 20:57:14,174 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_sk [2019-11-06 20:57:14,174 INFO L130 BoogieDeclarations]: Found specification of procedure register_pppox_proto [2019-11-06 20:57:14,174 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_pppox_proto [2019-11-06 20:57:14,175 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_unbind_sock [2019-11-06 20:57:14,175 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_ioctl [2019-11-06 20:57:14,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-06 20:57:14,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-06 20:57:14,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-06 20:57:14,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-06 20:57:14,176 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-06 20:57:14,177 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~int~TO~int [2019-11-06 20:57:14,177 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_create [2019-11-06 20:57:14,177 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2019-11-06 20:57:14,177 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_init [2019-11-06 20:57:14,177 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_exit [2019-11-06 20:57:14,177 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2019-11-06 20:57:14,177 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2019-11-06 20:57:14,178 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 20:57:14,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-06 20:57:14,178 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2019-11-06 20:57:14,178 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2019-11-06 20:57:14,178 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_err_ptr [2019-11-06 20:57:14,178 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_ptr_err [2019-11-06 20:57:14,178 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err_or_null [2019-11-06 20:57:14,179 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_get [2019-11-06 20:57:14,179 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put_and_exit [2019-11-06 20:57:14,179 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_refcount [2019-11-06 20:57:14,179 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2019-11-06 20:57:14,179 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-06 20:57:14,179 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-11-06 20:57:14,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 20:57:14,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-06 20:57:14,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-06 20:57:14,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 20:57:14,813 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2019-11-06 20:57:14,830 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_module_put_and_exitFINAL: assume true; [2019-11-06 20:57:15,096 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 20:57:15,096 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-06 20:57:15,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:57:15 BoogieIcfgContainer [2019-11-06 20:57:15,098 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 20:57:15,099 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 20:57:15,099 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 20:57:15,102 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 20:57:15,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 08:57:12" (1/3) ... [2019-11-06 20:57:15,103 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ce1c8e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:57:15, skipping insertion in model container [2019-11-06 20:57:15,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:57:13" (2/3) ... [2019-11-06 20:57:15,104 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ce1c8e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:57:15, skipping insertion in model container [2019-11-06 20:57:15,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:57:15" (3/3) ... [2019-11-06 20:57:15,105 INFO L109 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point.cil.out.i [2019-11-06 20:57:15,115 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 20:57:15,123 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 20:57:15,135 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 20:57:15,161 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 20:57:15,161 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 20:57:15,161 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 20:57:15,161 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 20:57:15,161 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 20:57:15,162 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 20:57:15,162 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 20:57:15,162 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 20:57:15,183 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states. [2019-11-06 20:57:15,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-06 20:57:15,192 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 20:57:15,193 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 20:57:15,196 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 20:57:15,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 20:57:15,202 INFO L82 PathProgramCache]: Analyzing trace with hash 945988663, now seen corresponding path program 1 times [2019-11-06 20:57:15,211 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 20:57:15,211 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891896970] [2019-11-06 20:57:15,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 20:57:15,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:15,996 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-11-06 20:57:16,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:16,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:16,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:16,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:16,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:16,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:16,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:16,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:16,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:16,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:16,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:16,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:16,277 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-06 20:57:16,277 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891896970] [2019-11-06 20:57:16,278 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 20:57:16,279 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-06 20:57:16,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454901528] [2019-11-06 20:57:16,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-06 20:57:16,285 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 20:57:16,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-06 20:57:16,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-06 20:57:16,301 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 7 states. [2019-11-06 20:57:16,535 WARN L191 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-11-06 20:57:17,093 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2019-11-06 20:57:18,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 20:57:18,155 INFO L93 Difference]: Finished difference Result 351 states and 450 transitions. [2019-11-06 20:57:18,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-06 20:57:18,158 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2019-11-06 20:57:18,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 20:57:18,184 INFO L225 Difference]: With dead ends: 351 [2019-11-06 20:57:18,184 INFO L226 Difference]: Without dead ends: 234 [2019-11-06 20:57:18,192 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-11-06 20:57:18,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-11-06 20:57:18,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 187. [2019-11-06 20:57:18,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-11-06 20:57:18,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 227 transitions. [2019-11-06 20:57:18,280 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 227 transitions. Word has length 69 [2019-11-06 20:57:18,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 20:57:18,281 INFO L462 AbstractCegarLoop]: Abstraction has 187 states and 227 transitions. [2019-11-06 20:57:18,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-06 20:57:18,282 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 227 transitions. [2019-11-06 20:57:18,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-06 20:57:18,285 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 20:57:18,285 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 20:57:18,286 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 20:57:18,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 20:57:18,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1444090839, now seen corresponding path program 1 times [2019-11-06 20:57:18,287 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 20:57:18,287 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087452041] [2019-11-06 20:57:18,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 20:57:18,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:18,518 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-11-06 20:57:18,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:18,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:18,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:18,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:18,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:18,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:18,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:18,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:18,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:18,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:18,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:18,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:18,671 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-06 20:57:18,672 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087452041] [2019-11-06 20:57:18,672 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 20:57:18,672 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-06 20:57:18,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152047519] [2019-11-06 20:57:18,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-06 20:57:18,674 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 20:57:18,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-06 20:57:18,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-06 20:57:18,675 INFO L87 Difference]: Start difference. First operand 187 states and 227 transitions. Second operand 7 states. [2019-11-06 20:57:18,845 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-11-06 20:57:19,040 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2019-11-06 20:57:19,207 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2019-11-06 20:57:19,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 20:57:19,922 INFO L93 Difference]: Finished difference Result 241 states and 291 transitions. [2019-11-06 20:57:19,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-06 20:57:19,923 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-11-06 20:57:19,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 20:57:19,926 INFO L225 Difference]: With dead ends: 241 [2019-11-06 20:57:19,926 INFO L226 Difference]: Without dead ends: 236 [2019-11-06 20:57:19,927 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-11-06 20:57:19,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-11-06 20:57:19,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 187. [2019-11-06 20:57:19,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-11-06 20:57:19,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 226 transitions. [2019-11-06 20:57:19,997 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 226 transitions. Word has length 74 [2019-11-06 20:57:19,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 20:57:19,998 INFO L462 AbstractCegarLoop]: Abstraction has 187 states and 226 transitions. [2019-11-06 20:57:19,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-06 20:57:19,998 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 226 transitions. [2019-11-06 20:57:20,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-06 20:57:20,000 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 20:57:20,000 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 20:57:20,001 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 20:57:20,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 20:57:20,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1501349141, now seen corresponding path program 1 times [2019-11-06 20:57:20,001 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 20:57:20,002 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439649721] [2019-11-06 20:57:20,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 20:57:20,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:20,266 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-11-06 20:57:20,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:20,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:20,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:20,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:20,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:20,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:20,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:20,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:20,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:20,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:20,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:20,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:20,441 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-06 20:57:20,442 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439649721] [2019-11-06 20:57:20,442 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 20:57:20,443 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-06 20:57:20,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154573585] [2019-11-06 20:57:20,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-06 20:57:20,444 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 20:57:20,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-06 20:57:20,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-06 20:57:20,444 INFO L87 Difference]: Start difference. First operand 187 states and 226 transitions. Second operand 7 states. [2019-11-06 20:57:20,637 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-11-06 20:57:20,857 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2019-11-06 20:57:21,088 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2019-11-06 20:57:22,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 20:57:22,213 INFO L93 Difference]: Finished difference Result 534 states and 669 transitions. [2019-11-06 20:57:22,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-06 20:57:22,215 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-11-06 20:57:22,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 20:57:22,222 INFO L225 Difference]: With dead ends: 534 [2019-11-06 20:57:22,222 INFO L226 Difference]: Without dead ends: 371 [2019-11-06 20:57:22,227 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-11-06 20:57:22,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-11-06 20:57:22,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 361. [2019-11-06 20:57:22,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-11-06 20:57:22,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 449 transitions. [2019-11-06 20:57:22,305 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 449 transitions. Word has length 74 [2019-11-06 20:57:22,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 20:57:22,306 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 449 transitions. [2019-11-06 20:57:22,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-06 20:57:22,306 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 449 transitions. [2019-11-06 20:57:22,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-06 20:57:22,312 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 20:57:22,313 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 20:57:22,313 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 20:57:22,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 20:57:22,313 INFO L82 PathProgramCache]: Analyzing trace with hash -173204652, now seen corresponding path program 1 times [2019-11-06 20:57:22,314 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 20:57:22,315 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199865392] [2019-11-06 20:57:22,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 20:57:22,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:22,529 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-11-06 20:57:22,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:22,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:22,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:22,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:22,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:22,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:22,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:22,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:22,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:22,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:22,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:22,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:22,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:22,697 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-06 20:57:22,698 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199865392] [2019-11-06 20:57:22,698 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 20:57:22,699 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-06 20:57:22,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952630513] [2019-11-06 20:57:22,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-06 20:57:22,700 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 20:57:22,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-06 20:57:22,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-06 20:57:22,701 INFO L87 Difference]: Start difference. First operand 361 states and 449 transitions. Second operand 8 states. [2019-11-06 20:57:22,843 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-11-06 20:57:23,049 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2019-11-06 20:57:23,249 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2019-11-06 20:57:24,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 20:57:24,292 INFO L93 Difference]: Finished difference Result 783 states and 985 transitions. [2019-11-06 20:57:24,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-06 20:57:24,293 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 88 [2019-11-06 20:57:24,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 20:57:24,297 INFO L225 Difference]: With dead ends: 783 [2019-11-06 20:57:24,297 INFO L226 Difference]: Without dead ends: 456 [2019-11-06 20:57:24,300 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-11-06 20:57:24,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2019-11-06 20:57:24,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 437. [2019-11-06 20:57:24,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2019-11-06 20:57:24,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 549 transitions. [2019-11-06 20:57:24,349 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 549 transitions. Word has length 88 [2019-11-06 20:57:24,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 20:57:24,349 INFO L462 AbstractCegarLoop]: Abstraction has 437 states and 549 transitions. [2019-11-06 20:57:24,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-06 20:57:24,349 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 549 transitions. [2019-11-06 20:57:24,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-06 20:57:24,351 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 20:57:24,352 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 20:57:24,352 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 20:57:24,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 20:57:24,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1275114055, now seen corresponding path program 1 times [2019-11-06 20:57:24,353 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 20:57:24,353 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008584895] [2019-11-06 20:57:24,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 20:57:24,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:24,693 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-11-06 20:57:24,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:24,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:24,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:24,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:24,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:24,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:24,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:24,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:24,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:24,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:24,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:24,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:24,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:24,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:24,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:25,013 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-06 20:57:25,013 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008584895] [2019-11-06 20:57:25,013 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21379434] [2019-11-06 20:57:25,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 20:57:25,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:25,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 971 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-06 20:57:25,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 20:57:25,512 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-06 20:57:25,512 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-06 20:57:25,513 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2019-11-06 20:57:25,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117307423] [2019-11-06 20:57:25,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-06 20:57:25,515 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 20:57:25,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-06 20:57:25,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2019-11-06 20:57:25,518 INFO L87 Difference]: Start difference. First operand 437 states and 549 transitions. Second operand 7 states. [2019-11-06 20:57:25,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 20:57:25,613 INFO L93 Difference]: Finished difference Result 860 states and 1087 transitions. [2019-11-06 20:57:25,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 20:57:25,613 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 107 [2019-11-06 20:57:25,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 20:57:25,623 INFO L225 Difference]: With dead ends: 860 [2019-11-06 20:57:25,623 INFO L226 Difference]: Without dead ends: 457 [2019-11-06 20:57:25,625 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2019-11-06 20:57:25,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2019-11-06 20:57:25,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 429. [2019-11-06 20:57:25,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-11-06 20:57:25,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 535 transitions. [2019-11-06 20:57:25,689 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 535 transitions. Word has length 107 [2019-11-06 20:57:25,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 20:57:25,690 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 535 transitions. [2019-11-06 20:57:25,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-06 20:57:25,690 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 535 transitions. [2019-11-06 20:57:25,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-06 20:57:25,692 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 20:57:25,692 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 20:57:25,897 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 20:57:25,897 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 20:57:25,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 20:57:25,897 INFO L82 PathProgramCache]: Analyzing trace with hash -4749623, now seen corresponding path program 1 times [2019-11-06 20:57:25,898 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 20:57:25,898 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132704141] [2019-11-06 20:57:25,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 20:57:25,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:26,157 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-11-06 20:57:26,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:26,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:26,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:26,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:26,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:26,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:26,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:26,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:26,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:26,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:26,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:26,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:26,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:26,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:26,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:26,339 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-06 20:57:26,339 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132704141] [2019-11-06 20:57:26,339 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166381945] [2019-11-06 20:57:26,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 20:57:26,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:26,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 972 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-06 20:57:26,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 20:57:26,709 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-06 20:57:26,710 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-06 20:57:26,710 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2019-11-06 20:57:26,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180988622] [2019-11-06 20:57:26,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 20:57:26,712 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 20:57:26,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 20:57:26,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-06 20:57:26,716 INFO L87 Difference]: Start difference. First operand 429 states and 535 transitions. Second operand 3 states. [2019-11-06 20:57:26,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 20:57:26,777 INFO L93 Difference]: Finished difference Result 805 states and 1020 transitions. [2019-11-06 20:57:26,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 20:57:26,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-11-06 20:57:26,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 20:57:26,781 INFO L225 Difference]: With dead ends: 805 [2019-11-06 20:57:26,781 INFO L226 Difference]: Without dead ends: 410 [2019-11-06 20:57:26,783 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 133 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-06 20:57:26,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-11-06 20:57:26,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 392. [2019-11-06 20:57:26,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2019-11-06 20:57:26,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 488 transitions. [2019-11-06 20:57:26,843 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 488 transitions. Word has length 107 [2019-11-06 20:57:26,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 20:57:26,845 INFO L462 AbstractCegarLoop]: Abstraction has 392 states and 488 transitions. [2019-11-06 20:57:26,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 20:57:26,845 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 488 transitions. [2019-11-06 20:57:26,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-06 20:57:26,847 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 20:57:26,848 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 20:57:27,052 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 20:57:27,052 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 20:57:27,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 20:57:27,053 INFO L82 PathProgramCache]: Analyzing trace with hash 549282891, now seen corresponding path program 1 times [2019-11-06 20:57:27,053 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 20:57:27,053 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002388730] [2019-11-06 20:57:27,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 20:57:27,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:27,323 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-11-06 20:57:27,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:27,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:27,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:27,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:27,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:27,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:27,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:27,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:27,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:27,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:27,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:27,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:27,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:27,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:27,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:27,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:27,591 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-06 20:57:27,592 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002388730] [2019-11-06 20:57:27,592 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 20:57:27,592 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-06 20:57:27,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866652564] [2019-11-06 20:57:27,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-06 20:57:27,594 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 20:57:27,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-06 20:57:27,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-11-06 20:57:27,595 INFO L87 Difference]: Start difference. First operand 392 states and 488 transitions. Second operand 11 states. [2019-11-06 20:57:27,771 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-11-06 20:57:28,010 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2019-11-06 20:57:28,249 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2019-11-06 20:57:29,104 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2019-11-06 20:57:30,297 WARN L191 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 127 [2019-11-06 20:57:30,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 20:57:30,630 INFO L93 Difference]: Finished difference Result 631 states and 784 transitions. [2019-11-06 20:57:30,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-06 20:57:30,631 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 113 [2019-11-06 20:57:30,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 20:57:30,635 INFO L225 Difference]: With dead ends: 631 [2019-11-06 20:57:30,635 INFO L226 Difference]: Without dead ends: 628 [2019-11-06 20:57:30,636 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=131, Invalid=421, Unknown=0, NotChecked=0, Total=552 [2019-11-06 20:57:30,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2019-11-06 20:57:30,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 599. [2019-11-06 20:57:30,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-11-06 20:57:30,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 751 transitions. [2019-11-06 20:57:30,744 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 751 transitions. Word has length 113 [2019-11-06 20:57:30,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 20:57:30,745 INFO L462 AbstractCegarLoop]: Abstraction has 599 states and 751 transitions. [2019-11-06 20:57:30,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-06 20:57:30,745 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 751 transitions. [2019-11-06 20:57:30,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-06 20:57:30,748 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 20:57:30,748 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 20:57:30,748 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 20:57:30,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 20:57:30,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1039387099, now seen corresponding path program 1 times [2019-11-06 20:57:30,749 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 20:57:30,749 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809142863] [2019-11-06 20:57:30,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 20:57:30,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:30,965 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-11-06 20:57:30,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:30,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:31,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:31,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:31,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:31,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:31,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:31,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:31,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:31,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:31,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:31,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:31,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:31,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:31,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:31,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:31,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:31,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:31,146 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-06 20:57:31,147 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809142863] [2019-11-06 20:57:31,147 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 20:57:31,147 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-06 20:57:31,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375573362] [2019-11-06 20:57:31,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-06 20:57:31,148 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 20:57:31,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-06 20:57:31,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-06 20:57:31,149 INFO L87 Difference]: Start difference. First operand 599 states and 751 transitions. Second operand 8 states. [2019-11-06 20:57:31,294 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-11-06 20:57:32,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 20:57:32,219 INFO L93 Difference]: Finished difference Result 1047 states and 1312 transitions. [2019-11-06 20:57:32,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-06 20:57:32,219 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 122 [2019-11-06 20:57:32,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 20:57:32,225 INFO L225 Difference]: With dead ends: 1047 [2019-11-06 20:57:32,225 INFO L226 Difference]: Without dead ends: 625 [2019-11-06 20:57:32,227 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-06 20:57:32,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2019-11-06 20:57:32,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 599. [2019-11-06 20:57:32,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-11-06 20:57:32,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 747 transitions. [2019-11-06 20:57:32,287 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 747 transitions. Word has length 122 [2019-11-06 20:57:32,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 20:57:32,288 INFO L462 AbstractCegarLoop]: Abstraction has 599 states and 747 transitions. [2019-11-06 20:57:32,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-06 20:57:32,288 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 747 transitions. [2019-11-06 20:57:32,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-06 20:57:32,290 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 20:57:32,291 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 20:57:32,291 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 20:57:32,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 20:57:32,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1173400605, now seen corresponding path program 1 times [2019-11-06 20:57:32,291 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 20:57:32,292 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910046337] [2019-11-06 20:57:32,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 20:57:32,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:32,541 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-11-06 20:57:32,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:32,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:32,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:32,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:32,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:32,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:32,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:32,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:32,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:32,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:32,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:32,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:32,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:32,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:32,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:32,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:32,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:32,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:32,979 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-06 20:57:32,980 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910046337] [2019-11-06 20:57:32,980 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189030095] [2019-11-06 20:57:32,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 20:57:33,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:33,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 962 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-06 20:57:33,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 20:57:33,344 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-06 20:57:33,344 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-06 20:57:33,344 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 16 [2019-11-06 20:57:33,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540828222] [2019-11-06 20:57:33,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-06 20:57:33,345 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 20:57:33,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-06 20:57:33,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-11-06 20:57:33,346 INFO L87 Difference]: Start difference. First operand 599 states and 747 transitions. Second operand 7 states. [2019-11-06 20:57:33,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 20:57:33,430 INFO L93 Difference]: Finished difference Result 1025 states and 1278 transitions. [2019-11-06 20:57:33,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 20:57:33,431 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 122 [2019-11-06 20:57:33,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 20:57:33,434 INFO L225 Difference]: With dead ends: 1025 [2019-11-06 20:57:33,435 INFO L226 Difference]: Without dead ends: 603 [2019-11-06 20:57:33,436 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 152 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-11-06 20:57:33,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2019-11-06 20:57:33,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 597. [2019-11-06 20:57:33,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2019-11-06 20:57:33,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 741 transitions. [2019-11-06 20:57:33,493 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 741 transitions. Word has length 122 [2019-11-06 20:57:33,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 20:57:33,493 INFO L462 AbstractCegarLoop]: Abstraction has 597 states and 741 transitions. [2019-11-06 20:57:33,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-06 20:57:33,494 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 741 transitions. [2019-11-06 20:57:33,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-11-06 20:57:33,497 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 20:57:33,497 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 20:57:33,702 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 20:57:33,703 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 20:57:33,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 20:57:33,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1755090979, now seen corresponding path program 1 times [2019-11-06 20:57:33,704 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 20:57:33,704 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194762353] [2019-11-06 20:57:33,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 20:57:33,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:33,929 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-11-06 20:57:33,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:33,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:33,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:33,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:33,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:34,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:34,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:34,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:34,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:34,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:34,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:34,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:34,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:34,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:34,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:34,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:34,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:34,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:34,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:34,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:34,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:34,256 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-06 20:57:34,256 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194762353] [2019-11-06 20:57:34,256 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780433241] [2019-11-06 20:57:34,256 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-11-06 20:57:34,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:34,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 1042 conjuncts, 54 conjunts are in the unsatisfiable core [2019-11-06 20:57:34,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 20:57:34,694 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 20:57:34,696 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 20:57:34,697 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 20:57:34,699 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 20:57:34,700 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 20:57:34,702 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 20:57:34,715 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 13 [2019-11-06 20:57:34,717 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 20:57:34,734 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 20:57:34,740 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 20:57:34,742 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 20:57:34,743 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 20:57:34,744 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 20:57:34,745 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 20:57:34,746 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 20:57:34,748 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 20:57:34,748 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 13 [2019-11-06 20:57:34,749 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 20:57:34,759 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 20:57:34,760 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 20:57:34,760 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:10 [2019-11-06 20:57:34,816 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 20:57:34,817 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 20:57:34,819 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 20:57:34,820 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 20:57:34,821 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 20:57:34,822 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 20:57:34,823 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 13 [2019-11-06 20:57:34,824 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 20:57:34,842 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 20:57:34,846 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 20:57:34,848 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 20:57:34,851 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 20:57:34,852 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 20:57:34,854 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 20:57:34,855 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 20:57:34,856 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 20:57:34,857 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 13 [2019-11-06 20:57:34,857 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 20:57:34,864 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 20:57:34,865 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 20:57:34,865 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:10 [2019-11-06 20:57:35,285 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-06 20:57:35,285 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-06 20:57:35,285 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2019-11-06 20:57:35,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709275589] [2019-11-06 20:57:35,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-06 20:57:35,286 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 20:57:35,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-06 20:57:35,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2019-11-06 20:57:35,287 INFO L87 Difference]: Start difference. First operand 597 states and 741 transitions. Second operand 8 states. [2019-11-06 20:57:36,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 20:57:36,170 INFO L93 Difference]: Finished difference Result 1283 states and 1612 transitions. [2019-11-06 20:57:36,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-06 20:57:36,170 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 137 [2019-11-06 20:57:36,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 20:57:36,174 INFO L225 Difference]: With dead ends: 1283 [2019-11-06 20:57:36,175 INFO L226 Difference]: Without dead ends: 608 [2019-11-06 20:57:36,177 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 166 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2019-11-06 20:57:36,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-11-06 20:57:36,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608. [2019-11-06 20:57:36,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2019-11-06 20:57:36,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 755 transitions. [2019-11-06 20:57:36,242 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 755 transitions. Word has length 137 [2019-11-06 20:57:36,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 20:57:36,242 INFO L462 AbstractCegarLoop]: Abstraction has 608 states and 755 transitions. [2019-11-06 20:57:36,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-06 20:57:36,242 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 755 transitions. [2019-11-06 20:57:36,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-11-06 20:57:36,245 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 20:57:36,245 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 20:57:36,451 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 20:57:36,451 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 20:57:36,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 20:57:36,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1387744378, now seen corresponding path program 1 times [2019-11-06 20:57:36,452 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 20:57:36,452 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253723911] [2019-11-06 20:57:36,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 20:57:36,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:36,843 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-11-06 20:57:36,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:36,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:36,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:36,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:36,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:36,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:36,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:37,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:37,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:37,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:37,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:37,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:37,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:37,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:37,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:37,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:37,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:37,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:37,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:37,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:37,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:37,227 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-06 20:57:37,228 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253723911] [2019-11-06 20:57:37,228 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568855717] [2019-11-06 20:57:37,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-11-06 20:57:37,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:37,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 1048 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-06 20:57:37,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 20:57:37,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 20:57:37,548 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-06 20:57:37,549 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-06 20:57:37,549 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 13 [2019-11-06 20:57:37,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536524887] [2019-11-06 20:57:37,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 20:57:37,550 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 20:57:37,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 20:57:37,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-11-06 20:57:37,551 INFO L87 Difference]: Start difference. First operand 608 states and 755 transitions. Second operand 6 states. [2019-11-06 20:57:37,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 20:57:37,690 INFO L93 Difference]: Finished difference Result 1193 states and 1482 transitions. [2019-11-06 20:57:37,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 20:57:37,691 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 138 [2019-11-06 20:57:37,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 20:57:37,694 INFO L225 Difference]: With dead ends: 1193 [2019-11-06 20:57:37,695 INFO L226 Difference]: Without dead ends: 602 [2019-11-06 20:57:37,696 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-11-06 20:57:37,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-11-06 20:57:37,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 598. [2019-11-06 20:57:37,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-11-06 20:57:37,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 742 transitions. [2019-11-06 20:57:37,751 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 742 transitions. Word has length 138 [2019-11-06 20:57:37,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 20:57:37,752 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 742 transitions. [2019-11-06 20:57:37,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 20:57:37,752 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 742 transitions. [2019-11-06 20:57:37,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-11-06 20:57:37,754 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 20:57:37,755 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 20:57:37,959 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 20:57:37,960 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 20:57:37,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 20:57:37,960 INFO L82 PathProgramCache]: Analyzing trace with hash -377252935, now seen corresponding path program 2 times [2019-11-06 20:57:37,961 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 20:57:37,961 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724987162] [2019-11-06 20:57:37,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 20:57:38,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:38,221 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-11-06 20:57:38,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:38,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:38,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:38,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:38,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:38,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:38,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:38,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:38,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:38,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:38,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:38,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:38,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:38,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:38,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:38,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:38,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:38,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:38,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:38,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:38,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 20:57:38,508 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-06 20:57:38,508 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724987162] [2019-11-06 20:57:38,509 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923051779] [2019-11-06 20:57:38,509 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 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-11-06 20:57:38,853 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-06 20:57:38,853 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 20:57:38,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 1054 conjuncts, 87 conjunts are in the unsatisfiable core [2019-11-06 20:57:38,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 20:57:39,010 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-11-06 20:57:39,011 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 20:57:39,024 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 20:57:39,033 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-11-06 20:57:39,034 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 20:57:39,045 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 20:57:39,046 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 20:57:39,046 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:10