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-3.16-rc1/205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--arc-rawmode.ko-entry_point.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 16:10:42,331 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 16:10:42,333 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 16:10:42,344 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 16:10:42,345 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 16:10:42,346 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 16:10:42,347 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 16:10:42,349 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 16:10:42,350 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 16:10:42,351 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 16:10:42,352 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 16:10:42,353 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 16:10:42,354 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 16:10:42,355 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 16:10:42,355 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 16:10:42,357 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 16:10:42,357 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 16:10:42,358 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 16:10:42,360 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 16:10:42,362 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 16:10:42,363 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 16:10:42,364 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 16:10:42,365 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 16:10:42,366 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 16:10:42,368 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 16:10:42,368 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 16:10:42,369 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 16:10:42,370 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 16:10:42,370 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 16:10:42,371 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 16:10:42,371 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 16:10:42,372 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 16:10:42,373 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 16:10:42,374 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 16:10:42,376 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 16:10:42,376 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 16:10:42,379 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 16:10:42,379 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 16:10:42,379 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 16:10:42,380 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 16:10:42,381 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 16:10:42,381 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-09-08 16:10:42,397 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 16:10:42,397 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 16:10:42,399 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 16:10:42,399 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 16:10:42,399 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 16:10:42,399 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 16:10:42,400 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 16:10:42,400 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 16:10:42,400 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 16:10:42,400 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 16:10:42,400 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 16:10:42,401 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 16:10:42,401 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 16:10:42,401 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 16:10:42,401 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 16:10:42,401 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 16:10:42,402 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 16:10:42,402 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 16:10:42,402 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 16:10:42,402 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 16:10:42,402 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 16:10:42,403 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 16:10:42,403 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 16:10:42,403 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 16:10:42,403 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 16:10:42,404 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 16:10:42,404 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 16:10:42,404 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 16:10:42,404 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 16:10:42,435 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 16:10:42,449 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 16:10:42,454 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 16:10:42,455 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 16:10:42,456 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 16:10:42,460 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-linux-3.16-rc1/205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--arc-rawmode.ko-entry_point.cil.out.i [2019-09-08 16:10:42,538 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3045d64be/370a88ffc79448e9831895b783a9d43e/FLAG56df590db [2019-09-08 16:10:43,334 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 16:10:43,337 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-3.16-rc1/205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--arc-rawmode.ko-entry_point.cil.out.i [2019-09-08 16:10:43,377 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3045d64be/370a88ffc79448e9831895b783a9d43e/FLAG56df590db [2019-09-08 16:10:43,399 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3045d64be/370a88ffc79448e9831895b783a9d43e [2019-09-08 16:10:43,410 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 16:10:43,412 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 16:10:43,413 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 16:10:43,413 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 16:10:43,417 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 16:10:43,417 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:10:43" (1/1) ... [2019-09-08 16:10:43,420 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76542ddf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:10:43, skipping insertion in model container [2019-09-08 16:10:43,421 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:10:43" (1/1) ... [2019-09-08 16:10:43,427 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 16:10:43,555 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 16:10:44,669 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 16:10:44,696 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 16:10:44,856 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 16:10:44,902 INFO L192 MainTranslator]: Completed translation [2019-09-08 16:10:44,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:10:44 WrapperNode [2019-09-08 16:10:44,904 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 16:10:44,905 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 16:10:44,905 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 16:10:44,905 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 16:10:44,921 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:10:44" (1/1) ... [2019-09-08 16:10:44,921 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:10:44" (1/1) ... [2019-09-08 16:10:44,974 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:10:44" (1/1) ... [2019-09-08 16:10:44,978 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:10:44" (1/1) ... [2019-09-08 16:10:45,042 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:10:44" (1/1) ... [2019-09-08 16:10:45,054 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:10:44" (1/1) ... [2019-09-08 16:10:45,063 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:10:44" (1/1) ... [2019-09-08 16:10:45,074 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 16:10:45,075 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 16:10:45,075 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 16:10:45,075 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 16:10:45,077 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:10:44" (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-09-08 16:10:45,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 16:10:45,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 16:10:45,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~int~X~$Pointer$~X~int~TO~VOID [2019-09-08 16:10:45,161 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reset_mac_header [2019-09-08 16:10:45,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-09-08 16:10:45,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-09-08 16:10:45,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2019-09-08 16:10:45,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ptr [2019-09-08 16:10:45,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ulong [2019-09-08 16:10:45,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2019-09-08 16:10:45,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2019-09-08 16:10:45,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2019-09-08 16:10:45,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_trap [2019-09-08 16:10:45,167 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2019-09-08 16:10:45,168 INFO L138 BoogieDeclarations]: Found implementation of procedure arcnet_raw_init [2019-09-08 16:10:45,168 INFO L138 BoogieDeclarations]: Found implementation of procedure arcnet_raw_exit [2019-09-08 16:10:45,171 INFO L138 BoogieDeclarations]: Found implementation of procedure rx [2019-09-08 16:10:45,172 INFO L138 BoogieDeclarations]: Found implementation of procedure build_header [2019-09-08 16:10:45,172 INFO L138 BoogieDeclarations]: Found implementation of procedure prepare_tx [2019-09-08 16:10:45,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize_ArcProto_1 [2019-09-08 16:10:45,173 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 16:10:45,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_consume_skb_5 [2019-09-08 16:10:45,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kfree_skb_6 [2019-09-08 16:10:45,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kfree_skb_7 [2019-09-08 16:10:45,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kfree_skb_8 [2019-09-08 16:10:45,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kfree_skb_11 [2019-09-08 16:10:45,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kfree_skb_13 [2019-09-08 16:10:45,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_skb_14 [2019-09-08 16:10:45,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_netif_rx_15 [2019-09-08 16:10:45,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_init [2019-09-08 16:10:45,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_add [2019-09-08 16:10:45,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2019-09-08 16:10:45,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_contains [2019-09-08 16:10:45,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_is_empty [2019-09-08 16:10:45,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2019-09-08 16:10:45,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_err_ptr [2019-09-08 16:10:45,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_ptr_err [2019-09-08 16:10:45,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err_or_null [2019-09-08 16:10:45,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2019-09-08 16:10:45,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2019-09-08 16:10:45,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free [2019-09-08 16:10:45,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free_int [2019-09-08 16:10:45,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_alloc_skb [2019-09-08 16:10:45,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_netdev_alloc_skb [2019-09-08 16:10:45,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_current [2019-09-08 16:10:45,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2019-09-08 16:10:45,180 INFO L138 BoogieDeclarations]: Found implementation of procedure arcnet_unregister_proto [2019-09-08 16:10:45,180 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2019-09-08 16:10:45,180 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_pull [2019-09-08 16:10:45,181 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_push [2019-09-08 16:10:45,181 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2019-09-08 16:10:45,181 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2019-09-08 16:10:45,182 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-09-08 16:10:45,182 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-09-08 16:10:45,182 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-08 16:10:45,182 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-08 16:10:45,183 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 16:10:45,183 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2019-09-08 16:10:45,184 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2019-09-08 16:10:45,184 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-08 16:10:45,185 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-09-08 16:10:45,185 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kfree_skb_6 [2019-09-08 16:10:45,185 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kfree_skb_7 [2019-09-08 16:10:45,186 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kfree_skb_8 [2019-09-08 16:10:45,186 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kfree_skb_11 [2019-09-08 16:10:45,186 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kfree_skb_13 [2019-09-08 16:10:45,186 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_consume_skb_5 [2019-09-08 16:10:45,187 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_skb_14 [2019-09-08 16:10:45,187 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2019-09-08 16:10:45,188 INFO L130 BoogieDeclarations]: Found specification of procedure skb_push [2019-09-08 16:10:45,188 INFO L130 BoogieDeclarations]: Found specification of procedure skb_pull [2019-09-08 16:10:45,188 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reset_mac_header [2019-09-08 16:10:45,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 16:10:45,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 16:10:45,190 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2019-09-08 16:10:45,190 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free [2019-09-08 16:10:45,190 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free_int [2019-09-08 16:10:45,191 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 16:10:45,191 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-08 16:10:45,191 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 16:10:45,191 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2019-09-08 16:10:45,192 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-09-08 16:10:45,193 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-08 16:10:45,193 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 16:10:45,193 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-09-08 16:10:45,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 16:10:45,195 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-09-08 16:10:45,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-08 16:10:45,195 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2019-09-08 16:10:45,196 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ptr [2019-09-08 16:10:45,197 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ulong [2019-09-08 16:10:45,197 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2019-09-08 16:10:45,197 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2019-09-08 16:10:45,197 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_trap [2019-09-08 16:10:45,198 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize_ArcProto_1 [2019-09-08 16:10:45,198 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2019-09-08 16:10:45,198 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_netif_rx_15 [2019-09-08 16:10:45,199 INFO L130 BoogieDeclarations]: Found specification of procedure arcnet_unregister_proto [2019-09-08 16:10:45,199 INFO L130 BoogieDeclarations]: Found specification of procedure rx [2019-09-08 16:10:45,199 INFO L130 BoogieDeclarations]: Found specification of procedure build_header [2019-09-08 16:10:45,199 INFO L130 BoogieDeclarations]: Found specification of procedure prepare_tx [2019-09-08 16:10:45,200 INFO L130 BoogieDeclarations]: Found specification of procedure arcnet_raw_init [2019-09-08 16:10:45,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 16:10:45,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 16:10:45,200 INFO L130 BoogieDeclarations]: Found specification of procedure arcnet_raw_exit [2019-09-08 16:10:45,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-08 16:10:45,201 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~int~X~$Pointer$~X~int~TO~VOID [2019-09-08 16:10:45,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 16:10:45,201 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2019-09-08 16:10:45,202 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2019-09-08 16:10:45,202 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 16:10:45,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-09-08 16:10:45,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 16:10:45,202 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_init [2019-09-08 16:10:45,203 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_add [2019-09-08 16:10:45,203 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2019-09-08 16:10:45,203 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_contains [2019-09-08 16:10:45,203 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_is_empty [2019-09-08 16:10:45,204 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2019-09-08 16:10:45,204 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_err_ptr [2019-09-08 16:10:45,204 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_ptr_err [2019-09-08 16:10:45,204 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err_or_null [2019-09-08 16:10:45,205 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_netdev_alloc_skb [2019-09-08 16:10:45,205 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_alloc_skb [2019-09-08 16:10:45,206 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_current [2019-09-08 16:10:45,207 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2019-09-08 16:10:45,207 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 16:10:45,207 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-09-08 16:10:45,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 16:10:45,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 16:10:45,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-08 16:10:45,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 16:10:45,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-08 16:10:45,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-08 16:10:45,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-08 16:10:45,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-08 16:10:46,113 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2019-09-08 16:10:46,622 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 16:10:46,623 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-08 16:10:46,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:10:46 BoogieIcfgContainer [2019-09-08 16:10:46,624 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 16:10:46,625 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 16:10:46,626 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 16:10:46,629 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 16:10:46,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 04:10:43" (1/3) ... [2019-09-08 16:10:46,630 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ebb0adc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:10:46, skipping insertion in model container [2019-09-08 16:10:46,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:10:44" (2/3) ... [2019-09-08 16:10:46,631 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ebb0adc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:10:46, skipping insertion in model container [2019-09-08 16:10:46,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:10:46" (3/3) ... [2019-09-08 16:10:46,633 INFO L109 eAbstractionObserver]: Analyzing ICFG 205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--arc-rawmode.ko-entry_point.cil.out.i [2019-09-08 16:10:46,644 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 16:10:46,654 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 16:10:46,671 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 16:10:46,703 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 16:10:46,703 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 16:10:46,703 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 16:10:46,704 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 16:10:46,704 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 16:10:46,704 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 16:10:46,704 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 16:10:46,704 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 16:10:46,704 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 16:10:46,728 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states. [2019-09-08 16:10:46,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-08 16:10:46,745 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:10:46,746 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 16:10:46,748 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:10:46,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:10:46,756 INFO L82 PathProgramCache]: Analyzing trace with hash -789799879, now seen corresponding path program 1 times [2019-09-08 16:10:46,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:10:46,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:10:46,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:10:46,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:10:46,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:10:46,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:10:47,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 16:10:47,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:10:47,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 16:10:47,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 16:10:47,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 16:10:47,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:10:47,165 INFO L87 Difference]: Start difference. First operand 255 states. Second operand 3 states. [2019-09-08 16:10:47,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:10:47,314 INFO L93 Difference]: Finished difference Result 607 states and 790 transitions. [2019-09-08 16:10:47,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 16:10:47,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-09-08 16:10:47,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:10:47,333 INFO L225 Difference]: With dead ends: 607 [2019-09-08 16:10:47,333 INFO L226 Difference]: Without dead ends: 380 [2019-09-08 16:10:47,339 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:10:47,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-09-08 16:10:47,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2019-09-08 16:10:47,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2019-09-08 16:10:47,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 468 transitions. [2019-09-08 16:10:47,429 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 468 transitions. Word has length 49 [2019-09-08 16:10:47,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:10:47,429 INFO L475 AbstractCegarLoop]: Abstraction has 380 states and 468 transitions. [2019-09-08 16:10:47,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 16:10:47,430 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 468 transitions. [2019-09-08 16:10:47,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-08 16:10:47,434 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:10:47,434 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 16:10:47,434 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:10:47,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:10:47,435 INFO L82 PathProgramCache]: Analyzing trace with hash 545359979, now seen corresponding path program 1 times [2019-09-08 16:10:47,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:10:47,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:10:47,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:10:47,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:10:47,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:10:47,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:10:47,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 16:10:47,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:10:47,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 16:10:47,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 16:10:47,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 16:10:47,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:10:47,626 INFO L87 Difference]: Start difference. First operand 380 states and 468 transitions. Second operand 3 states. [2019-09-08 16:10:47,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:10:47,676 INFO L93 Difference]: Finished difference Result 743 states and 920 transitions. [2019-09-08 16:10:47,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 16:10:47,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-09-08 16:10:47,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:10:47,682 INFO L225 Difference]: With dead ends: 743 [2019-09-08 16:10:47,682 INFO L226 Difference]: Without dead ends: 384 [2019-09-08 16:10:47,686 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:10:47,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-09-08 16:10:47,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 381. [2019-09-08 16:10:47,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-09-08 16:10:47,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 469 transitions. [2019-09-08 16:10:47,728 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 469 transitions. Word has length 52 [2019-09-08 16:10:47,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:10:47,729 INFO L475 AbstractCegarLoop]: Abstraction has 381 states and 469 transitions. [2019-09-08 16:10:47,729 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 16:10:47,729 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 469 transitions. [2019-09-08 16:10:47,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-08 16:10:47,732 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:10:47,732 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 16:10:47,732 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:10:47,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:10:47,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1879641692, now seen corresponding path program 1 times [2019-09-08 16:10:47,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:10:47,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:10:47,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:10:47,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:10:47,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:10:47,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:10:47,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-08 16:10:47,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:10:47,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 16:10:47,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 16:10:47,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 16:10:47,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 16:10:47,853 INFO L87 Difference]: Start difference. First operand 381 states and 469 transitions. Second operand 5 states. [2019-09-08 16:10:47,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:10:47,941 INFO L93 Difference]: Finished difference Result 740 states and 913 transitions. [2019-09-08 16:10:47,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 16:10:47,942 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-09-08 16:10:47,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:10:47,946 INFO L225 Difference]: With dead ends: 740 [2019-09-08 16:10:47,946 INFO L226 Difference]: Without dead ends: 380 [2019-09-08 16:10:47,948 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 16:10:47,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-09-08 16:10:47,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2019-09-08 16:10:47,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2019-09-08 16:10:47,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 465 transitions. [2019-09-08 16:10:48,000 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 465 transitions. Word has length 56 [2019-09-08 16:10:48,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:10:48,004 INFO L475 AbstractCegarLoop]: Abstraction has 380 states and 465 transitions. [2019-09-08 16:10:48,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 16:10:48,005 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 465 transitions. [2019-09-08 16:10:48,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 16:10:48,022 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:10:48,023 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2019-09-08 16:10:48,023 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:10:48,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:10:48,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1950715239, now seen corresponding path program 1 times [2019-09-08 16:10:48,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:10:48,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:10:48,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:10:48,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:10:48,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:10:48,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:10:48,298 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 16:10:48,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:10:48,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 16:10:48,299 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 16:10:48,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 16:10:48,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 16:10:48,300 INFO L87 Difference]: Start difference. First operand 380 states and 465 transitions. Second operand 6 states. [2019-09-08 16:10:48,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:10:48,704 INFO L93 Difference]: Finished difference Result 1103 states and 1375 transitions. [2019-09-08 16:10:48,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 16:10:48,705 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 86 [2019-09-08 16:10:48,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:10:48,712 INFO L225 Difference]: With dead ends: 1103 [2019-09-08 16:10:48,713 INFO L226 Difference]: Without dead ends: 728 [2019-09-08 16:10:48,714 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 16:10:48,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2019-09-08 16:10:48,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 728. [2019-09-08 16:10:48,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 728 states. [2019-09-08 16:10:48,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 906 transitions. [2019-09-08 16:10:48,757 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 906 transitions. Word has length 86 [2019-09-08 16:10:48,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:10:48,758 INFO L475 AbstractCegarLoop]: Abstraction has 728 states and 906 transitions. [2019-09-08 16:10:48,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 16:10:48,758 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 906 transitions. [2019-09-08 16:10:48,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-08 16:10:48,765 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:10:48,766 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 16:10:48,766 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:10:48,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:10:48,767 INFO L82 PathProgramCache]: Analyzing trace with hash -515770902, now seen corresponding path program 1 times [2019-09-08 16:10:48,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:10:48,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:10:48,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:10:48,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:10:48,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:10:48,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:10:48,890 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 16:10:48,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:10:48,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 16:10:48,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 16:10:48,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 16:10:48,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:10:48,892 INFO L87 Difference]: Start difference. First operand 728 states and 906 transitions. Second operand 3 states. [2019-09-08 16:10:48,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:10:48,945 INFO L93 Difference]: Finished difference Result 1206 states and 1504 transitions. [2019-09-08 16:10:48,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 16:10:48,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2019-09-08 16:10:48,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:10:48,949 INFO L225 Difference]: With dead ends: 1206 [2019-09-08 16:10:48,949 INFO L226 Difference]: Without dead ends: 499 [2019-09-08 16:10:48,952 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:10:48,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2019-09-08 16:10:48,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 454. [2019-09-08 16:10:48,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2019-09-08 16:10:48,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 568 transitions. [2019-09-08 16:10:48,985 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 568 transitions. Word has length 132 [2019-09-08 16:10:48,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:10:48,987 INFO L475 AbstractCegarLoop]: Abstraction has 454 states and 568 transitions. [2019-09-08 16:10:48,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 16:10:48,987 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 568 transitions. [2019-09-08 16:10:48,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-08 16:10:48,991 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:10:48,991 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 16:10:48,991 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:10:48,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:10:48,992 INFO L82 PathProgramCache]: Analyzing trace with hash 601633960, now seen corresponding path program 2 times [2019-09-08 16:10:48,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:10:48,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:10:48,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:10:48,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:10:48,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:10:49,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:10:49,236 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-08 16:10:49,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:10:49,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 16:10:49,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 16:10:49,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 16:10:49,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 16:10:49,238 INFO L87 Difference]: Start difference. First operand 454 states and 568 transitions. Second operand 5 states. [2019-09-08 16:10:49,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:10:49,282 INFO L93 Difference]: Finished difference Result 879 states and 1116 transitions. [2019-09-08 16:10:49,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 16:10:49,282 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 132 [2019-09-08 16:10:49,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:10:49,287 INFO L225 Difference]: With dead ends: 879 [2019-09-08 16:10:49,287 INFO L226 Difference]: Without dead ends: 468 [2019-09-08 16:10:49,289 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 16:10:49,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2019-09-08 16:10:49,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 464. [2019-09-08 16:10:49,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-09-08 16:10:49,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 582 transitions. [2019-09-08 16:10:49,316 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 582 transitions. Word has length 132 [2019-09-08 16:10:49,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:10:49,317 INFO L475 AbstractCegarLoop]: Abstraction has 464 states and 582 transitions. [2019-09-08 16:10:49,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 16:10:49,317 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 582 transitions. [2019-09-08 16:10:49,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 16:10:49,321 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:10:49,321 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 16:10:49,321 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:10:49,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:10:49,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1908363611, now seen corresponding path program 1 times [2019-09-08 16:10:49,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:10:49,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:10:49,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:10:49,327 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 16:10:49,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:10:49,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:10:49,477 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-08 16:10:49,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:10:49,478 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:10:49,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:10:49,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:10:49,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 923 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 16:10:49,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:10:49,761 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-08 16:10:49,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 16:10:49,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 16:10:49,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 16:10:49,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 16:10:49,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 16:10:49,774 INFO L87 Difference]: Start difference. First operand 464 states and 582 transitions. Second operand 6 states. [2019-09-08 16:10:49,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:10:49,861 INFO L93 Difference]: Finished difference Result 916 states and 1159 transitions. [2019-09-08 16:10:49,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 16:10:49,862 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 137 [2019-09-08 16:10:49,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:10:49,865 INFO L225 Difference]: With dead ends: 916 [2019-09-08 16:10:49,865 INFO L226 Difference]: Without dead ends: 479 [2019-09-08 16:10:49,867 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-08 16:10:49,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-09-08 16:10:49,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 473. [2019-09-08 16:10:49,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2019-09-08 16:10:49,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 593 transitions. [2019-09-08 16:10:49,894 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 593 transitions. Word has length 137 [2019-09-08 16:10:49,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:10:49,895 INFO L475 AbstractCegarLoop]: Abstraction has 473 states and 593 transitions. [2019-09-08 16:10:49,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 16:10:49,895 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 593 transitions. [2019-09-08 16:10:49,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-08 16:10:49,897 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:10:49,898 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 16:10:49,898 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:10:49,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:10:49,898 INFO L82 PathProgramCache]: Analyzing trace with hash -2102283821, now seen corresponding path program 1 times [2019-09-08 16:10:49,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:10:49,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:10:49,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:10:49,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:10:49,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:10:49,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:10:50,049 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-08 16:10:50,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:10:50,049 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:10:50,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:10:50,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:10:50,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 941 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 16:10:50,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:10:50,338 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-08 16:10:50,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:10:50,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-08 16:10:50,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 16:10:50,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 16:10:50,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 16:10:50,349 INFO L87 Difference]: Start difference. First operand 473 states and 593 transitions. Second operand 6 states. [2019-09-08 16:10:50,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:10:50,410 INFO L93 Difference]: Finished difference Result 916 states and 1158 transitions. [2019-09-08 16:10:50,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 16:10:50,411 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2019-09-08 16:10:50,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:10:50,415 INFO L225 Difference]: With dead ends: 916 [2019-09-08 16:10:50,415 INFO L226 Difference]: Without dead ends: 487 [2019-09-08 16:10:50,420 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 16:10:50,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2019-09-08 16:10:50,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 481. [2019-09-08 16:10:50,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2019-09-08 16:10:50,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 603 transitions. [2019-09-08 16:10:50,445 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 603 transitions. Word has length 142 [2019-09-08 16:10:50,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:10:50,446 INFO L475 AbstractCegarLoop]: Abstraction has 481 states and 603 transitions. [2019-09-08 16:10:50,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 16:10:50,446 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 603 transitions. [2019-09-08 16:10:50,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-08 16:10:50,449 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:10:50,449 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 16:10:50,450 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:10:50,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:10:50,450 INFO L82 PathProgramCache]: Analyzing trace with hash 400979770, now seen corresponding path program 2 times [2019-09-08 16:10:50,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:10:50,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:10:50,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:10:50,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:10:50,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:10:50,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:10:50,577 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-08 16:10:50,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:10:50,578 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 16:10:50,605 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:10:50,720 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-09-08 16:10:50,720 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 16:10:50,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-08 16:10:50,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:10:50,954 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 16:10:50,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 16:10:50,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2019-09-08 16:10:50,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 16:10:50,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 16:10:50,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-09-08 16:10:50,968 INFO L87 Difference]: Start difference. First operand 481 states and 603 transitions. Second operand 15 states. [2019-09-08 16:10:51,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:10:51,270 INFO L93 Difference]: Finished difference Result 982 states and 1257 transitions. [2019-09-08 16:10:51,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 16:10:51,271 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 146 [2019-09-08 16:10:51,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:10:51,274 INFO L225 Difference]: With dead ends: 982 [2019-09-08 16:10:51,275 INFO L226 Difference]: Without dead ends: 545 [2019-09-08 16:10:51,276 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2019-09-08 16:10:51,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2019-09-08 16:10:51,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 501. [2019-09-08 16:10:51,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2019-09-08 16:10:51,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 623 transitions. [2019-09-08 16:10:51,301 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 623 transitions. Word has length 146 [2019-09-08 16:10:51,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:10:51,302 INFO L475 AbstractCegarLoop]: Abstraction has 501 states and 623 transitions. [2019-09-08 16:10:51,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 16:10:51,302 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 623 transitions. [2019-09-08 16:10:51,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-08 16:10:51,305 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:10:51,305 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 16:10:51,306 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:10:51,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:10:51,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1313658990, now seen corresponding path program 1 times [2019-09-08 16:10:51,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:10:51,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:10:51,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:10:51,310 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 16:10:51,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:10:51,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:10:51,430 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-09-08 16:10:51,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:10:51,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 16:10:51,431 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 16:10:51,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 16:10:51,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:10:51,432 INFO L87 Difference]: Start difference. First operand 501 states and 623 transitions. Second operand 3 states. [2019-09-08 16:10:51,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:10:51,455 INFO L93 Difference]: Finished difference Result 749 states and 937 transitions. [2019-09-08 16:10:51,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 16:10:51,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 190 [2019-09-08 16:10:51,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:10:51,460 INFO L225 Difference]: With dead ends: 749 [2019-09-08 16:10:51,460 INFO L226 Difference]: Without dead ends: 505 [2019-09-08 16:10:51,462 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:10:51,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2019-09-08 16:10:51,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 503. [2019-09-08 16:10:51,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2019-09-08 16:10:51,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 625 transitions. [2019-09-08 16:10:51,492 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 625 transitions. Word has length 190 [2019-09-08 16:10:51,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:10:51,493 INFO L475 AbstractCegarLoop]: Abstraction has 503 states and 625 transitions. [2019-09-08 16:10:51,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 16:10:51,494 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 625 transitions. [2019-09-08 16:10:51,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-08 16:10:51,499 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:10:51,499 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 16:10:51,500 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:10:51,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:10:51,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1271601805, now seen corresponding path program 1 times [2019-09-08 16:10:51,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:10:51,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:10:51,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:10:51,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:10:51,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:10:51,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:10:51,702 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-09-08 16:10:51,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:10:51,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 16:10:51,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 16:10:51,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 16:10:51,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:10:51,705 INFO L87 Difference]: Start difference. First operand 503 states and 625 transitions. Second operand 3 states. [2019-09-08 16:10:51,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:10:51,736 INFO L93 Difference]: Finished difference Result 962 states and 1201 transitions. [2019-09-08 16:10:51,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 16:10:51,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2019-09-08 16:10:51,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:10:51,741 INFO L225 Difference]: With dead ends: 962 [2019-09-08 16:10:51,742 INFO L226 Difference]: Without dead ends: 503 [2019-09-08 16:10:51,744 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 16:10:51,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2019-09-08 16:10:51,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 501. [2019-09-08 16:10:51,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2019-09-08 16:10:51,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 619 transitions. [2019-09-08 16:10:51,772 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 619 transitions. Word has length 192 [2019-09-08 16:10:51,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:10:51,774 INFO L475 AbstractCegarLoop]: Abstraction has 501 states and 619 transitions. [2019-09-08 16:10:51,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 16:10:51,775 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 619 transitions. [2019-09-08 16:10:51,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-08 16:10:51,780 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:10:51,781 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 16:10:51,781 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:10:51,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:10:51,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1456566195, now seen corresponding path program 1 times [2019-09-08 16:10:51,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:10:51,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:10:51,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:10:51,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:10:51,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:10:51,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:10:52,041 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-09-08 16:10:52,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:10:52,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 16:10:52,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 16:10:52,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 16:10:52,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 16:10:52,044 INFO L87 Difference]: Start difference. First operand 501 states and 619 transitions. Second operand 7 states. [2019-09-08 16:10:52,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:10:52,095 INFO L93 Difference]: Finished difference Result 960 states and 1193 transitions. [2019-09-08 16:10:52,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 16:10:52,096 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 192 [2019-09-08 16:10:52,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:10:52,099 INFO L225 Difference]: With dead ends: 960 [2019-09-08 16:10:52,099 INFO L226 Difference]: Without dead ends: 503 [2019-09-08 16:10:52,106 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 16:10:52,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2019-09-08 16:10:52,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 501. [2019-09-08 16:10:52,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2019-09-08 16:10:52,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 617 transitions. [2019-09-08 16:10:52,130 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 617 transitions. Word has length 192 [2019-09-08 16:10:52,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:10:52,130 INFO L475 AbstractCegarLoop]: Abstraction has 501 states and 617 transitions. [2019-09-08 16:10:52,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 16:10:52,130 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 617 transitions. [2019-09-08 16:10:52,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-09-08 16:10:52,133 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:10:52,134 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 16:10:52,134 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:10:52,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:10:52,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1012869134, now seen corresponding path program 1 times [2019-09-08 16:10:52,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:10:52,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:10:52,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:10:52,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:10:52,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:10:52,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:10:52,411 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 7 proven. 28 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 16:10:52,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:10:52,412 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 16:10:52,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:10:52,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:10:52,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 1185 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 16:10:52,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:10:52,673 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 19 proven. 28 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 16:10:52,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:10:52,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-08 16:10:52,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 16:10:52,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 16:10:52,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-08 16:10:52,697 INFO L87 Difference]: Start difference. First operand 501 states and 617 transitions. Second operand 8 states. [2019-09-08 16:10:52,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:10:52,788 INFO L93 Difference]: Finished difference Result 972 states and 1206 transitions. [2019-09-08 16:10:52,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 16:10:52,789 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 200 [2019-09-08 16:10:52,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:10:52,793 INFO L225 Difference]: With dead ends: 972 [2019-09-08 16:10:52,793 INFO L226 Difference]: Without dead ends: 515 [2019-09-08 16:10:52,795 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-08 16:10:52,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2019-09-08 16:10:52,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 509. [2019-09-08 16:10:52,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2019-09-08 16:10:52,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 627 transitions. [2019-09-08 16:10:52,818 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 627 transitions. Word has length 200 [2019-09-08 16:10:52,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:10:52,818 INFO L475 AbstractCegarLoop]: Abstraction has 509 states and 627 transitions. [2019-09-08 16:10:52,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 16:10:52,819 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 627 transitions. [2019-09-08 16:10:52,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-08 16:10:52,825 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:10:52,826 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 16:10:52,826 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:10:52,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:10:52,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1334492825, now seen corresponding path program 2 times [2019-09-08 16:10:52,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:10:52,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:10:52,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:10:52,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:10:52,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:10:52,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:10:53,038 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 7 proven. 45 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 16:10:53,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:10:53,038 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 16:10:53,069 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:10:53,276 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-09-08 16:10:53,276 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 16:10:53,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 680 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 16:10:53,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:10:53,363 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-08 16:10:53,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 16:10:53,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2019-09-08 16:10:53,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 16:10:53,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 16:10:53,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-09-08 16:10:53,378 INFO L87 Difference]: Start difference. First operand 509 states and 627 transitions. Second operand 11 states. [2019-09-08 16:10:53,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:10:53,712 INFO L93 Difference]: Finished difference Result 998 states and 1243 transitions. [2019-09-08 16:10:53,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 16:10:53,713 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 204 [2019-09-08 16:10:53,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:10:53,718 INFO L225 Difference]: With dead ends: 998 [2019-09-08 16:10:53,719 INFO L226 Difference]: Without dead ends: 527 [2019-09-08 16:10:53,721 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 202 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-09-08 16:10:53,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2019-09-08 16:10:53,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 519. [2019-09-08 16:10:53,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2019-09-08 16:10:53,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 639 transitions. [2019-09-08 16:10:53,762 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 639 transitions. Word has length 204 [2019-09-08 16:10:53,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:10:53,763 INFO L475 AbstractCegarLoop]: Abstraction has 519 states and 639 transitions. [2019-09-08 16:10:53,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 16:10:53,763 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 639 transitions. [2019-09-08 16:10:53,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-09-08 16:10:53,769 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:10:53,769 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 16:10:53,770 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:10:53,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:10:53,770 INFO L82 PathProgramCache]: Analyzing trace with hash -2043985741, now seen corresponding path program 1 times [2019-09-08 16:10:53,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:10:53,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:10:53,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:10:53,775 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 16:10:53,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:10:53,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:10:54,072 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 7 proven. 66 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-08 16:10:54,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:10:54,073 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:10:54,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:10:54,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:10:54,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 1237 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 16:10:54,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:10:54,413 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 19 proven. 66 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 16:10:54,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:10:54,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-09-08 16:10:54,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 16:10:54,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 16:10:54,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-08 16:10:54,429 INFO L87 Difference]: Start difference. First operand 519 states and 639 transitions. Second operand 10 states. [2019-09-08 16:10:54,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:10:54,524 INFO L93 Difference]: Finished difference Result 1008 states and 1250 transitions. [2019-09-08 16:10:54,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 16:10:54,525 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 209 [2019-09-08 16:10:54,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:10:54,529 INFO L225 Difference]: With dead ends: 1008 [2019-09-08 16:10:54,529 INFO L226 Difference]: Without dead ends: 533 [2019-09-08 16:10:54,531 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-08 16:10:54,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2019-09-08 16:10:54,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 527. [2019-09-08 16:10:54,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2019-09-08 16:10:54,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 649 transitions. [2019-09-08 16:10:54,560 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 649 transitions. Word has length 209 [2019-09-08 16:10:54,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:10:54,561 INFO L475 AbstractCegarLoop]: Abstraction has 527 states and 649 transitions. [2019-09-08 16:10:54,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 16:10:54,561 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 649 transitions. [2019-09-08 16:10:54,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-09-08 16:10:54,566 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:10:54,566 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 16:10:54,566 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:10:54,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:10:54,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1477646868, now seen corresponding path program 2 times [2019-09-08 16:10:54,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:10:54,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:10:54,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:10:54,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:10:54,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:10:54,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:10:54,821 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 7 proven. 91 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-08 16:10:54,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:10:54,822 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 16:10:54,843 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:10:54,984 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-09-08 16:10:54,984 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 16:10:54,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 680 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 16:10:54,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:10:55,064 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-09-08 16:10:55,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 16:10:55,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2019-09-08 16:10:55,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 16:10:55,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 16:10:55,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2019-09-08 16:10:55,078 INFO L87 Difference]: Start difference. First operand 527 states and 649 transitions. Second operand 13 states. [2019-09-08 16:10:55,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:10:55,260 INFO L93 Difference]: Finished difference Result 1032 states and 1283 transitions. [2019-09-08 16:10:55,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 16:10:55,260 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 213 [2019-09-08 16:10:55,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:10:55,265 INFO L225 Difference]: With dead ends: 1032 [2019-09-08 16:10:55,265 INFO L226 Difference]: Without dead ends: 545 [2019-09-08 16:10:55,267 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 210 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-09-08 16:10:55,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2019-09-08 16:10:55,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 537. [2019-09-08 16:10:55,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2019-09-08 16:10:55,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 661 transitions. [2019-09-08 16:10:55,301 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 661 transitions. Word has length 213 [2019-09-08 16:10:55,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:10:55,302 INFO L475 AbstractCegarLoop]: Abstraction has 537 states and 661 transitions. [2019-09-08 16:10:55,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 16:10:55,302 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 661 transitions. [2019-09-08 16:10:55,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-08 16:10:55,305 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:10:55,305 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 16:10:55,306 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:10:55,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:10:55,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1235723028, now seen corresponding path program 1 times [2019-09-08 16:10:55,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:10:55,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:10:55,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:10:55,308 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 16:10:55,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:10:55,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:10:55,535 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 7 proven. 120 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 16:10:55,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:10:55,535 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:10:55,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:10:55,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:10:55,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 1271 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-08 16:10:55,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:10:55,873 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 19 proven. 120 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-08 16:10:55,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:10:55,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-09-08 16:10:55,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 16:10:55,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 16:10:55,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-08 16:10:55,891 INFO L87 Difference]: Start difference. First operand 537 states and 661 transitions. Second operand 12 states. [2019-09-08 16:10:56,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:10:56,010 INFO L93 Difference]: Finished difference Result 1044 states and 1294 transitions. [2019-09-08 16:10:56,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 16:10:56,011 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 218 [2019-09-08 16:10:56,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:10:56,014 INFO L225 Difference]: With dead ends: 1044 [2019-09-08 16:10:56,014 INFO L226 Difference]: Without dead ends: 551 [2019-09-08 16:10:56,018 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-08 16:10:56,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2019-09-08 16:10:56,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 545. [2019-09-08 16:10:56,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2019-09-08 16:10:56,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 671 transitions. [2019-09-08 16:10:56,041 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 671 transitions. Word has length 218 [2019-09-08 16:10:56,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:10:56,042 INFO L475 AbstractCegarLoop]: Abstraction has 545 states and 671 transitions. [2019-09-08 16:10:56,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 16:10:56,042 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 671 transitions. [2019-09-08 16:10:56,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-09-08 16:10:56,046 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:10:56,047 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 16:10:56,047 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:10:56,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:10:56,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1208317997, now seen corresponding path program 2 times [2019-09-08 16:10:56,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:10:56,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:10:56,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:10:56,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:10:56,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:10:56,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:10:56,295 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 7 proven. 153 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 16:10:56,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:10:56,296 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:10:56,318 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 16:10:56,531 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 16:10:56,532 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 16:10:56,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 1283 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-08 16:10:56,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:10:56,595 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 19 proven. 153 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-08 16:10:56,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:10:56,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-09-08 16:10:56,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 16:10:56,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 16:10:56,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-08 16:10:56,609 INFO L87 Difference]: Start difference. First operand 545 states and 671 transitions. Second operand 13 states. [2019-09-08 16:10:56,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:10:56,743 INFO L93 Difference]: Finished difference Result 1060 states and 1314 transitions. [2019-09-08 16:10:56,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 16:10:56,743 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 222 [2019-09-08 16:10:56,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:10:56,747 INFO L225 Difference]: With dead ends: 1060 [2019-09-08 16:10:56,747 INFO L226 Difference]: Without dead ends: 559 [2019-09-08 16:10:56,749 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-08 16:10:56,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2019-09-08 16:10:56,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 553. [2019-09-08 16:10:56,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2019-09-08 16:10:56,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 681 transitions. [2019-09-08 16:10:56,777 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 681 transitions. Word has length 222 [2019-09-08 16:10:56,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:10:56,778 INFO L475 AbstractCegarLoop]: Abstraction has 553 states and 681 transitions. [2019-09-08 16:10:56,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 16:10:56,778 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 681 transitions. [2019-09-08 16:10:56,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-09-08 16:10:56,783 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:10:56,783 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 16:10:56,784 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:10:56,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:10:56,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1966008122, now seen corresponding path program 3 times [2019-09-08 16:10:56,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:10:56,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:10:56,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:10:56,788 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 16:10:56,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:10:56,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:10:57,040 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 7 proven. 190 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 16:10:57,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:10:57,040 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 16:10:57,075 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:10:57,272 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-08 16:10:57,273 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 16:10:57,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 944 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-08 16:10:57,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:10:57,441 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2019-09-08 16:10:57,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:10:57,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6] total 17 [2019-09-08 16:10:57,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 16:10:57,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 16:10:57,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2019-09-08 16:10:57,450 INFO L87 Difference]: Start difference. First operand 553 states and 681 transitions. Second operand 17 states. [2019-09-08 16:10:57,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:10:57,884 INFO L93 Difference]: Finished difference Result 1088 states and 1353 transitions. [2019-09-08 16:10:57,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 16:10:57,884 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 226 [2019-09-08 16:10:57,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:10:57,888 INFO L225 Difference]: With dead ends: 1088 [2019-09-08 16:10:57,888 INFO L226 Difference]: Without dead ends: 571 [2019-09-08 16:10:57,890 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 222 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-09-08 16:10:57,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-09-08 16:10:57,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 563. [2019-09-08 16:10:57,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2019-09-08 16:10:57,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 693 transitions. [2019-09-08 16:10:57,918 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 693 transitions. Word has length 226 [2019-09-08 16:10:57,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:10:57,919 INFO L475 AbstractCegarLoop]: Abstraction has 563 states and 693 transitions. [2019-09-08 16:10:57,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 16:10:57,919 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 693 transitions. [2019-09-08 16:10:57,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-08 16:10:57,925 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:10:57,926 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 16:10:57,926 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:10:57,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:10:57,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1746586450, now seen corresponding path program 4 times [2019-09-08 16:10:57,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:10:57,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:10:57,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:10:57,930 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 16:10:57,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:10:57,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:10:58,240 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 7 proven. 231 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 16:10:58,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:10:58,241 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 16:10:58,274 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:10:58,610 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 16:10:58,611 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 16:10:58,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 1335 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-08 16:10:58,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:10:58,674 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 19 proven. 231 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-08 16:10:58,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:10:58,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-09-08 16:10:58,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 16:10:58,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 16:10:58,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-08 16:10:58,692 INFO L87 Difference]: Start difference. First operand 563 states and 693 transitions. Second operand 15 states. [2019-09-08 16:10:58,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:10:58,821 INFO L93 Difference]: Finished difference Result 1096 states and 1358 transitions. [2019-09-08 16:10:58,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 16:10:58,821 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 231 [2019-09-08 16:10:58,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:10:58,828 INFO L225 Difference]: With dead ends: 1096 [2019-09-08 16:10:58,828 INFO L226 Difference]: Without dead ends: 577 [2019-09-08 16:10:58,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-08 16:10:58,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-09-08 16:10:58,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 571. [2019-09-08 16:10:58,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-09-08 16:10:58,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 703 transitions. [2019-09-08 16:10:58,879 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 703 transitions. Word has length 231 [2019-09-08 16:10:58,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:10:58,879 INFO L475 AbstractCegarLoop]: Abstraction has 571 states and 703 transitions. [2019-09-08 16:10:58,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 16:10:58,879 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 703 transitions. [2019-09-08 16:10:58,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-09-08 16:10:58,883 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:10:58,884 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 16:10:58,884 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:10:58,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:10:58,884 INFO L82 PathProgramCache]: Analyzing trace with hash -4703961, now seen corresponding path program 5 times [2019-09-08 16:10:58,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:10:58,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:10:58,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:10:58,888 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 16:10:58,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:10:58,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:10:59,246 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 7 proven. 276 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 16:10:59,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:10:59,247 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:10:59,284 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 16:11:17,080 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2019-09-08 16:11:17,081 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 16:11:17,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-08 16:11:17,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:11:17,922 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 19 proven. 276 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-08 16:11:17,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:11:17,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-09-08 16:11:17,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 16:11:17,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 16:11:17,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-08 16:11:17,943 INFO L87 Difference]: Start difference. First operand 571 states and 703 transitions. Second operand 16 states. [2019-09-08 16:11:18,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:11:18,086 INFO L93 Difference]: Finished difference Result 1112 states and 1378 transitions. [2019-09-08 16:11:18,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 16:11:18,087 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 235 [2019-09-08 16:11:18,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:11:18,092 INFO L225 Difference]: With dead ends: 1112 [2019-09-08 16:11:18,092 INFO L226 Difference]: Without dead ends: 585 [2019-09-08 16:11:18,094 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-08 16:11:18,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2019-09-08 16:11:18,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 579. [2019-09-08 16:11:18,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2019-09-08 16:11:18,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 713 transitions. [2019-09-08 16:11:18,124 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 713 transitions. Word has length 235 [2019-09-08 16:11:18,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:11:18,125 INFO L475 AbstractCegarLoop]: Abstraction has 579 states and 713 transitions. [2019-09-08 16:11:18,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 16:11:18,125 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 713 transitions. [2019-09-08 16:11:18,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-08 16:11:18,129 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:11:18,129 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 16:11:18,129 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:11:18,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:11:18,130 INFO L82 PathProgramCache]: Analyzing trace with hash -2062395104, now seen corresponding path program 6 times [2019-09-08 16:11:18,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:11:18,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:11:18,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:11:18,133 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 16:11:18,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:11:18,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:11:18,443 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 7 proven. 325 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 16:11:18,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:11:18,443 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:11:18,464 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 16:11:18,958 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2019-09-08 16:11:18,959 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 16:11:18,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 984 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-08 16:11:18,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:11:19,087 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 356 trivial. 0 not checked. [2019-09-08 16:11:19,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:11:19,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 7] total 21 [2019-09-08 16:11:19,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 16:11:19,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 16:11:19,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2019-09-08 16:11:19,104 INFO L87 Difference]: Start difference. First operand 579 states and 713 transitions. Second operand 21 states. [2019-09-08 16:11:19,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:11:19,590 INFO L93 Difference]: Finished difference Result 1140 states and 1417 transitions. [2019-09-08 16:11:19,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 16:11:19,591 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 239 [2019-09-08 16:11:19,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:11:19,594 INFO L225 Difference]: With dead ends: 1140 [2019-09-08 16:11:19,594 INFO L226 Difference]: Without dead ends: 597 [2019-09-08 16:11:19,597 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 234 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 16:11:19,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2019-09-08 16:11:19,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 589. [2019-09-08 16:11:19,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-09-08 16:11:19,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 725 transitions. [2019-09-08 16:11:19,624 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 725 transitions. Word has length 239 [2019-09-08 16:11:19,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:11:19,624 INFO L475 AbstractCegarLoop]: Abstraction has 589 states and 725 transitions. [2019-09-08 16:11:19,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 16:11:19,624 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 725 transitions. [2019-09-08 16:11:19,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-09-08 16:11:19,629 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:11:19,629 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 16:11:19,630 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:11:19,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:11:19,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1492792778, now seen corresponding path program 7 times [2019-09-08 16:11:19,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:11:19,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:11:19,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:11:19,634 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 16:11:19,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:11:19,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:11:19,991 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 7 proven. 378 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-09-08 16:11:19,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:11:19,991 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 16:11:20,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:11:20,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:11:20,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 1399 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-08 16:11:20,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:11:20,441 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 19 proven. 378 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (15)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 16:11:20,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:11:20,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-09-08 16:11:20,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 16:11:20,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 16:11:20,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-08 16:11:20,450 INFO L87 Difference]: Start difference. First operand 589 states and 725 transitions. Second operand 18 states. [2019-09-08 16:11:20,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:11:20,597 INFO L93 Difference]: Finished difference Result 1148 states and 1422 transitions. [2019-09-08 16:11:20,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 16:11:20,598 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 244 [2019-09-08 16:11:20,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:11:20,601 INFO L225 Difference]: With dead ends: 1148 [2019-09-08 16:11:20,601 INFO L226 Difference]: Without dead ends: 603 [2019-09-08 16:11:20,603 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-08 16:11:20,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2019-09-08 16:11:20,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 597. [2019-09-08 16:11:20,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2019-09-08 16:11:20,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 735 transitions. [2019-09-08 16:11:20,629 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 735 transitions. Word has length 244 [2019-09-08 16:11:20,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:11:20,630 INFO L475 AbstractCegarLoop]: Abstraction has 597 states and 735 transitions. [2019-09-08 16:11:20,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 16:11:20,630 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 735 transitions. [2019-09-08 16:11:20,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-09-08 16:11:20,632 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:11:20,633 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 16:11:20,633 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:11:20,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:11:20,633 INFO L82 PathProgramCache]: Analyzing trace with hash 118329949, now seen corresponding path program 8 times [2019-09-08 16:11:20,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:11:20,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:11:20,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:11:20,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:11:20,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:11:20,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:11:21,026 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 7 proven. 435 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-09-08 16:11:21,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:11:21,027 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:11:21,065 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 16:11:21,363 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 16:11:21,363 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 16:11:21,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 1411 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-08 16:11:21,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:11:21,445 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 19 proven. 435 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (16)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 16:11:21,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:11:21,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-09-08 16:11:21,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 16:11:21,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 16:11:21,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-08 16:11:21,461 INFO L87 Difference]: Start difference. First operand 597 states and 735 transitions. Second operand 19 states. [2019-09-08 16:11:21,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:11:21,604 INFO L93 Difference]: Finished difference Result 1164 states and 1442 transitions. [2019-09-08 16:11:21,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 16:11:21,605 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 248 [2019-09-08 16:11:21,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:11:21,610 INFO L225 Difference]: With dead ends: 1164 [2019-09-08 16:11:21,610 INFO L226 Difference]: Without dead ends: 611 [2019-09-08 16:11:21,613 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-08 16:11:21,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-09-08 16:11:21,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 605. [2019-09-08 16:11:21,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-09-08 16:11:21,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 745 transitions. [2019-09-08 16:11:21,641 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 745 transitions. Word has length 248 [2019-09-08 16:11:21,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:11:21,642 INFO L475 AbstractCegarLoop]: Abstraction has 605 states and 745 transitions. [2019-09-08 16:11:21,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 16:11:21,642 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 745 transitions. [2019-09-08 16:11:21,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-09-08 16:11:21,644 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:11:21,644 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 16:11:21,644 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:11:21,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:11:21,645 INFO L82 PathProgramCache]: Analyzing trace with hash 269938436, now seen corresponding path program 9 times [2019-09-08 16:11:21,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:11:21,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:11:21,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:11:21,653 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 16:11:21,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:11:21,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:11:22,038 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 7 proven. 496 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-09-08 16:11:22,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:11:22,038 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:11:22,057 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 16:11:22,242 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-08 16:11:22,243 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 16:11:22,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 972 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-08 16:11:22,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:11:22,377 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2019-09-08 16:11:22,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:11:22,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 6] total 23 [2019-09-08 16:11:22,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-08 16:11:22,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-08 16:11:22,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=326, Unknown=0, NotChecked=0, Total=506 [2019-09-08 16:11:22,394 INFO L87 Difference]: Start difference. First operand 605 states and 745 transitions. Second operand 23 states. [2019-09-08 16:11:22,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:11:22,654 INFO L93 Difference]: Finished difference Result 1188 states and 1475 transitions. [2019-09-08 16:11:22,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 16:11:22,655 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 252 [2019-09-08 16:11:22,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:11:22,658 INFO L225 Difference]: With dead ends: 1188 [2019-09-08 16:11:22,658 INFO L226 Difference]: Without dead ends: 623 [2019-09-08 16:11:22,660 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 248 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=184, Invalid=368, Unknown=0, NotChecked=0, Total=552 [2019-09-08 16:11:22,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-09-08 16:11:22,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 615. [2019-09-08 16:11:22,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 615 states. [2019-09-08 16:11:22,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 757 transitions. [2019-09-08 16:11:22,695 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 757 transitions. Word has length 252 [2019-09-08 16:11:22,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:11:22,696 INFO L475 AbstractCegarLoop]: Abstraction has 615 states and 757 transitions. [2019-09-08 16:11:22,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-08 16:11:22,696 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 757 transitions. [2019-09-08 16:11:22,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-09-08 16:11:22,704 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:11:22,704 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 16:11:22,705 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:11:22,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:11:22,706 INFO L82 PathProgramCache]: Analyzing trace with hash -485018586, now seen corresponding path program 10 times [2019-09-08 16:11:22,706 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:11:22,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:11:22,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:11:22,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 16:11:22,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:11:22,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:11:23,246 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 7 proven. 561 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-08 16:11:23,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:11:23,246 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 16:11:23,269 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:11:23,427 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 16:11:23,428 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 16:11:23,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 970 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 16:11:23,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:11:23,603 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 591 trivial. 0 not checked. [2019-09-08 16:11:23,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:11:23,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 8] total 26 [2019-09-08 16:11:23,619 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-08 16:11:23,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-08 16:11:23,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=441, Unknown=0, NotChecked=0, Total=650 [2019-09-08 16:11:23,620 INFO L87 Difference]: Start difference. First operand 615 states and 757 transitions. Second operand 26 states. [2019-09-08 16:11:24,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:11:24,301 INFO L93 Difference]: Finished difference Result 1206 states and 1499 transitions. [2019-09-08 16:11:24,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 16:11:24,301 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 257 [2019-09-08 16:11:24,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:11:24,306 INFO L225 Difference]: With dead ends: 1206 [2019-09-08 16:11:24,306 INFO L226 Difference]: Without dead ends: 631 [2019-09-08 16:11:24,309 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=219, Invalid=537, Unknown=0, NotChecked=0, Total=756 [2019-09-08 16:11:24,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2019-09-08 16:11:24,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 625. [2019-09-08 16:11:24,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 625 states. [2019-09-08 16:11:24,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 769 transitions. [2019-09-08 16:11:24,349 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 769 transitions. Word has length 257 [2019-09-08 16:11:24,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:11:24,350 INFO L475 AbstractCegarLoop]: Abstraction has 625 states and 769 transitions. [2019-09-08 16:11:24,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-08 16:11:24,350 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 769 transitions. [2019-09-08 16:11:24,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-09-08 16:11:24,354 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:11:24,355 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 16:11:24,355 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:11:24,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:11:24,356 INFO L82 PathProgramCache]: Analyzing trace with hash -925470092, now seen corresponding path program 11 times [2019-09-08 16:11:24,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:11:24,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:11:24,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:11:24,360 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 16:11:24,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:11:24,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:11:24,871 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 7 proven. 630 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-09-08 16:11:24,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:11:24,872 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:11:24,894 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 16:12:30,932 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2019-09-08 16:12:30,933 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 16:12:30,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-08 16:12:30,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:12:31,054 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 19 proven. 630 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-08 16:12:31,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:12:31,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-09-08 16:12:31,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 16:12:31,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 16:12:31,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-08 16:12:31,076 INFO L87 Difference]: Start difference. First operand 625 states and 769 transitions. Second operand 22 states. [2019-09-08 16:12:31,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:12:31,270 INFO L93 Difference]: Finished difference Result 1220 states and 1510 transitions. [2019-09-08 16:12:31,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 16:12:31,271 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 262 [2019-09-08 16:12:31,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:12:31,274 INFO L225 Difference]: With dead ends: 1220 [2019-09-08 16:12:31,274 INFO L226 Difference]: Without dead ends: 639 [2019-09-08 16:12:31,276 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-08 16:12:31,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2019-09-08 16:12:31,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 633. [2019-09-08 16:12:31,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2019-09-08 16:12:31,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 779 transitions. [2019-09-08 16:12:31,306 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 779 transitions. Word has length 262 [2019-09-08 16:12:31,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:12:31,307 INFO L475 AbstractCegarLoop]: Abstraction has 633 states and 779 transitions. [2019-09-08 16:12:31,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 16:12:31,307 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 779 transitions. [2019-09-08 16:12:31,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-09-08 16:12:31,309 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:12:31,311 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 16:12:31,311 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:12:31,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:12:31,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1181818587, now seen corresponding path program 12 times [2019-09-08 16:12:31,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:12:31,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:12:31,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:12:31,315 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 16:12:31,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:12:31,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:12:31,809 INFO L134 CoverageAnalysis]: Checked inductivity of 753 backedges. 7 proven. 703 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-09-08 16:12:31,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:12:31,809 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:12:31,846 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 16:12:32,269 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2019-09-08 16:12:32,269 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 16:12:32,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 994 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 16:12:32,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:12:32,466 INFO L134 CoverageAnalysis]: Checked inductivity of 753 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 743 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (20)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 16:12:32,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:12:32,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 7] total 27 [2019-09-08 16:12:32,484 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-08 16:12:32,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-08 16:12:32,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=458, Unknown=0, NotChecked=0, Total=702 [2019-09-08 16:12:32,485 INFO L87 Difference]: Start difference. First operand 633 states and 779 transitions. Second operand 27 states. [2019-09-08 16:12:32,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:12:32,769 INFO L93 Difference]: Finished difference Result 1244 states and 1543 transitions. [2019-09-08 16:12:32,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 16:12:32,770 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 266 [2019-09-08 16:12:32,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:12:32,774 INFO L225 Difference]: With dead ends: 1244 [2019-09-08 16:12:32,774 INFO L226 Difference]: Without dead ends: 651 [2019-09-08 16:12:32,776 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 261 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=248, Invalid=508, Unknown=0, NotChecked=0, Total=756 [2019-09-08 16:12:32,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-09-08 16:12:32,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 643. [2019-09-08 16:12:32,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-09-08 16:12:32,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 791 transitions. [2019-09-08 16:12:32,805 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 791 transitions. Word has length 266 [2019-09-08 16:12:32,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:12:32,806 INFO L475 AbstractCegarLoop]: Abstraction has 643 states and 791 transitions. [2019-09-08 16:12:32,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-08 16:12:32,806 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 791 transitions. [2019-09-08 16:12:32,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2019-09-08 16:12:32,809 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:12:32,809 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 16:12:32,809 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:12:32,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:12:32,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1284343663, now seen corresponding path program 13 times [2019-09-08 16:12:32,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:12:32,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:12:32,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:12:32,812 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 16:12:32,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:12:32,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:12:33,425 INFO L134 CoverageAnalysis]: Checked inductivity of 833 backedges. 7 proven. 780 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-08 16:12:33,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:12:33,425 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 16:12:33,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:12:33,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:12:33,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 1519 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-08 16:12:33,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:12:33,760 INFO L134 CoverageAnalysis]: Checked inductivity of 833 backedges. 19 proven. 780 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 16:12:33,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:12:33,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-09-08 16:12:33,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-08 16:12:33,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-08 16:12:33,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-08 16:12:33,769 INFO L87 Difference]: Start difference. First operand 643 states and 791 transitions. Second operand 24 states. [2019-09-08 16:12:33,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:12:33,944 INFO L93 Difference]: Finished difference Result 1256 states and 1554 transitions. [2019-09-08 16:12:33,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 16:12:33,945 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 271 [2019-09-08 16:12:33,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:12:33,948 INFO L225 Difference]: With dead ends: 1256 [2019-09-08 16:12:33,948 INFO L226 Difference]: Without dead ends: 657 [2019-09-08 16:12:33,953 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-08 16:12:33,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-09-08 16:12:33,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 651. [2019-09-08 16:12:33,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-09-08 16:12:33,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 801 transitions. [2019-09-08 16:12:33,987 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 801 transitions. Word has length 271 [2019-09-08 16:12:33,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:12:33,987 INFO L475 AbstractCegarLoop]: Abstraction has 651 states and 801 transitions. [2019-09-08 16:12:33,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-08 16:12:33,988 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 801 transitions. [2019-09-08 16:12:33,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2019-09-08 16:12:33,990 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:12:33,990 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 16:12:33,991 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:12:33,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:12:33,991 INFO L82 PathProgramCache]: Analyzing trace with hash 499179240, now seen corresponding path program 14 times [2019-09-08 16:12:33,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:12:33,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:12:33,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:12:33,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:12:33,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:12:34,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:12:34,502 INFO L134 CoverageAnalysis]: Checked inductivity of 914 backedges. 7 proven. 861 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-08 16:12:34,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:12:34,503 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:12:34,519 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 16:12:34,768 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 16:12:34,768 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 16:12:34,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 1531 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-08 16:12:34,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:12:34,888 INFO L134 CoverageAnalysis]: Checked inductivity of 914 backedges. 19 proven. 861 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 16:12:34,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:12:34,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-09-08 16:12:34,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 16:12:34,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 16:12:34,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-08 16:12:34,903 INFO L87 Difference]: Start difference. First operand 651 states and 801 transitions. Second operand 25 states. [2019-09-08 16:12:35,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:12:35,078 INFO L93 Difference]: Finished difference Result 1272 states and 1574 transitions. [2019-09-08 16:12:35,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 16:12:35,079 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 275 [2019-09-08 16:12:35,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:12:35,082 INFO L225 Difference]: With dead ends: 1272 [2019-09-08 16:12:35,083 INFO L226 Difference]: Without dead ends: 665 [2019-09-08 16:12:35,085 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-08 16:12:35,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2019-09-08 16:12:35,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 659. [2019-09-08 16:12:35,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-09-08 16:12:35,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 811 transitions. [2019-09-08 16:12:35,113 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 811 transitions. Word has length 275 [2019-09-08 16:12:35,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:12:35,114 INFO L475 AbstractCegarLoop]: Abstraction has 659 states and 811 transitions. [2019-09-08 16:12:35,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 16:12:35,114 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 811 transitions. [2019-09-08 16:12:35,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-09-08 16:12:35,117 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:12:35,117 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 16:12:35,117 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:12:35,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:12:35,118 INFO L82 PathProgramCache]: Analyzing trace with hash -300297759, now seen corresponding path program 15 times [2019-09-08 16:12:35,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:12:35,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:12:35,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:12:35,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 16:12:35,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:12:35,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:12:35,652 INFO L134 CoverageAnalysis]: Checked inductivity of 999 backedges. 7 proven. 946 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-08 16:12:35,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:12:35,653 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:12:35,677 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 16:12:36,852 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-08 16:12:36,853 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 16:12:36,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 1080 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-08 16:12:36,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:12:37,071 INFO L134 CoverageAnalysis]: Checked inductivity of 999 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 976 trivial. 0 not checked. [2019-09-08 16:12:37,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:12:37,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 10] total 33 [2019-09-08 16:12:37,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-08 16:12:37,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-08 16:12:37,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=727, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 16:12:37,082 INFO L87 Difference]: Start difference. First operand 659 states and 811 transitions. Second operand 33 states. [2019-09-08 16:12:37,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:12:37,561 INFO L93 Difference]: Finished difference Result 1294 states and 1607 transitions. [2019-09-08 16:12:37,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 16:12:37,562 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 279 [2019-09-08 16:12:37,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:12:37,568 INFO L225 Difference]: With dead ends: 1294 [2019-09-08 16:12:37,568 INFO L226 Difference]: Without dead ends: 675 [2019-09-08 16:12:37,570 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=339, Invalid=851, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 16:12:37,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2019-09-08 16:12:37,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 669. [2019-09-08 16:12:37,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 669 states. [2019-09-08 16:12:37,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 823 transitions. [2019-09-08 16:12:37,604 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 823 transitions. Word has length 279 [2019-09-08 16:12:37,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:12:37,604 INFO L475 AbstractCegarLoop]: Abstraction has 669 states and 823 transitions. [2019-09-08 16:12:37,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-08 16:12:37,605 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 823 transitions. [2019-09-08 16:12:37,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-09-08 16:12:37,607 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:12:37,608 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 16:12:37,608 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:12:37,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:12:37,609 INFO L82 PathProgramCache]: Analyzing trace with hash 312360725, now seen corresponding path program 16 times [2019-09-08 16:12:37,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:12:37,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:12:37,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:12:37,611 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 16:12:37,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:12:37,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:12:38,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1093 backedges. 7 proven. 1035 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-09-08 16:12:38,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:12:38,243 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:12:38,284 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 16:12:38,461 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 16:12:38,461 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 16:12:38,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 1072 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-08 16:12:38,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:12:38,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1093 backedges. 13 proven. 15 refuted. 0 times theorem prover too weak. 1065 trivial. 0 not checked. [2019-09-08 16:12:38,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:12:38,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 11] total 35 [2019-09-08 16:12:38,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-08 16:12:38,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-08 16:12:38,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=361, Invalid=829, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 16:12:38,709 INFO L87 Difference]: Start difference. First operand 669 states and 823 transitions. Second operand 35 states. [2019-09-08 16:12:39,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:12:39,262 INFO L93 Difference]: Finished difference Result 1316 states and 1633 transitions. [2019-09-08 16:12:39,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-08 16:12:39,263 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 284 [2019-09-08 16:12:39,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:12:39,267 INFO L225 Difference]: With dead ends: 1316 [2019-09-08 16:12:39,267 INFO L226 Difference]: Without dead ends: 685 [2019-09-08 16:12:39,269 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=379, Invalid=1027, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 16:12:39,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2019-09-08 16:12:39,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 679. [2019-09-08 16:12:39,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 679 states. [2019-09-08 16:12:39,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 835 transitions. [2019-09-08 16:12:39,298 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 835 transitions. Word has length 284 [2019-09-08 16:12:39,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:12:39,299 INFO L475 AbstractCegarLoop]: Abstraction has 679 states and 835 transitions. [2019-09-08 16:12:39,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-08 16:12:39,299 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 835 transitions. [2019-09-08 16:12:39,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2019-09-08 16:12:39,302 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:12:39,302 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 16:12:39,302 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:12:39,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:12:39,303 INFO L82 PathProgramCache]: Analyzing trace with hash -2145990797, now seen corresponding path program 17 times [2019-09-08 16:12:39,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:12:39,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:12:39,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:12:39,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 16:12:39,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:12:39,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:12:39,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1192 backedges. 7 proven. 1128 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-08 16:12:39,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:12:39,914 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 16:12:39,943 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:14:53,408 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2019-09-08 16:14:53,408 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 16:14:53,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-08 16:14:53,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:14:54,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1192 backedges. 19 proven. 1128 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-08 16:14:54,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:14:54,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-09-08 16:14:54,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-08 16:14:54,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-08 16:14:54,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-08 16:14:54,076 INFO L87 Difference]: Start difference. First operand 679 states and 835 transitions. Second operand 28 states. [2019-09-08 16:14:54,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:14:54,289 INFO L93 Difference]: Finished difference Result 1328 states and 1642 transitions. [2019-09-08 16:14:54,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 16:14:54,290 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 289 [2019-09-08 16:14:54,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:14:54,295 INFO L225 Difference]: With dead ends: 1328 [2019-09-08 16:14:54,296 INFO L226 Difference]: Without dead ends: 693 [2019-09-08 16:14:54,300 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-08 16:14:54,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2019-09-08 16:14:54,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 687. [2019-09-08 16:14:54,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687 states. [2019-09-08 16:14:54,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 845 transitions. [2019-09-08 16:14:54,337 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 845 transitions. Word has length 289 [2019-09-08 16:14:54,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:14:54,338 INFO L475 AbstractCegarLoop]: Abstraction has 687 states and 845 transitions. [2019-09-08 16:14:54,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-08 16:14:54,338 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 845 transitions. [2019-09-08 16:14:54,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2019-09-08 16:14:54,341 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:14:54,342 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 16:14:54,342 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:14:54,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:14:54,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1488285012, now seen corresponding path program 18 times [2019-09-08 16:14:54,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:14:54,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:14:54,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:14:54,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 16:14:54,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:14:54,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:14:55,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1289 backedges. 7 proven. 1225 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-08 16:14:55,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:14:55,026 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:14:55,051 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 16:15:01,642 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-09-08 16:15:01,643 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 16:15:01,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 1104 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 16:15:01,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:15:01,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1289 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 1276 trivial. 0 not checked. [2019-09-08 16:15:01,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:15:01,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 8] total 34 [2019-09-08 16:15:01,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-08 16:15:01,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-08 16:15:01,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=396, Invalid=726, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 16:15:01,821 INFO L87 Difference]: Start difference. First operand 687 states and 845 transitions. Second operand 34 states. [2019-09-08 16:15:02,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:15:02,156 INFO L93 Difference]: Finished difference Result 1352 states and 1675 transitions. [2019-09-08 16:15:02,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-08 16:15:02,157 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 293 [2019-09-08 16:15:02,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:15:02,160 INFO L225 Difference]: With dead ends: 1352 [2019-09-08 16:15:02,160 INFO L226 Difference]: Without dead ends: 705 [2019-09-08 16:15:02,163 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 287 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=400, Invalid=790, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 16:15:02,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2019-09-08 16:15:02,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 697. [2019-09-08 16:15:02,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2019-09-08 16:15:02,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 857 transitions. [2019-09-08 16:15:02,193 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 857 transitions. Word has length 293 [2019-09-08 16:15:02,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:15:02,194 INFO L475 AbstractCegarLoop]: Abstraction has 697 states and 857 transitions. [2019-09-08 16:15:02,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-08 16:15:02,194 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 857 transitions. [2019-09-08 16:15:02,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-09-08 16:15:02,197 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:15:02,197 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 6, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 16:15:02,197 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:15:02,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:15:02,198 INFO L82 PathProgramCache]: Analyzing trace with hash 212197932, now seen corresponding path program 19 times [2019-09-08 16:15:02,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:15:02,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:15:02,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:15:02,200 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 16:15:02,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:15:02,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:15:02,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1394 backedges. 7 proven. 1326 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-09-08 16:15:02,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:15:02,789 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:15:02,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:15:03,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:15:03,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 1657 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-08 16:15:03,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:15:03,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1394 backedges. 19 proven. 1326 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-08 16:15:03,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:15:03,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-09-08 16:15:03,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-08 16:15:03,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-08 16:15:03,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-08 16:15:03,188 INFO L87 Difference]: Start difference. First operand 697 states and 857 transitions. Second operand 30 states. [2019-09-08 16:15:03,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:15:03,408 INFO L93 Difference]: Finished difference Result 1364 states and 1686 transitions. [2019-09-08 16:15:03,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 16:15:03,409 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 298 [2019-09-08 16:15:03,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:15:03,412 INFO L225 Difference]: With dead ends: 1364 [2019-09-08 16:15:03,412 INFO L226 Difference]: Without dead ends: 711 [2019-09-08 16:15:03,414 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-08 16:15:03,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2019-09-08 16:15:03,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 705. [2019-09-08 16:15:03,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 705 states. [2019-09-08 16:15:03,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 867 transitions. [2019-09-08 16:15:03,447 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 867 transitions. Word has length 298 [2019-09-08 16:15:03,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:15:03,447 INFO L475 AbstractCegarLoop]: Abstraction has 705 states and 867 transitions. [2019-09-08 16:15:03,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-08 16:15:03,447 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 867 transitions. [2019-09-08 16:15:03,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-09-08 16:15:03,450 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:15:03,450 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 6, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 16:15:03,450 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:15:03,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:15:03,451 INFO L82 PathProgramCache]: Analyzing trace with hash -270489837, now seen corresponding path program 20 times [2019-09-08 16:15:03,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:15:03,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:15:03,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:15:03,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:15:03,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:15:03,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:15:04,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1499 backedges. 7 proven. 1431 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-09-08 16:15:04,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:15:04,247 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:15:04,262 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 16:15:04,551 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 16:15:04,551 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 16:15:04,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 1669 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-08 16:15:04,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:15:04,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1499 backedges. 19 proven. 1431 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (28)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 16:15:04,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:15:04,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-09-08 16:15:04,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-08 16:15:04,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-08 16:15:04,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-08 16:15:04,653 INFO L87 Difference]: Start difference. First operand 705 states and 867 transitions. Second operand 31 states. [2019-09-08 16:15:04,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:15:04,841 INFO L93 Difference]: Finished difference Result 1380 states and 1706 transitions. [2019-09-08 16:15:04,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-08 16:15:04,841 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 302 [2019-09-08 16:15:04,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:15:04,845 INFO L225 Difference]: With dead ends: 1380 [2019-09-08 16:15:04,845 INFO L226 Difference]: Without dead ends: 719 [2019-09-08 16:15:04,847 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-08 16:15:04,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2019-09-08 16:15:04,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 713. [2019-09-08 16:15:04,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2019-09-08 16:15:04,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 877 transitions. [2019-09-08 16:15:04,879 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 877 transitions. Word has length 302 [2019-09-08 16:15:04,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:15:04,879 INFO L475 AbstractCegarLoop]: Abstraction has 713 states and 877 transitions. [2019-09-08 16:15:04,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-08 16:15:04,880 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 877 transitions. [2019-09-08 16:15:04,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-09-08 16:15:04,882 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:15:04,883 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 6, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 16:15:04,883 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:15:04,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:15:04,883 INFO L82 PathProgramCache]: Analyzing trace with hash 2094047354, now seen corresponding path program 21 times [2019-09-08 16:15:04,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:15:04,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:15:04,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:15:04,886 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 16:15:04,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:15:04,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:15:05,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1608 backedges. 7 proven. 1540 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-09-08 16:15:05,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:15:05,640 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:15:05,671 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 16:15:06,899 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-08 16:15:06,899 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 16:15:06,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 1090 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-08 16:15:06,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:15:07,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1608 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 1585 trivial. 0 not checked. [2019-09-08 16:15:07,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:15:07,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 12] total 41 [2019-09-08 16:15:07,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-08 16:15:07,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-08 16:15:07,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=495, Invalid=1145, Unknown=0, NotChecked=0, Total=1640 [2019-09-08 16:15:07,161 INFO L87 Difference]: Start difference. First operand 713 states and 877 transitions. Second operand 41 states. [2019-09-08 16:15:07,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:15:07,600 INFO L93 Difference]: Finished difference Result 1406 states and 1741 transitions. [2019-09-08 16:15:07,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-08 16:15:07,600 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 306 [2019-09-08 16:15:07,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:15:07,605 INFO L225 Difference]: With dead ends: 1406 [2019-09-08 16:15:07,605 INFO L226 Difference]: Without dead ends: 733 [2019-09-08 16:15:07,608 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 296 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=503, Invalid=1303, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 16:15:07,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2019-09-08 16:15:07,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 723. [2019-09-08 16:15:07,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 723 states. [2019-09-08 16:15:07,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 889 transitions. [2019-09-08 16:15:07,641 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 889 transitions. Word has length 306 [2019-09-08 16:15:07,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:15:07,644 INFO L475 AbstractCegarLoop]: Abstraction has 723 states and 889 transitions. [2019-09-08 16:15:07,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-08 16:15:07,644 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 889 transitions. [2019-09-08 16:15:07,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-09-08 16:15:07,647 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:15:07,647 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 6, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 16:15:07,647 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:15:07,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:15:07,648 INFO L82 PathProgramCache]: Analyzing trace with hash -2062480208, now seen corresponding path program 22 times [2019-09-08 16:15:07,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:15:07,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:15:07,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:15:07,650 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 16:15:07,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:15:07,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:15:08,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1726 backedges. 7 proven. 1653 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-08 16:15:08,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:15:08,342 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:15:08,374 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 16:15:08,627 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 16:15:08,628 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 16:15:08,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 1156 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-08 16:15:08,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:15:08,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1726 backedges. 19 proven. 21 refuted. 0 times theorem prover too weak. 1686 trivial. 0 not checked. [2019-09-08 16:15:08,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:15:08,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 12] total 42 [2019-09-08 16:15:08,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-08 16:15:08,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-08 16:15:08,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=540, Invalid=1182, Unknown=0, NotChecked=0, Total=1722 [2019-09-08 16:15:08,939 INFO L87 Difference]: Start difference. First operand 723 states and 889 transitions. Second operand 42 states. [2019-09-08 16:15:09,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:15:09,647 INFO L93 Difference]: Finished difference Result 1424 states and 1765 transitions. [2019-09-08 16:15:09,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-08 16:15:09,648 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 311 [2019-09-08 16:15:09,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:15:09,652 INFO L225 Difference]: With dead ends: 1424 [2019-09-08 16:15:09,652 INFO L226 Difference]: Without dead ends: 739 [2019-09-08 16:15:09,654 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=558, Invalid=1422, Unknown=0, NotChecked=0, Total=1980 [2019-09-08 16:15:09,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2019-09-08 16:15:09,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 733. [2019-09-08 16:15:09,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 733 states. [2019-09-08 16:15:09,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 901 transitions. [2019-09-08 16:15:09,691 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 901 transitions. Word has length 311 [2019-09-08 16:15:09,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:15:09,691 INFO L475 AbstractCegarLoop]: Abstraction has 733 states and 901 transitions. [2019-09-08 16:15:09,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-08 16:15:09,691 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 901 transitions. [2019-09-08 16:15:09,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-09-08 16:15:09,694 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:15:09,695 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 7, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 16:15:09,695 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:15:09,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:15:09,695 INFO L82 PathProgramCache]: Analyzing trace with hash -706893146, now seen corresponding path program 23 times [2019-09-08 16:15:09,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:15:09,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:15:09,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:15:09,698 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 16:15:09,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:15:09,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:15:10,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1850 backedges. 7 proven. 1770 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-09-08 16:15:10,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:15:10,540 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 16:15:10,565 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:18:42,922 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2019-09-08 16:18:42,922 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 16:18:43,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-08 16:18:43,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:18:43,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1850 backedges. 19 proven. 1770 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-09-08 16:18:43,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:18:43,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-09-08 16:18:43,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-08 16:18:43,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-08 16:18:43,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 16:18:43,590 INFO L87 Difference]: Start difference. First operand 733 states and 901 transitions. Second operand 34 states. [2019-09-08 16:18:43,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:18:43,845 INFO L93 Difference]: Finished difference Result 1436 states and 1774 transitions. [2019-09-08 16:18:43,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-08 16:18:43,846 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 316 [2019-09-08 16:18:43,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:18:43,850 INFO L225 Difference]: With dead ends: 1436 [2019-09-08 16:18:43,850 INFO L226 Difference]: Without dead ends: 747 [2019-09-08 16:18:43,852 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 16:18:43,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2019-09-08 16:18:43,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 741. [2019-09-08 16:18:43,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2019-09-08 16:18:43,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 911 transitions. [2019-09-08 16:18:43,891 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 911 transitions. Word has length 316 [2019-09-08 16:18:43,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:18:43,891 INFO L475 AbstractCegarLoop]: Abstraction has 741 states and 911 transitions. [2019-09-08 16:18:43,891 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-08 16:18:43,891 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 911 transitions. [2019-09-08 16:18:43,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-08 16:18:43,894 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:18:43,895 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 7, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 16:18:43,895 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:18:43,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:18:43,895 INFO L82 PathProgramCache]: Analyzing trace with hash 640525261, now seen corresponding path program 24 times [2019-09-08 16:18:43,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:18:43,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:18:43,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:18:43,898 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 16:18:43,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:18:43,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:18:44,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1971 backedges. 7 proven. 1891 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-09-08 16:18:44,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:18:44,803 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:18:44,816 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 16:19:12,278 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-08 16:19:12,278 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 16:19:12,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 1385 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-08 16:19:12,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:19:12,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1971 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 1948 trivial. 0 not checked. [2019-09-08 16:19:12,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:19:12,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 8] total 40 [2019-09-08 16:19:12,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-08 16:19:12,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-08 16:19:12,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=579, Invalid=981, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 16:19:12,632 INFO L87 Difference]: Start difference. First operand 741 states and 911 transitions. Second operand 40 states. [2019-09-08 16:19:18,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:19:18,587 INFO L93 Difference]: Finished difference Result 1944 states and 2407 transitions. [2019-09-08 16:19:18,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-08 16:19:18,588 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 320 [2019-09-08 16:19:18,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:19:18,595 INFO L225 Difference]: With dead ends: 1944 [2019-09-08 16:19:18,596 INFO L226 Difference]: Without dead ends: 1244 [2019-09-08 16:19:18,601 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2701 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3458, Invalid=8752, Unknown=0, NotChecked=0, Total=12210 [2019-09-08 16:19:18,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2019-09-08 16:19:18,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 1135. [2019-09-08 16:19:18,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1135 states. [2019-09-08 16:19:18,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 1405 transitions. [2019-09-08 16:19:18,679 INFO L78 Accepts]: Start accepts. Automaton has 1135 states and 1405 transitions. Word has length 320 [2019-09-08 16:19:18,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:19:18,680 INFO L475 AbstractCegarLoop]: Abstraction has 1135 states and 1405 transitions. [2019-09-08 16:19:18,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-08 16:19:18,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 1405 transitions. [2019-09-08 16:19:18,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-08 16:19:18,684 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:19:18,684 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 7, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 16:19:18,685 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:19:18,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:19:18,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1748190221, now seen corresponding path program 1 times [2019-09-08 16:19:18,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:19:18,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:19:18,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:19:18,688 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 16:19:18,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:19:18,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:19:18,946 INFO L134 CoverageAnalysis]: Checked inductivity of 2096 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2089 trivial. 0 not checked. [2019-09-08 16:19:18,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 16:19:18,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 16:19:18,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 16:19:18,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 16:19:18,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 16:19:18,948 INFO L87 Difference]: Start difference. First operand 1135 states and 1405 transitions. Second operand 4 states. [2019-09-08 16:19:19,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:19:19,048 INFO L93 Difference]: Finished difference Result 2257 states and 2818 transitions. [2019-09-08 16:19:19,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 16:19:19,049 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 326 [2019-09-08 16:19:19,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:19:19,056 INFO L225 Difference]: With dead ends: 2257 [2019-09-08 16:19:19,056 INFO L226 Difference]: Without dead ends: 1166 [2019-09-08 16:19:19,061 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 16:19:19,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2019-09-08 16:19:19,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 1147. [2019-09-08 16:19:19,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1147 states. [2019-09-08 16:19:19,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 1147 states and 1422 transitions. [2019-09-08 16:19:19,142 INFO L78 Accepts]: Start accepts. Automaton has 1147 states and 1422 transitions. Word has length 326 [2019-09-08 16:19:19,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:19:19,143 INFO L475 AbstractCegarLoop]: Abstraction has 1147 states and 1422 transitions. [2019-09-08 16:19:19,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 16:19:19,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1422 transitions. [2019-09-08 16:19:19,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-08 16:19:19,147 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:19:19,148 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 7, 5, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 16:19:19,148 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:19:19,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:19:19,148 INFO L82 PathProgramCache]: Analyzing trace with hash 2098598988, now seen corresponding path program 1 times [2019-09-08 16:19:19,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:19:19,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:19:19,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:19:19,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:19:19,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:19:19,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:19:19,945 INFO L134 CoverageAnalysis]: Checked inductivity of 2098 backedges. 7 proven. 2016 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-08 16:19:19,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:19:19,945 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:19:19,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:19:20,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:19:20,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 1776 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-08 16:19:20,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:19:20,487 INFO L134 CoverageAnalysis]: Checked inductivity of 2098 backedges. 19 proven. 2016 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-09-08 16:19:20,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:19:20,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-09-08 16:19:20,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-08 16:19:20,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-08 16:19:20,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 16:19:20,498 INFO L87 Difference]: Start difference. First operand 1147 states and 1422 transitions. Second operand 36 states. [2019-09-08 16:19:20,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:19:20,860 INFO L93 Difference]: Finished difference Result 2271 states and 2827 transitions. [2019-09-08 16:19:20,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-08 16:19:20,861 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 328 [2019-09-08 16:19:20,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:19:20,867 INFO L225 Difference]: With dead ends: 2271 [2019-09-08 16:19:20,867 INFO L226 Difference]: Without dead ends: 1168 [2019-09-08 16:19:20,870 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 16:19:20,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2019-09-08 16:19:20,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 1159. [2019-09-08 16:19:20,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1159 states. [2019-09-08 16:19:20,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 1437 transitions. [2019-09-08 16:19:20,936 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 1437 transitions. Word has length 328 [2019-09-08 16:19:20,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:19:20,936 INFO L475 AbstractCegarLoop]: Abstraction has 1159 states and 1437 transitions. [2019-09-08 16:19:20,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-08 16:19:20,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1437 transitions. [2019-09-08 16:19:20,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-08 16:19:20,941 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:19:20,942 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 7, 5, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 16:19:20,942 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:19:20,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:19:20,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1775334669, now seen corresponding path program 2 times [2019-09-08 16:19:20,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:19:20,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:19:20,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:19:20,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 16:19:20,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:19:21,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:19:21,959 INFO L134 CoverageAnalysis]: Checked inductivity of 2227 backedges. 7 proven. 2145 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-08 16:19:21,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:19:21,960 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 16:19:21,990 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:19:22,279 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 16:19:22,279 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 16:19:22,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 1788 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-08 16:19:22,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:19:22,356 INFO L134 CoverageAnalysis]: Checked inductivity of 2227 backedges. 19 proven. 2145 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-09-08 16:19:22,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:19:22,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2019-09-08 16:19:22,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-08 16:19:22,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-08 16:19:22,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 16:19:22,364 INFO L87 Difference]: Start difference. First operand 1159 states and 1437 transitions. Second operand 37 states. [2019-09-08 16:19:22,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:19:22,686 INFO L93 Difference]: Finished difference Result 2295 states and 2857 transitions. [2019-09-08 16:19:22,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-08 16:19:22,687 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 332 [2019-09-08 16:19:22,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:19:22,692 INFO L225 Difference]: With dead ends: 2295 [2019-09-08 16:19:22,692 INFO L226 Difference]: Without dead ends: 1180 [2019-09-08 16:19:22,696 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 16:19:22,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2019-09-08 16:19:22,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 1171. [2019-09-08 16:19:22,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1171 states. [2019-09-08 16:19:22,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 1171 states and 1452 transitions. [2019-09-08 16:19:22,760 INFO L78 Accepts]: Start accepts. Automaton has 1171 states and 1452 transitions. Word has length 332 [2019-09-08 16:19:22,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:19:22,760 INFO L475 AbstractCegarLoop]: Abstraction has 1171 states and 1452 transitions. [2019-09-08 16:19:22,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-08 16:19:22,761 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 1452 transitions. [2019-09-08 16:19:22,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-09-08 16:19:22,764 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:19:22,764 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 7, 5, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 16:19:22,764 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:19:22,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:19:22,765 INFO L82 PathProgramCache]: Analyzing trace with hash -347253222, now seen corresponding path program 3 times [2019-09-08 16:19:22,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:19:22,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:19:22,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:19:22,767 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 16:19:22,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:19:22,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:19:23,711 INFO L134 CoverageAnalysis]: Checked inductivity of 2360 backedges. 7 proven. 2278 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-08 16:19:23,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:19:23,711 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:19:23,725 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 16:19:45,278 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-08 16:19:45,278 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 16:19:45,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 1404 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-08 16:19:45,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:19:45,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2360 backedges. 22 proven. 28 refuted. 0 times theorem prover too weak. 2310 trivial. 0 not checked. [2019-09-08 16:19:45,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:19:45,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 15] total 50 [2019-09-08 16:19:45,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-08 16:19:45,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-08 16:19:45,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=730, Invalid=1720, Unknown=0, NotChecked=0, Total=2450 [2019-09-08 16:19:45,706 INFO L87 Difference]: Start difference. First operand 1171 states and 1452 transitions. Second operand 50 states. [2019-09-08 16:19:46,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:19:46,284 INFO L93 Difference]: Finished difference Result 2331 states and 2915 transitions. [2019-09-08 16:19:46,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-08 16:19:46,284 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 336 [2019-09-08 16:19:46,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:19:46,290 INFO L225 Difference]: With dead ends: 2331 [2019-09-08 16:19:46,290 INFO L226 Difference]: Without dead ends: 1195 [2019-09-08 16:19:46,295 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=748, Invalid=2008, Unknown=0, NotChecked=0, Total=2756 [2019-09-08 16:19:46,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2019-09-08 16:19:46,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 1186. [2019-09-08 16:19:46,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1186 states. [2019-09-08 16:19:46,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 1470 transitions. [2019-09-08 16:19:46,366 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 1470 transitions. Word has length 336 [2019-09-08 16:19:46,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:19:46,366 INFO L475 AbstractCegarLoop]: Abstraction has 1186 states and 1470 transitions. [2019-09-08 16:19:46,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-08 16:19:46,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1470 transitions. [2019-09-08 16:19:46,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2019-09-08 16:19:46,370 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:19:46,371 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 8, 5, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 16:19:46,371 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:19:46,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:19:46,372 INFO L82 PathProgramCache]: Analyzing trace with hash 710274622, now seen corresponding path program 4 times [2019-09-08 16:19:46,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:19:46,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:19:46,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:19:46,374 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 16:19:46,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:19:46,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:19:47,558 INFO L134 CoverageAnalysis]: Checked inductivity of 2505 backedges. 7 proven. 2415 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-09-08 16:19:47,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:19:47,559 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:19:47,578 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 16:19:47,810 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 16:19:47,810 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 16:19:47,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 1254 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-08 16:19:47,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:19:48,168 INFO L134 CoverageAnalysis]: Checked inductivity of 2505 backedges. 19 proven. 36 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-09-08 16:19:48,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:19:48,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 14] total 50 [2019-09-08 16:19:48,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-08 16:19:48,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-08 16:19:48,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=766, Invalid=1684, Unknown=0, NotChecked=0, Total=2450 [2019-09-08 16:19:48,177 INFO L87 Difference]: Start difference. First operand 1186 states and 1470 transitions. Second operand 50 states. [2019-09-08 16:19:49,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:19:49,180 INFO L93 Difference]: Finished difference Result 2361 states and 2951 transitions. [2019-09-08 16:19:49,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-08 16:19:49,180 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 341 [2019-09-08 16:19:49,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:19:49,187 INFO L225 Difference]: With dead ends: 2361 [2019-09-08 16:19:49,187 INFO L226 Difference]: Without dead ends: 1210 [2019-09-08 16:19:49,191 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 445 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=784, Invalid=1972, Unknown=0, NotChecked=0, Total=2756 [2019-09-08 16:19:49,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2019-09-08 16:19:49,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 1201. [2019-09-08 16:19:49,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1201 states. [2019-09-08 16:19:49,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1201 states to 1201 states and 1488 transitions. [2019-09-08 16:19:49,264 INFO L78 Accepts]: Start accepts. Automaton has 1201 states and 1488 transitions. Word has length 341 [2019-09-08 16:19:49,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:19:49,265 INFO L475 AbstractCegarLoop]: Abstraction has 1201 states and 1488 transitions. [2019-09-08 16:19:49,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-08 16:19:49,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1201 states and 1488 transitions. [2019-09-08 16:19:49,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2019-09-08 16:19:49,269 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:19:49,269 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 9, 5, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 16:19:49,269 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:19:49,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:19:49,270 INFO L82 PathProgramCache]: Analyzing trace with hash 77564872, now seen corresponding path program 5 times [2019-09-08 16:19:49,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:19:49,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:19:49,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:19:49,272 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 16:19:49,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:19:49,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:19:50,465 INFO L134 CoverageAnalysis]: Checked inductivity of 2655 backedges. 7 proven. 2556 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-08 16:19:50,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:19:50,465 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:19:50,482 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 16:23:58,745 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 37 check-sat command(s) [2019-09-08 16:23:58,745 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 16:23:58,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 783 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-08 16:23:58,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 16:23:58,896 INFO L134 CoverageAnalysis]: Checked inductivity of 2655 backedges. 19 proven. 2556 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-09-08 16:23:58,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 16:23:58,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 40 [2019-09-08 16:23:58,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-08 16:23:58,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-08 16:23:58,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 16:23:58,939 INFO L87 Difference]: Start difference. First operand 1201 states and 1488 transitions. Second operand 40 states. [2019-09-08 16:23:59,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 16:23:59,268 INFO L93 Difference]: Finished difference Result 2379 states and 2959 transitions. [2019-09-08 16:23:59,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-08 16:23:59,269 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 346 [2019-09-08 16:23:59,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 16:23:59,273 INFO L225 Difference]: With dead ends: 2379 [2019-09-08 16:23:59,273 INFO L226 Difference]: Without dead ends: 1222 [2019-09-08 16:23:59,276 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 16:23:59,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2019-09-08 16:23:59,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 1213. [2019-09-08 16:23:59,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1213 states. [2019-09-08 16:23:59,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1213 states to 1213 states and 1503 transitions. [2019-09-08 16:23:59,343 INFO L78 Accepts]: Start accepts. Automaton has 1213 states and 1503 transitions. Word has length 346 [2019-09-08 16:23:59,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 16:23:59,343 INFO L475 AbstractCegarLoop]: Abstraction has 1213 states and 1503 transitions. [2019-09-08 16:23:59,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-08 16:23:59,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1213 states and 1503 transitions. [2019-09-08 16:23:59,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-09-08 16:23:59,347 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 16:23:59,347 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 9, 5, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 16:23:59,347 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 16:23:59,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 16:23:59,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1158920529, now seen corresponding path program 6 times [2019-09-08 16:23:59,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 16:23:59,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 16:23:59,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:23:59,350 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 16:23:59,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 16:23:59,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 16:24:00,264 INFO L134 CoverageAnalysis]: Checked inductivity of 2800 backedges. 7 proven. 2701 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-08 16:24:00,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 16:24:00,264 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 16:24:00,281 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE