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-673a906-m [2019-10-02 06:51:18,770 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 06:51:18,773 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 06:51:18,786 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 06:51:18,786 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 06:51:18,788 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 06:51:18,789 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 06:51:18,792 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 06:51:18,793 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 06:51:18,794 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 06:51:18,796 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 06:51:18,797 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 06:51:18,797 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 06:51:18,798 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 06:51:18,799 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 06:51:18,800 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 06:51:18,801 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 06:51:18,802 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 06:51:18,804 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 06:51:18,806 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 06:51:18,807 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 06:51:18,809 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 06:51:18,810 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 06:51:18,810 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 06:51:18,813 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 06:51:18,813 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 06:51:18,813 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 06:51:18,814 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 06:51:18,815 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 06:51:18,816 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 06:51:18,816 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 06:51:18,817 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 06:51:18,818 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 06:51:18,818 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 06:51:18,819 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 06:51:18,819 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 06:51:18,820 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 06:51:18,820 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 06:51:18,821 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 06:51:18,822 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 06:51:18,822 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 06:51:18,823 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 06:51:18,844 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 06:51:18,844 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 06:51:18,846 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 06:51:18,846 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 06:51:18,847 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 06:51:18,847 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 06:51:18,847 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 06:51:18,847 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 06:51:18,847 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 06:51:18,848 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 06:51:18,848 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 06:51:18,848 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 06:51:18,849 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 06:51:18,849 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 06:51:18,849 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 06:51:18,849 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 06:51:18,850 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 06:51:18,850 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 06:51:18,851 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 06:51:18,851 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 06:51:18,851 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 06:51:18,851 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 06:51:18,851 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 06:51:18,851 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 06:51:18,852 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 06:51:18,852 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 06:51:18,852 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 06:51:18,852 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 06:51:18,852 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 06:51:18,887 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 06:51:18,899 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 06:51:18,903 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 06:51:18,905 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 06:51:18,905 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 06:51:18,906 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-10-02 06:51:18,974 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4eb60cd9/6f211b61228e46be97cdb0617463fedd/FLAGdacc0ab8f [2019-10-02 06:51:19,722 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 06:51:19,723 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-10-02 06:51:19,764 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4eb60cd9/6f211b61228e46be97cdb0617463fedd/FLAGdacc0ab8f [2019-10-02 06:51:20,279 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4eb60cd9/6f211b61228e46be97cdb0617463fedd [2019-10-02 06:51:20,290 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 06:51:20,292 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 06:51:20,293 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 06:51:20,294 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 06:51:20,298 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 06:51:20,299 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 06:51:20" (1/1) ... [2019-10-02 06:51:20,302 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6784b4f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 06:51:20, skipping insertion in model container [2019-10-02 06:51:20,303 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 06:51:20" (1/1) ... [2019-10-02 06:51:20,311 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 06:51:20,446 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 06:51:21,833 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 06:51:21,863 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 06:51:22,056 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 06:51:22,120 INFO L192 MainTranslator]: Completed translation [2019-10-02 06:51:22,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 06:51:22 WrapperNode [2019-10-02 06:51:22,121 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 06:51:22,122 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 06:51:22,122 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 06:51:22,123 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 06:51:22,139 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 06:51:22" (1/1) ... [2019-10-02 06:51:22,139 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 06:51:22" (1/1) ... [2019-10-02 06:51:22,193 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 06:51:22" (1/1) ... [2019-10-02 06:51:22,196 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 06:51:22" (1/1) ... [2019-10-02 06:51:22,264 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 06:51:22" (1/1) ... [2019-10-02 06:51:22,284 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 06:51:22" (1/1) ... [2019-10-02 06:51:22,294 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 06:51:22" (1/1) ... [2019-10-02 06:51:22,311 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 06:51:22,312 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 06:51:22,312 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 06:51:22,312 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 06:51:22,316 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 06:51:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 06:51:22,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 06:51:22,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 06:51:22,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~int~X~$Pointer$~X~int~TO~VOID [2019-10-02 06:51:22,398 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reset_mac_header [2019-10-02 06:51:22,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-10-02 06:51:22,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-10-02 06:51:22,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2019-10-02 06:51:22,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ptr [2019-10-02 06:51:22,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ulong [2019-10-02 06:51:22,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2019-10-02 06:51:22,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2019-10-02 06:51:22,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2019-10-02 06:51:22,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_trap [2019-10-02 06:51:22,400 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2019-10-02 06:51:22,401 INFO L138 BoogieDeclarations]: Found implementation of procedure arcnet_raw_init [2019-10-02 06:51:22,401 INFO L138 BoogieDeclarations]: Found implementation of procedure arcnet_raw_exit [2019-10-02 06:51:22,401 INFO L138 BoogieDeclarations]: Found implementation of procedure rx [2019-10-02 06:51:22,401 INFO L138 BoogieDeclarations]: Found implementation of procedure build_header [2019-10-02 06:51:22,401 INFO L138 BoogieDeclarations]: Found implementation of procedure prepare_tx [2019-10-02 06:51:22,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize_ArcProto_1 [2019-10-02 06:51:22,403 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 06:51:22,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_consume_skb_5 [2019-10-02 06:51:22,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kfree_skb_6 [2019-10-02 06:51:22,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kfree_skb_7 [2019-10-02 06:51:22,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kfree_skb_8 [2019-10-02 06:51:22,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kfree_skb_11 [2019-10-02 06:51:22,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kfree_skb_13 [2019-10-02 06:51:22,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_skb_14 [2019-10-02 06:51:22,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_netif_rx_15 [2019-10-02 06:51:22,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_init [2019-10-02 06:51:22,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_add [2019-10-02 06:51:22,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2019-10-02 06:51:22,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_contains [2019-10-02 06:51:22,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_is_empty [2019-10-02 06:51:22,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2019-10-02 06:51:22,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_err_ptr [2019-10-02 06:51:22,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_ptr_err [2019-10-02 06:51:22,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err_or_null [2019-10-02 06:51:22,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2019-10-02 06:51:22,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2019-10-02 06:51:22,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free [2019-10-02 06:51:22,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free_int [2019-10-02 06:51:22,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_alloc_skb [2019-10-02 06:51:22,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_netdev_alloc_skb [2019-10-02 06:51:22,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_current [2019-10-02 06:51:22,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2019-10-02 06:51:22,409 INFO L138 BoogieDeclarations]: Found implementation of procedure arcnet_unregister_proto [2019-10-02 06:51:22,410 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2019-10-02 06:51:22,410 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_pull [2019-10-02 06:51:22,410 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_push [2019-10-02 06:51:22,410 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2019-10-02 06:51:22,410 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2019-10-02 06:51:22,410 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-10-02 06:51:22,411 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-10-02 06:51:22,411 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-10-02 06:51:22,411 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-10-02 06:51:22,411 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 06:51:22,412 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2019-10-02 06:51:22,412 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2019-10-02 06:51:22,412 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-10-02 06:51:22,412 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-10-02 06:51:22,412 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kfree_skb_6 [2019-10-02 06:51:22,413 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kfree_skb_7 [2019-10-02 06:51:22,413 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kfree_skb_8 [2019-10-02 06:51:22,413 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kfree_skb_11 [2019-10-02 06:51:22,413 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kfree_skb_13 [2019-10-02 06:51:22,413 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_consume_skb_5 [2019-10-02 06:51:22,414 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_skb_14 [2019-10-02 06:51:22,414 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2019-10-02 06:51:22,414 INFO L130 BoogieDeclarations]: Found specification of procedure skb_push [2019-10-02 06:51:22,414 INFO L130 BoogieDeclarations]: Found specification of procedure skb_pull [2019-10-02 06:51:22,415 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reset_mac_header [2019-10-02 06:51:22,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 06:51:22,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 06:51:22,416 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2019-10-02 06:51:22,416 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free [2019-10-02 06:51:22,416 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free_int [2019-10-02 06:51:22,416 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 06:51:22,417 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-02 06:51:22,417 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 06:51:22,417 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2019-10-02 06:51:22,418 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-10-02 06:51:22,418 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-02 06:51:22,419 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-02 06:51:22,419 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-10-02 06:51:22,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 06:51:22,420 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-10-02 06:51:22,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-10-02 06:51:22,421 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2019-10-02 06:51:22,422 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ptr [2019-10-02 06:51:22,423 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ulong [2019-10-02 06:51:22,424 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2019-10-02 06:51:22,424 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2019-10-02 06:51:22,424 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_trap [2019-10-02 06:51:22,425 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize_ArcProto_1 [2019-10-02 06:51:22,425 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2019-10-02 06:51:22,425 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_netif_rx_15 [2019-10-02 06:51:22,425 INFO L130 BoogieDeclarations]: Found specification of procedure arcnet_unregister_proto [2019-10-02 06:51:22,425 INFO L130 BoogieDeclarations]: Found specification of procedure rx [2019-10-02 06:51:22,425 INFO L130 BoogieDeclarations]: Found specification of procedure build_header [2019-10-02 06:51:22,426 INFO L130 BoogieDeclarations]: Found specification of procedure prepare_tx [2019-10-02 06:51:22,426 INFO L130 BoogieDeclarations]: Found specification of procedure arcnet_raw_init [2019-10-02 06:51:22,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 06:51:22,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 06:51:22,426 INFO L130 BoogieDeclarations]: Found specification of procedure arcnet_raw_exit [2019-10-02 06:51:22,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-10-02 06:51:22,427 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~int~X~$Pointer$~X~int~TO~VOID [2019-10-02 06:51:22,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 06:51:22,428 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2019-10-02 06:51:22,428 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2019-10-02 06:51:22,428 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 06:51:22,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-10-02 06:51:22,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 06:51:22,429 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_init [2019-10-02 06:51:22,429 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_add [2019-10-02 06:51:22,429 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2019-10-02 06:51:22,430 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_contains [2019-10-02 06:51:22,430 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_is_empty [2019-10-02 06:51:22,430 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2019-10-02 06:51:22,430 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_err_ptr [2019-10-02 06:51:22,431 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_ptr_err [2019-10-02 06:51:22,431 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err_or_null [2019-10-02 06:51:22,431 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_netdev_alloc_skb [2019-10-02 06:51:22,431 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_alloc_skb [2019-10-02 06:51:22,432 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_current [2019-10-02 06:51:22,433 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2019-10-02 06:51:22,433 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 06:51:22,433 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-10-02 06:51:22,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 06:51:22,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 06:51:22,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-02 06:51:22,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 06:51:22,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-10-02 06:51:22,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-10-02 06:51:22,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-10-02 06:51:22,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-10-02 06:51:23,235 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2019-10-02 06:51:23,861 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 06:51:23,861 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-02 06:51:23,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 06:51:23 BoogieIcfgContainer [2019-10-02 06:51:23,863 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 06:51:23,865 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 06:51:23,865 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 06:51:23,868 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 06:51:23,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 06:51:20" (1/3) ... [2019-10-02 06:51:23,869 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2901a83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 06:51:23, skipping insertion in model container [2019-10-02 06:51:23,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 06:51:22" (2/3) ... [2019-10-02 06:51:23,870 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2901a83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 06:51:23, skipping insertion in model container [2019-10-02 06:51:23,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 06:51:23" (3/3) ... [2019-10-02 06:51:23,872 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-10-02 06:51:23,884 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 06:51:23,894 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 06:51:23,913 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 06:51:23,950 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 06:51:23,951 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 06:51:23,951 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 06:51:23,951 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 06:51:23,951 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 06:51:23,951 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 06:51:23,951 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 06:51:23,952 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 06:51:23,952 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 06:51:23,977 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states. [2019-10-02 06:51:23,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-02 06:51:23,988 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:51:23,989 INFO L411 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-10-02 06:51:23,992 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:51:23,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:51:23,998 INFO L82 PathProgramCache]: Analyzing trace with hash -789799879, now seen corresponding path program 1 times [2019-10-02 06:51:24,000 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:51:24,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:51:24,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:51:24,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 06:51:24,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:51:24,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:51:24,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 06:51:24,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 06:51:24,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 06:51:24,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 06:51:24,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 06:51:24,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 06:51:24,495 INFO L87 Difference]: Start difference. First operand 255 states. Second operand 3 states. [2019-10-02 06:51:24,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:51:24,679 INFO L93 Difference]: Finished difference Result 607 states and 790 transitions. [2019-10-02 06:51:24,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 06:51:24,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-10-02 06:51:24,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:51:24,712 INFO L225 Difference]: With dead ends: 607 [2019-10-02 06:51:24,712 INFO L226 Difference]: Without dead ends: 380 [2019-10-02 06:51:24,724 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 06:51:24,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-10-02 06:51:24,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2019-10-02 06:51:24,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2019-10-02 06:51:24,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 468 transitions. [2019-10-02 06:51:24,845 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 468 transitions. Word has length 49 [2019-10-02 06:51:24,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:51:24,846 INFO L475 AbstractCegarLoop]: Abstraction has 380 states and 468 transitions. [2019-10-02 06:51:24,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 06:51:24,846 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 468 transitions. [2019-10-02 06:51:24,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-02 06:51:24,850 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:51:24,850 INFO L411 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-10-02 06:51:24,850 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:51:24,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:51:24,851 INFO L82 PathProgramCache]: Analyzing trace with hash 545359979, now seen corresponding path program 1 times [2019-10-02 06:51:24,851 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:51:24,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:51:24,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:51:24,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 06:51:24,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:51:24,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:51:24,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 06:51:24,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 06:51:24,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 06:51:24,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 06:51:24,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 06:51:24,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 06:51:24,973 INFO L87 Difference]: Start difference. First operand 380 states and 468 transitions. Second operand 3 states. [2019-10-02 06:51:25,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:51:25,041 INFO L93 Difference]: Finished difference Result 743 states and 920 transitions. [2019-10-02 06:51:25,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 06:51:25,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-10-02 06:51:25,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:51:25,046 INFO L225 Difference]: With dead ends: 743 [2019-10-02 06:51:25,046 INFO L226 Difference]: Without dead ends: 384 [2019-10-02 06:51:25,049 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 06:51:25,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-10-02 06:51:25,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 381. [2019-10-02 06:51:25,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-10-02 06:51:25,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 469 transitions. [2019-10-02 06:51:25,098 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 469 transitions. Word has length 52 [2019-10-02 06:51:25,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:51:25,099 INFO L475 AbstractCegarLoop]: Abstraction has 381 states and 469 transitions. [2019-10-02 06:51:25,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 06:51:25,099 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 469 transitions. [2019-10-02 06:51:25,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-02 06:51:25,104 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:51:25,104 INFO L411 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-10-02 06:51:25,104 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:51:25,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:51:25,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1879641692, now seen corresponding path program 1 times [2019-10-02 06:51:25,105 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:51:25,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:51:25,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:51:25,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 06:51:25,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:51:25,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:51:25,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-02 06:51:25,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 06:51:25,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 06:51:25,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 06:51:25,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 06:51:25,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 06:51:25,291 INFO L87 Difference]: Start difference. First operand 381 states and 469 transitions. Second operand 5 states. [2019-10-02 06:51:25,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:51:25,419 INFO L93 Difference]: Finished difference Result 740 states and 913 transitions. [2019-10-02 06:51:25,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 06:51:25,420 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-10-02 06:51:25,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:51:25,423 INFO L225 Difference]: With dead ends: 740 [2019-10-02 06:51:25,423 INFO L226 Difference]: Without dead ends: 380 [2019-10-02 06:51:25,425 INFO L640 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-10-02 06:51:25,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-10-02 06:51:25,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2019-10-02 06:51:25,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2019-10-02 06:51:25,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 465 transitions. [2019-10-02 06:51:25,458 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 465 transitions. Word has length 56 [2019-10-02 06:51:25,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:51:25,464 INFO L475 AbstractCegarLoop]: Abstraction has 380 states and 465 transitions. [2019-10-02 06:51:25,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 06:51:25,465 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 465 transitions. [2019-10-02 06:51:25,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-02 06:51:25,481 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:51:25,482 INFO L411 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-10-02 06:51:25,482 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:51:25,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:51:25,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1950715239, now seen corresponding path program 1 times [2019-10-02 06:51:25,484 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:51:25,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:51:25,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:51:25,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 06:51:25,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:51:25,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:51:25,677 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 06:51:25,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 06:51:25,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 06:51:25,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 06:51:25,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 06:51:25,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 06:51:25,679 INFO L87 Difference]: Start difference. First operand 380 states and 465 transitions. Second operand 6 states. [2019-10-02 06:51:26,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:51:26,060 INFO L93 Difference]: Finished difference Result 1103 states and 1375 transitions. [2019-10-02 06:51:26,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 06:51:26,061 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 86 [2019-10-02 06:51:26,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:51:26,072 INFO L225 Difference]: With dead ends: 1103 [2019-10-02 06:51:26,073 INFO L226 Difference]: Without dead ends: 728 [2019-10-02 06:51:26,074 INFO L640 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-10-02 06:51:26,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2019-10-02 06:51:26,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 728. [2019-10-02 06:51:26,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 728 states. [2019-10-02 06:51:26,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 906 transitions. [2019-10-02 06:51:26,133 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 906 transitions. Word has length 86 [2019-10-02 06:51:26,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:51:26,134 INFO L475 AbstractCegarLoop]: Abstraction has 728 states and 906 transitions. [2019-10-02 06:51:26,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 06:51:26,134 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 906 transitions. [2019-10-02 06:51:26,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-02 06:51:26,144 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:51:26,145 INFO L411 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-10-02 06:51:26,145 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:51:26,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:51:26,145 INFO L82 PathProgramCache]: Analyzing trace with hash -515770902, now seen corresponding path program 1 times [2019-10-02 06:51:26,146 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:51:26,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:51:26,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:51:26,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 06:51:26,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:51:26,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:51:26,242 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 06:51:26,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 06:51:26,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 06:51:26,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 06:51:26,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 06:51:26,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 06:51:26,245 INFO L87 Difference]: Start difference. First operand 728 states and 906 transitions. Second operand 3 states. [2019-10-02 06:51:26,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:51:26,290 INFO L93 Difference]: Finished difference Result 1206 states and 1504 transitions. [2019-10-02 06:51:26,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 06:51:26,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2019-10-02 06:51:26,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:51:26,294 INFO L225 Difference]: With dead ends: 1206 [2019-10-02 06:51:26,294 INFO L226 Difference]: Without dead ends: 499 [2019-10-02 06:51:26,296 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 06:51:26,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2019-10-02 06:51:26,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 454. [2019-10-02 06:51:26,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2019-10-02 06:51:26,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 568 transitions. [2019-10-02 06:51:26,372 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 568 transitions. Word has length 132 [2019-10-02 06:51:26,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:51:26,376 INFO L475 AbstractCegarLoop]: Abstraction has 454 states and 568 transitions. [2019-10-02 06:51:26,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 06:51:26,376 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 568 transitions. [2019-10-02 06:51:26,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-02 06:51:26,380 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:51:26,380 INFO L411 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-10-02 06:51:26,380 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:51:26,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:51:26,381 INFO L82 PathProgramCache]: Analyzing trace with hash 601633960, now seen corresponding path program 2 times [2019-10-02 06:51:26,381 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:51:26,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:51:26,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:51:26,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 06:51:26,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:51:26,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:51:26,515 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-02 06:51:26,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 06:51:26,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 06:51:26,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 06:51:26,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 06:51:26,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 06:51:26,517 INFO L87 Difference]: Start difference. First operand 454 states and 568 transitions. Second operand 5 states. [2019-10-02 06:51:26,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:51:26,556 INFO L93 Difference]: Finished difference Result 879 states and 1116 transitions. [2019-10-02 06:51:26,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 06:51:26,557 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 132 [2019-10-02 06:51:26,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:51:26,560 INFO L225 Difference]: With dead ends: 879 [2019-10-02 06:51:26,560 INFO L226 Difference]: Without dead ends: 468 [2019-10-02 06:51:26,562 INFO L640 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-10-02 06:51:26,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2019-10-02 06:51:26,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 464. [2019-10-02 06:51:26,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-10-02 06:51:26,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 582 transitions. [2019-10-02 06:51:26,583 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 582 transitions. Word has length 132 [2019-10-02 06:51:26,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:51:26,583 INFO L475 AbstractCegarLoop]: Abstraction has 464 states and 582 transitions. [2019-10-02 06:51:26,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 06:51:26,583 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 582 transitions. [2019-10-02 06:51:26,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-02 06:51:26,586 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:51:26,586 INFO L411 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-10-02 06:51:26,587 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:51:26,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:51:26,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1908363611, now seen corresponding path program 1 times [2019-10-02 06:51:26,587 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:51:26,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:51:26,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:51:26,592 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 06:51:26,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:51:26,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:51:26,717 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 06:51:26,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 06:51:26,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 06:51:26,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 06:51:26,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 06:51:26,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 06:51:26,719 INFO L87 Difference]: Start difference. First operand 464 states and 582 transitions. Second operand 4 states. [2019-10-02 06:51:26,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:51:26,775 INFO L93 Difference]: Finished difference Result 902 states and 1137 transitions. [2019-10-02 06:51:26,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 06:51:26,778 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-10-02 06:51:26,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:51:26,781 INFO L225 Difference]: With dead ends: 902 [2019-10-02 06:51:26,781 INFO L226 Difference]: Without dead ends: 465 [2019-10-02 06:51:26,784 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 06:51:26,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2019-10-02 06:51:26,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 465. [2019-10-02 06:51:26,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-10-02 06:51:26,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 583 transitions. [2019-10-02 06:51:26,808 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 583 transitions. Word has length 137 [2019-10-02 06:51:26,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:51:26,809 INFO L475 AbstractCegarLoop]: Abstraction has 465 states and 583 transitions. [2019-10-02 06:51:26,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 06:51:26,809 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 583 transitions. [2019-10-02 06:51:26,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-02 06:51:26,812 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:51:26,812 INFO L411 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, 1] [2019-10-02 06:51:26,812 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:51:26,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:51:26,813 INFO L82 PathProgramCache]: Analyzing trace with hash 2095849708, now seen corresponding path program 1 times [2019-10-02 06:51:26,813 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:51:26,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:51:26,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:51:26,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 06:51:26,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:51:26,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:51:26,990 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 06:51:26,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 06:51:26,990 INFO L224 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-10-02 06:51:27,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 06:51:27,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:51:27,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 929 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 06:51:27,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 06:51:27,461 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 06:51:27,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 06:51:27,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-02 06:51:27,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 06:51:27,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 06:51:27,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 06:51:27,481 INFO L87 Difference]: Start difference. First operand 465 states and 583 transitions. Second operand 5 states. [2019-10-02 06:51:27,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:51:27,534 INFO L93 Difference]: Finished difference Result 900 states and 1138 transitions. [2019-10-02 06:51:27,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 06:51:27,535 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 138 [2019-10-02 06:51:27,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:51:27,538 INFO L225 Difference]: With dead ends: 900 [2019-10-02 06:51:27,538 INFO L226 Difference]: Without dead ends: 479 [2019-10-02 06:51:27,541 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 06:51:27,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-10-02 06:51:27,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 473. [2019-10-02 06:51:27,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2019-10-02 06:51:27,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 593 transitions. [2019-10-02 06:51:27,578 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 593 transitions. Word has length 138 [2019-10-02 06:51:27,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:51:27,579 INFO L475 AbstractCegarLoop]: Abstraction has 473 states and 593 transitions. [2019-10-02 06:51:27,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 06:51:27,579 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 593 transitions. [2019-10-02 06:51:27,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-02 06:51:27,583 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:51:27,584 INFO L411 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-10-02 06:51:27,584 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:51:27,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:51:27,584 INFO L82 PathProgramCache]: Analyzing trace with hash -2102283821, now seen corresponding path program 2 times [2019-10-02 06:51:27,585 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:51:27,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:51:27,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:51:27,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 06:51:27,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:51:27,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:51:27,753 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 06:51:27,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 06:51:27,754 INFO L224 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-10-02 06:51:27,854 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 06:51:27,973 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-10-02 06:51:27,973 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 06:51:27,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 48 conjunts are in the unsatisfiable core [2019-10-02 06:51:27,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 06:51:28,217 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 06:51:28,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 06:51:28,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2019-10-02 06:51:28,233 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 06:51:28,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 06:51:28,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-10-02 06:51:28,234 INFO L87 Difference]: Start difference. First operand 473 states and 593 transitions. Second operand 14 states. [2019-10-02 06:51:28,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:51:28,621 INFO L93 Difference]: Finished difference Result 966 states and 1237 transitions. [2019-10-02 06:51:28,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 06:51:28,622 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 142 [2019-10-02 06:51:28,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:51:28,627 INFO L225 Difference]: With dead ends: 966 [2019-10-02 06:51:28,627 INFO L226 Difference]: Without dead ends: 537 [2019-10-02 06:51:28,634 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-10-02 06:51:28,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2019-10-02 06:51:28,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 493. [2019-10-02 06:51:28,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2019-10-02 06:51:28,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 613 transitions. [2019-10-02 06:51:28,683 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 613 transitions. Word has length 142 [2019-10-02 06:51:28,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:51:28,685 INFO L475 AbstractCegarLoop]: Abstraction has 493 states and 613 transitions. [2019-10-02 06:51:28,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 06:51:28,685 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 613 transitions. [2019-10-02 06:51:28,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-10-02 06:51:28,691 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:51:28,691 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 06:51:28,691 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:51:28,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:51:28,692 INFO L82 PathProgramCache]: Analyzing trace with hash 774086827, now seen corresponding path program 1 times [2019-10-02 06:51:28,692 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:51:28,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:51:28,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:51:28,699 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 06:51:28,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:51:28,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:51:28,832 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-02 06:51:28,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 06:51:28,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 06:51:28,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 06:51:28,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 06:51:28,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 06:51:28,834 INFO L87 Difference]: Start difference. First operand 493 states and 613 transitions. Second operand 3 states. [2019-10-02 06:51:28,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:51:28,859 INFO L93 Difference]: Finished difference Result 737 states and 922 transitions. [2019-10-02 06:51:28,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 06:51:28,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2019-10-02 06:51:28,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:51:28,863 INFO L225 Difference]: With dead ends: 737 [2019-10-02 06:51:28,864 INFO L226 Difference]: Without dead ends: 497 [2019-10-02 06:51:28,865 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 06:51:28,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2019-10-02 06:51:28,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 495. [2019-10-02 06:51:28,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-10-02 06:51:28,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 615 transitions. [2019-10-02 06:51:28,888 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 615 transitions. Word has length 186 [2019-10-02 06:51:28,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:51:28,888 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 615 transitions. [2019-10-02 06:51:28,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 06:51:28,889 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 615 transitions. [2019-10-02 06:51:28,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-10-02 06:51:28,892 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:51:28,892 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 06:51:28,892 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:51:28,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:51:28,893 INFO L82 PathProgramCache]: Analyzing trace with hash -697598900, now seen corresponding path program 1 times [2019-10-02 06:51:28,893 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:51:28,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:51:28,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:51:28,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 06:51:28,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:51:28,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:51:29,110 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-02 06:51:29,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 06:51:29,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 06:51:29,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 06:51:29,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 06:51:29,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 06:51:29,112 INFO L87 Difference]: Start difference. First operand 495 states and 615 transitions. Second operand 7 states. [2019-10-02 06:51:29,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:51:29,175 INFO L93 Difference]: Finished difference Result 950 states and 1187 transitions. [2019-10-02 06:51:29,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 06:51:29,176 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 188 [2019-10-02 06:51:29,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:51:29,179 INFO L225 Difference]: With dead ends: 950 [2019-10-02 06:51:29,180 INFO L226 Difference]: Without dead ends: 499 [2019-10-02 06:51:29,181 INFO L640 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-10-02 06:51:29,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2019-10-02 06:51:29,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 497. [2019-10-02 06:51:29,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2019-10-02 06:51:29,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 615 transitions. [2019-10-02 06:51:29,215 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 615 transitions. Word has length 188 [2019-10-02 06:51:29,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:51:29,215 INFO L475 AbstractCegarLoop]: Abstraction has 497 states and 615 transitions. [2019-10-02 06:51:29,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 06:51:29,216 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 615 transitions. [2019-10-02 06:51:29,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-10-02 06:51:29,219 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:51:29,219 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 06:51:29,220 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:51:29,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:51:29,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1461549067, now seen corresponding path program 1 times [2019-10-02 06:51:29,220 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:51:29,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:51:29,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:51:29,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 06:51:29,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:51:29,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:51:29,455 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-02 06:51:29,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 06:51:29,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 06:51:29,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 06:51:29,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 06:51:29,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 06:51:29,458 INFO L87 Difference]: Start difference. First operand 497 states and 615 transitions. Second operand 3 states. [2019-10-02 06:51:29,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:51:29,554 INFO L93 Difference]: Finished difference Result 948 states and 1179 transitions. [2019-10-02 06:51:29,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 06:51:29,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2019-10-02 06:51:29,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:51:29,559 INFO L225 Difference]: With dead ends: 948 [2019-10-02 06:51:29,559 INFO L226 Difference]: Without dead ends: 495 [2019-10-02 06:51:29,562 INFO L640 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-10-02 06:51:29,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2019-10-02 06:51:29,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 493. [2019-10-02 06:51:29,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2019-10-02 06:51:29,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 607 transitions. [2019-10-02 06:51:29,593 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 607 transitions. Word has length 196 [2019-10-02 06:51:29,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:51:29,595 INFO L475 AbstractCegarLoop]: Abstraction has 493 states and 607 transitions. [2019-10-02 06:51:29,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 06:51:29,595 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 607 transitions. [2019-10-02 06:51:29,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-10-02 06:51:29,598 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:51:29,599 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 06:51:29,599 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:51:29,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:51:29,599 INFO L82 PathProgramCache]: Analyzing trace with hash 384009675, now seen corresponding path program 1 times [2019-10-02 06:51:29,599 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:51:29,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:51:29,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:51:29,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 06:51:29,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:51:29,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:51:29,904 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-02 06:51:29,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 06:51:29,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 06:51:29,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 06:51:29,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 06:51:29,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-02 06:51:29,912 INFO L87 Difference]: Start difference. First operand 493 states and 607 transitions. Second operand 9 states. [2019-10-02 06:51:31,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:51:31,923 INFO L93 Difference]: Finished difference Result 1154 states and 1470 transitions. [2019-10-02 06:51:31,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 06:51:31,923 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 196 [2019-10-02 06:51:31,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:51:31,928 INFO L225 Difference]: With dead ends: 1154 [2019-10-02 06:51:31,928 INFO L226 Difference]: Without dead ends: 705 [2019-10-02 06:51:31,930 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2019-10-02 06:51:31,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2019-10-02 06:51:31,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 582. [2019-10-02 06:51:31,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-10-02 06:51:31,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 706 transitions. [2019-10-02 06:51:31,962 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 706 transitions. Word has length 196 [2019-10-02 06:51:31,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:51:31,963 INFO L475 AbstractCegarLoop]: Abstraction has 582 states and 706 transitions. [2019-10-02 06:51:31,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 06:51:31,963 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 706 transitions. [2019-10-02 06:51:31,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-10-02 06:51:31,967 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:51:31,967 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 06:51:31,968 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:51:31,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:51:31,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1697786230, now seen corresponding path program 1 times [2019-10-02 06:51:31,968 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:51:31,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:51:31,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:51:31,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 06:51:31,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:51:32,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:51:32,104 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-02 06:51:32,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 06:51:32,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 06:51:32,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 06:51:32,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 06:51:32,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 06:51:32,106 INFO L87 Difference]: Start difference. First operand 582 states and 706 transitions. Second operand 4 states. [2019-10-02 06:51:32,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:51:32,175 INFO L93 Difference]: Finished difference Result 922 states and 1129 transitions. [2019-10-02 06:51:32,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 06:51:32,175 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 198 [2019-10-02 06:51:32,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:51:32,179 INFO L225 Difference]: With dead ends: 922 [2019-10-02 06:51:32,180 INFO L226 Difference]: Without dead ends: 591 [2019-10-02 06:51:32,181 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 06:51:32,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-10-02 06:51:32,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 585. [2019-10-02 06:51:32,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2019-10-02 06:51:32,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 710 transitions. [2019-10-02 06:51:32,215 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 710 transitions. Word has length 198 [2019-10-02 06:51:32,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:51:32,216 INFO L475 AbstractCegarLoop]: Abstraction has 585 states and 710 transitions. [2019-10-02 06:51:32,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 06:51:32,216 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 710 transitions. [2019-10-02 06:51:32,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-10-02 06:51:32,221 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:51:32,221 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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, 1, 1] [2019-10-02 06:51:32,221 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:51:32,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:51:32,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1002773213, now seen corresponding path program 1 times [2019-10-02 06:51:32,222 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:51:32,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:51:32,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:51:32,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 06:51:32,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:51:32,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:51:32,416 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 06:51:32,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 06:51:32,417 INFO L224 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) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 06:51:32,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 06:51:32,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:51:32,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 1182 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 06:51:32,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 06:51:32,833 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 19 proven. 15 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-02 06:51:32,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 06:51:32,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-10-02 06:51:32,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 06:51:32,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 06:51:32,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-10-02 06:51:32,842 INFO L87 Difference]: Start difference. First operand 585 states and 710 transitions. Second operand 7 states. [2019-10-02 06:51:32,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:51:32,906 INFO L93 Difference]: Finished difference Result 1140 states and 1392 transitions. [2019-10-02 06:51:32,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 06:51:32,907 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 200 [2019-10-02 06:51:32,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:51:32,911 INFO L225 Difference]: With dead ends: 1140 [2019-10-02 06:51:32,911 INFO L226 Difference]: Without dead ends: 599 [2019-10-02 06:51:32,913 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-10-02 06:51:32,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-10-02 06:51:32,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 593. [2019-10-02 06:51:32,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2019-10-02 06:51:32,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 720 transitions. [2019-10-02 06:51:32,947 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 720 transitions. Word has length 200 [2019-10-02 06:51:32,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:51:32,947 INFO L475 AbstractCegarLoop]: Abstraction has 593 states and 720 transitions. [2019-10-02 06:51:32,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 06:51:32,947 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 720 transitions. [2019-10-02 06:51:32,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-10-02 06:51:32,951 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:51:32,952 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1] [2019-10-02 06:51:32,952 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:51:32,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:51:32,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1344588746, now seen corresponding path program 2 times [2019-10-02 06:51:32,953 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:51:32,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:51:32,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:51:32,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 06:51:32,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:51:33,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:51:33,168 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 7 proven. 28 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 06:51:33,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 06:51:33,169 INFO L224 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) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 06:51:33,273 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 06:51:33,396 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-10-02 06:51:33,396 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 06:51:33,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 680 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 06:51:33,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 06:51:33,492 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 06:51:33,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 06:51:33,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2019-10-02 06:51:33,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 06:51:33,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 06:51:33,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-02 06:51:33,501 INFO L87 Difference]: Start difference. First operand 593 states and 720 transitions. Second operand 10 states. [2019-10-02 06:51:33,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:51:33,771 INFO L93 Difference]: Finished difference Result 1172 states and 1439 transitions. [2019-10-02 06:51:33,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 06:51:33,772 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 204 [2019-10-02 06:51:33,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:51:33,776 INFO L225 Difference]: With dead ends: 1172 [2019-10-02 06:51:33,776 INFO L226 Difference]: Without dead ends: 614 [2019-10-02 06:51:33,778 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 202 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-10-02 06:51:33,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-10-02 06:51:33,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 604. [2019-10-02 06:51:33,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-10-02 06:51:33,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 733 transitions. [2019-10-02 06:51:33,808 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 733 transitions. Word has length 204 [2019-10-02 06:51:33,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:51:33,809 INFO L475 AbstractCegarLoop]: Abstraction has 604 states and 733 transitions. [2019-10-02 06:51:33,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 06:51:33,809 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 733 transitions. [2019-10-02 06:51:33,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-10-02 06:51:33,813 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:51:33,813 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 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, 1] [2019-10-02 06:51:33,813 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:51:33,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:51:33,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1612269266, now seen corresponding path program 1 times [2019-10-02 06:51:33,814 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:51:33,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:51:33,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:51:33,818 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 06:51:33,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:51:33,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:51:34,104 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-10-02 06:51:34,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 06:51:34,104 INFO L224 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) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 06:51:34,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 06:51:34,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:51:34,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 1234 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 06:51:34,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 06:51:34,512 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 19 proven. 45 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-02 06:51:34,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 06:51:34,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8] total 11 [2019-10-02 06:51:34,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 06:51:34,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 06:51:34,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-10-02 06:51:34,521 INFO L87 Difference]: Start difference. First operand 604 states and 733 transitions. Second operand 11 states. [2019-10-02 06:51:34,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:51:34,795 INFO L93 Difference]: Finished difference Result 1181 states and 1452 transitions. [2019-10-02 06:51:34,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 06:51:34,796 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 209 [2019-10-02 06:51:34,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:51:34,799 INFO L225 Difference]: With dead ends: 1181 [2019-10-02 06:51:34,799 INFO L226 Difference]: Without dead ends: 621 [2019-10-02 06:51:34,802 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-10-02 06:51:34,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2019-10-02 06:51:34,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 615. [2019-10-02 06:51:34,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 615 states. [2019-10-02 06:51:34,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 746 transitions. [2019-10-02 06:51:34,844 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 746 transitions. Word has length 209 [2019-10-02 06:51:34,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:51:34,845 INFO L475 AbstractCegarLoop]: Abstraction has 615 states and 746 transitions. [2019-10-02 06:51:34,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 06:51:34,845 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 746 transitions. [2019-10-02 06:51:34,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-10-02 06:51:34,849 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:51:34,849 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 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, 1, 1] [2019-10-02 06:51:34,850 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:51:34,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:51:34,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1613143434, now seen corresponding path program 1 times [2019-10-02 06:51:34,850 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:51:34,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:51:34,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:51:34,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 06:51:34,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:51:35,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:51:35,223 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 7 proven. 66 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 06:51:35,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 06:51:35,223 INFO L224 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-10-02 06:51:35,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 06:51:35,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:51:35,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 1256 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 06:51:35,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 06:51:35,674 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 19 proven. 66 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-02 06:51:35,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 06:51:35,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-10-02 06:51:35,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 06:51:35,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 06:51:35,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-10-02 06:51:35,684 INFO L87 Difference]: Start difference. First operand 615 states and 746 transitions. Second operand 10 states. [2019-10-02 06:51:35,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:51:35,810 INFO L93 Difference]: Finished difference Result 1200 states and 1464 transitions. [2019-10-02 06:51:35,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 06:51:35,811 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 214 [2019-10-02 06:51:35,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:51:35,825 INFO L225 Difference]: With dead ends: 1200 [2019-10-02 06:51:35,825 INFO L226 Difference]: Without dead ends: 629 [2019-10-02 06:51:35,831 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 214 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-10-02 06:51:35,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-10-02 06:51:35,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 623. [2019-10-02 06:51:35,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-10-02 06:51:35,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 756 transitions. [2019-10-02 06:51:35,878 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 756 transitions. Word has length 214 [2019-10-02 06:51:35,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:51:35,878 INFO L475 AbstractCegarLoop]: Abstraction has 623 states and 756 transitions. [2019-10-02 06:51:35,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 06:51:35,879 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 756 transitions. [2019-10-02 06:51:35,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-10-02 06:51:35,883 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:51:35,883 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 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, 1, 1] [2019-10-02 06:51:35,883 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:51:35,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:51:35,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1603999965, now seen corresponding path program 2 times [2019-10-02 06:51:35,884 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:51:35,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:51:35,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:51:35,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 06:51:35,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:51:36,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:51:36,165 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 7 proven. 91 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 06:51:36,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 06:51:36,165 INFO L224 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) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 06:51:36,271 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 06:51:36,530 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 06:51:36,531 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 06:51:36,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 1268 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-02 06:51:36,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 06:51:36,619 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 19 proven. 91 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-02 06:51:36,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 06:51:36,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-10-02 06:51:36,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 06:51:36,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 06:51:36,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-02 06:51:36,642 INFO L87 Difference]: Start difference. First operand 623 states and 756 transitions. Second operand 11 states. [2019-10-02 06:51:36,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:51:36,794 INFO L93 Difference]: Finished difference Result 1216 states and 1484 transitions. [2019-10-02 06:51:36,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 06:51:36,794 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 218 [2019-10-02 06:51:36,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:51:36,798 INFO L225 Difference]: With dead ends: 1216 [2019-10-02 06:51:36,799 INFO L226 Difference]: Without dead ends: 637 [2019-10-02 06:51:36,801 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-02 06:51:36,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2019-10-02 06:51:36,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 631. [2019-10-02 06:51:36,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2019-10-02 06:51:36,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 766 transitions. [2019-10-02 06:51:36,834 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 766 transitions. Word has length 218 [2019-10-02 06:51:36,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:51:36,835 INFO L475 AbstractCegarLoop]: Abstraction has 631 states and 766 transitions. [2019-10-02 06:51:36,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 06:51:36,835 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 766 transitions. [2019-10-02 06:51:36,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-10-02 06:51:36,844 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:51:36,845 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 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, 1, 1] [2019-10-02 06:51:36,845 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:51:36,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:51:36,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1631404996, now seen corresponding path program 3 times [2019-10-02 06:51:36,849 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:51:36,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:51:36,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:51:36,856 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 06:51:36,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:51:36,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:51:37,162 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 7 proven. 120 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 06:51:37,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 06:51:37,163 INFO L224 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-10-02 06:51:37,315 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 06:51:37,563 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-02 06:51:37,563 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 06:51:37,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 953 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 06:51:37,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 06:51:37,692 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-10-02 06:51:37,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 06:51:37,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 15 [2019-10-02 06:51:37,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 06:51:37,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 06:51:37,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2019-10-02 06:51:37,711 INFO L87 Difference]: Start difference. First operand 631 states and 766 transitions. Second operand 15 states. [2019-10-02 06:51:38,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:51:38,143 INFO L93 Difference]: Finished difference Result 1251 states and 1534 transitions. [2019-10-02 06:51:38,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 06:51:38,143 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 222 [2019-10-02 06:51:38,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:51:38,147 INFO L225 Difference]: With dead ends: 1251 [2019-10-02 06:51:38,147 INFO L226 Difference]: Without dead ends: 652 [2019-10-02 06:51:38,150 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 218 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2019-10-02 06:51:38,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2019-10-02 06:51:38,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 642. [2019-10-02 06:51:38,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-10-02 06:51:38,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 779 transitions. [2019-10-02 06:51:38,183 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 779 transitions. Word has length 222 [2019-10-02 06:51:38,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:51:38,183 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 779 transitions. [2019-10-02 06:51:38,183 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 06:51:38,184 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 779 transitions. [2019-10-02 06:51:38,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-10-02 06:51:38,187 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:51:38,188 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 06:51:38,188 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:51:38,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:51:38,189 INFO L82 PathProgramCache]: Analyzing trace with hash -437306092, now seen corresponding path program 4 times [2019-10-02 06:51:38,189 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:51:38,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:51:38,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:51:38,193 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 06:51:38,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:51:38,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:51:38,558 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 7 proven. 153 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 06:51:38,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 06:51:38,558 INFO L224 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-10-02 06:51:38,652 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 06:51:38,974 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 06:51:38,975 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 06:51:38,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 1320 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-02 06:51:38,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 06:51:39,040 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 19 proven. 153 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-02 06:51:39,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 06:51:39,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-10-02 06:51:39,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 06:51:39,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 06:51:39,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-10-02 06:51:39,050 INFO L87 Difference]: Start difference. First operand 642 states and 779 transitions. Second operand 13 states. [2019-10-02 06:51:39,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:51:39,198 INFO L93 Difference]: Finished difference Result 1254 states and 1530 transitions. [2019-10-02 06:51:39,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 06:51:39,199 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 227 [2019-10-02 06:51:39,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:51:39,204 INFO L225 Difference]: With dead ends: 1254 [2019-10-02 06:51:39,204 INFO L226 Difference]: Without dead ends: 656 [2019-10-02 06:51:39,207 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-10-02 06:51:39,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2019-10-02 06:51:39,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 650. [2019-10-02 06:51:39,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2019-10-02 06:51:39,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 789 transitions. [2019-10-02 06:51:39,242 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 789 transitions. Word has length 227 [2019-10-02 06:51:39,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:51:39,242 INFO L475 AbstractCegarLoop]: Abstraction has 650 states and 789 transitions. [2019-10-02 06:51:39,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 06:51:39,243 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 789 transitions. [2019-10-02 06:51:39,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-10-02 06:51:39,247 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:51:39,248 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 06:51:39,248 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:51:39,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:51:39,249 INFO L82 PathProgramCache]: Analyzing trace with hash 358704653, now seen corresponding path program 5 times [2019-10-02 06:51:39,249 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:51:39,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:51:39,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:51:39,254 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 06:51:39,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:51:39,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:51:39,770 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 7 proven. 190 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 06:51:39,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 06:51:39,771 INFO L224 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) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 06:51:39,904 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 06:51:53,059 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-10-02 06:51:53,059 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 06:51:53,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-02 06:51:53,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 06:51:53,127 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 19 proven. 190 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-02 06:51:53,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 06:51:53,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-10-02 06:51:53,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 06:51:53,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 06:51:53,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-02 06:51:53,141 INFO L87 Difference]: Start difference. First operand 650 states and 789 transitions. Second operand 14 states. [2019-10-02 06:51:53,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:51:53,255 INFO L93 Difference]: Finished difference Result 1270 states and 1550 transitions. [2019-10-02 06:51:53,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 06:51:53,256 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 231 [2019-10-02 06:51:53,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:51:53,260 INFO L225 Difference]: With dead ends: 1270 [2019-10-02 06:51:53,260 INFO L226 Difference]: Without dead ends: 664 [2019-10-02 06:51:53,262 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-02 06:51:53,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2019-10-02 06:51:53,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 658. [2019-10-02 06:51:53,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2019-10-02 06:51:53,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 799 transitions. [2019-10-02 06:51:53,296 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 799 transitions. Word has length 231 [2019-10-02 06:51:53,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:51:53,297 INFO L475 AbstractCegarLoop]: Abstraction has 658 states and 799 transitions. [2019-10-02 06:51:53,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 06:51:53,297 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 799 transitions. [2019-10-02 06:51:53,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-10-02 06:51:53,302 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:51:53,302 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 06:51:53,302 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:51:53,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:51:53,303 INFO L82 PathProgramCache]: Analyzing trace with hash 2100587142, now seen corresponding path program 6 times [2019-10-02 06:51:53,303 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:51:53,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:51:53,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:51:53,308 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 06:51:53,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:51:53,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:51:53,668 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-10-02 06:51:53,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 06:51:53,668 INFO L224 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) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 06:51:53,772 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 06:51:54,125 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2019-10-02 06:51:54,125 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 06:51:54,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 993 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-02 06:51:54,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 06:51:54,251 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-10-02 06:51:54,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 06:51:54,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2019-10-02 06:51:54,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 06:51:54,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 06:51:54,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-02 06:51:54,266 INFO L87 Difference]: Start difference. First operand 658 states and 799 transitions. Second operand 9 states. [2019-10-02 06:51:54,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:51:54,549 INFO L93 Difference]: Finished difference Result 1291 states and 1578 transitions. [2019-10-02 06:51:54,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 06:51:54,550 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 235 [2019-10-02 06:51:54,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:51:54,555 INFO L225 Difference]: With dead ends: 1291 [2019-10-02 06:51:54,555 INFO L226 Difference]: Without dead ends: 665 [2019-10-02 06:51:54,558 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 234 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-10-02 06:51:54,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2019-10-02 06:51:54,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 661. [2019-10-02 06:51:54,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 661 states. [2019-10-02 06:51:54,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 802 transitions. [2019-10-02 06:51:54,595 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 802 transitions. Word has length 235 [2019-10-02 06:51:54,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:51:54,597 INFO L475 AbstractCegarLoop]: Abstraction has 661 states and 802 transitions. [2019-10-02 06:51:54,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 06:51:54,597 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 802 transitions. [2019-10-02 06:51:54,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-10-02 06:51:54,600 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:51:54,601 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 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, 1, 1, 1] [2019-10-02 06:51:54,601 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:51:54,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:51:54,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1602576665, now seen corresponding path program 7 times [2019-10-02 06:51:54,602 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:51:54,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:51:54,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:51:54,606 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 06:51:54,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:51:54,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:51:54,920 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 7 proven. 231 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-02 06:51:54,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 06:51:54,920 INFO L224 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-10-02 06:51:55,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 06:51:55,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:51:55,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 1372 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-02 06:51:55,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 06:51:55,380 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 19 proven. 231 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (13)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 06:51:55,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 06:51:55,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-10-02 06:51:55,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 06:51:55,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 06:51:55,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-10-02 06:51:55,392 INFO L87 Difference]: Start difference. First operand 661 states and 802 transitions. Second operand 15 states. [2019-10-02 06:51:55,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:51:55,571 INFO L93 Difference]: Finished difference Result 1292 states and 1576 transitions. [2019-10-02 06:51:55,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 06:51:55,572 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 236 [2019-10-02 06:51:55,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:51:55,577 INFO L225 Difference]: With dead ends: 1292 [2019-10-02 06:51:55,578 INFO L226 Difference]: Without dead ends: 675 [2019-10-02 06:51:55,581 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 236 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-10-02 06:51:55,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2019-10-02 06:51:55,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 669. [2019-10-02 06:51:55,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 669 states. [2019-10-02 06:51:55,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 812 transitions. [2019-10-02 06:51:55,630 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 812 transitions. Word has length 236 [2019-10-02 06:51:55,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:51:55,631 INFO L475 AbstractCegarLoop]: Abstraction has 669 states and 812 transitions. [2019-10-02 06:51:55,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 06:51:55,632 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 812 transitions. [2019-10-02 06:51:55,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-10-02 06:51:55,635 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:51:55,635 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 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, 1, 1, 1] [2019-10-02 06:51:55,635 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:51:55,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:51:55,636 INFO L82 PathProgramCache]: Analyzing trace with hash -2056306624, now seen corresponding path program 8 times [2019-10-02 06:51:55,636 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:51:55,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:51:55,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:51:55,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 06:51:55,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:51:56,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:51:56,381 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 7 proven. 276 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-02 06:51:56,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 06:51:56,382 INFO L224 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-10-02 06:51:56,489 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 06:51:56,806 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 06:51:56,806 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 06:51:56,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 1384 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-02 06:51:56,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 06:51:56,882 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 19 proven. 276 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 06:51:56,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 06:51:56,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-10-02 06:51:56,896 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 06:51:56,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 06:51:56,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-10-02 06:51:56,897 INFO L87 Difference]: Start difference. First operand 669 states and 812 transitions. Second operand 16 states. [2019-10-02 06:51:57,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:51:57,059 INFO L93 Difference]: Finished difference Result 1308 states and 1596 transitions. [2019-10-02 06:51:57,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 06:51:57,060 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 240 [2019-10-02 06:51:57,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:51:57,065 INFO L225 Difference]: With dead ends: 1308 [2019-10-02 06:51:57,065 INFO L226 Difference]: Without dead ends: 683 [2019-10-02 06:51:57,068 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 240 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-10-02 06:51:57,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2019-10-02 06:51:57,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 677. [2019-10-02 06:51:57,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2019-10-02 06:51:57,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 822 transitions. [2019-10-02 06:51:57,115 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 822 transitions. Word has length 240 [2019-10-02 06:51:57,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:51:57,115 INFO L475 AbstractCegarLoop]: Abstraction has 677 states and 822 transitions. [2019-10-02 06:51:57,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-02 06:51:57,116 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 822 transitions. [2019-10-02 06:51:57,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-10-02 06:51:57,119 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:51:57,119 INFO L411 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 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, 1, 1, 1] [2019-10-02 06:51:57,119 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:51:57,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:51:57,120 INFO L82 PathProgramCache]: Analyzing trace with hash -680053785, now seen corresponding path program 9 times [2019-10-02 06:51:57,120 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:51:57,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:51:57,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:51:57,134 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 06:51:57,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:51:57,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:51:57,518 INFO L134 CoverageAnalysis]: Checked inductivity of 371 backedges. 7 proven. 325 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-02 06:51:57,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 06:51:57,518 INFO L224 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) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 06:51:57,625 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 06:51:57,818 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-02 06:51:57,818 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 06:51:57,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 981 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 06:51:57,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 06:51:57,942 INFO L134 CoverageAnalysis]: Checked inductivity of 371 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2019-10-02 06:51:57,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 06:51:57,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 6] total 20 [2019-10-02 06:51:57,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-02 06:51:57,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-02 06:51:57,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2019-10-02 06:51:57,959 INFO L87 Difference]: Start difference. First operand 677 states and 822 transitions. Second operand 20 states. [2019-10-02 06:51:58,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:51:58,295 INFO L93 Difference]: Finished difference Result 1337 states and 1637 transitions. [2019-10-02 06:51:58,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 06:51:58,295 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 244 [2019-10-02 06:51:58,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:51:58,301 INFO L225 Difference]: With dead ends: 1337 [2019-10-02 06:51:58,302 INFO L226 Difference]: Without dead ends: 698 [2019-10-02 06:51:58,305 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 240 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2019-10-02 06:51:58,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2019-10-02 06:51:58,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 688. [2019-10-02 06:51:58,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 688 states. [2019-10-02 06:51:58,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 835 transitions. [2019-10-02 06:51:58,351 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 835 transitions. Word has length 244 [2019-10-02 06:51:58,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:51:58,352 INFO L475 AbstractCegarLoop]: Abstraction has 688 states and 835 transitions. [2019-10-02 06:51:58,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-02 06:51:58,352 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 835 transitions. [2019-10-02 06:51:58,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-10-02 06:51:58,362 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:51:58,362 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 06:51:58,362 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:51:58,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:51:58,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1632152877, now seen corresponding path program 10 times [2019-10-02 06:51:58,363 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:51:58,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:51:58,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:51:58,371 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 06:51:58,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:51:58,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:51:58,751 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2019-10-02 06:51:58,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 06:51:58,751 INFO L224 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-10-02 06:51:58,849 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 06:51:59,010 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 06:51:59,010 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 06:51:59,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 958 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 06:51:59,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 06:51:59,112 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2019-10-02 06:51:59,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 06:51:59,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2019-10-02 06:51:59,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 06:51:59,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 06:51:59,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-10-02 06:51:59,122 INFO L87 Difference]: Start difference. First operand 688 states and 835 transitions. Second operand 11 states. [2019-10-02 06:51:59,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:51:59,351 INFO L93 Difference]: Finished difference Result 1341 states and 1640 transitions. [2019-10-02 06:51:59,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 06:51:59,352 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 249 [2019-10-02 06:51:59,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:51:59,356 INFO L225 Difference]: With dead ends: 1341 [2019-10-02 06:51:59,357 INFO L226 Difference]: Without dead ends: 691 [2019-10-02 06:51:59,359 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-10-02 06:51:59,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2019-10-02 06:51:59,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 691. [2019-10-02 06:51:59,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2019-10-02 06:51:59,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 838 transitions. [2019-10-02 06:51:59,400 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 838 transitions. Word has length 249 [2019-10-02 06:51:59,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:51:59,400 INFO L475 AbstractCegarLoop]: Abstraction has 691 states and 838 transitions. [2019-10-02 06:51:59,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 06:51:59,401 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 838 transitions. [2019-10-02 06:51:59,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-10-02 06:51:59,403 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:51:59,406 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 06:51:59,406 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:51:59,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:51:59,407 INFO L82 PathProgramCache]: Analyzing trace with hash -915808592, now seen corresponding path program 11 times [2019-10-02 06:51:59,407 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:51:59,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:51:59,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:51:59,410 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 06:51:59,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:51:59,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:51:59,734 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2019-10-02 06:51:59,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 06:51:59,734 INFO L224 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-10-02 06:51:59,839 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 06:52:16,645 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2019-10-02 06:52:16,645 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 06:52:16,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-02 06:52:16,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 06:52:17,074 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 19 proven. 378 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 06:52:17,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 06:52:17,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 17] total 24 [2019-10-02 06:52:17,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-02 06:52:17,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-02 06:52:17,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=392, Unknown=0, NotChecked=0, Total=552 [2019-10-02 06:52:17,091 INFO L87 Difference]: Start difference. First operand 691 states and 838 transitions. Second operand 24 states. [2019-10-02 06:52:17,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:52:17,548 INFO L93 Difference]: Finished difference Result 1361 states and 1668 transitions. [2019-10-02 06:52:17,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-02 06:52:17,549 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 250 [2019-10-02 06:52:17,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:52:17,553 INFO L225 Difference]: With dead ends: 1361 [2019-10-02 06:52:17,553 INFO L226 Difference]: Without dead ends: 708 [2019-10-02 06:52:17,556 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=168, Invalid=482, Unknown=0, NotChecked=0, Total=650 [2019-10-02 06:52:17,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2019-10-02 06:52:17,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 702. [2019-10-02 06:52:17,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 702 states. [2019-10-02 06:52:17,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 851 transitions. [2019-10-02 06:52:17,598 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 851 transitions. Word has length 250 [2019-10-02 06:52:17,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:52:17,599 INFO L475 AbstractCegarLoop]: Abstraction has 702 states and 851 transitions. [2019-10-02 06:52:17,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-02 06:52:17,599 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 851 transitions. [2019-10-02 06:52:17,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-10-02 06:52:17,601 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:52:17,601 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 06:52:17,602 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:52:17,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:52:17,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1921131412, now seen corresponding path program 12 times [2019-10-02 06:52:17,602 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:52:17,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:52:17,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:52:17,606 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 06:52:17,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:52:18,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:52:18,334 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 7 proven. 435 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-10-02 06:52:18,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 06:52:18,335 INFO L224 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) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 06:52:18,427 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 06:52:18,709 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2019-10-02 06:52:18,709 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 06:52:18,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 1003 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 06:52:18,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 06:52:18,871 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2019-10-02 06:52:18,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 06:52:18,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 7] total 23 [2019-10-02 06:52:18,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-02 06:52:18,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-02 06:52:18,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=340, Unknown=0, NotChecked=0, Total=506 [2019-10-02 06:52:18,882 INFO L87 Difference]: Start difference. First operand 702 states and 851 transitions. Second operand 23 states. [2019-10-02 06:52:19,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:52:19,121 INFO L93 Difference]: Finished difference Result 1387 states and 1695 transitions. [2019-10-02 06:52:19,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-02 06:52:19,121 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 255 [2019-10-02 06:52:19,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:52:19,128 INFO L225 Difference]: With dead ends: 1387 [2019-10-02 06:52:19,128 INFO L226 Difference]: Without dead ends: 723 [2019-10-02 06:52:19,133 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 250 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2019-10-02 06:52:19,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2019-10-02 06:52:19,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 713. [2019-10-02 06:52:19,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2019-10-02 06:52:19,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 864 transitions. [2019-10-02 06:52:19,170 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 864 transitions. Word has length 255 [2019-10-02 06:52:19,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:52:19,170 INFO L475 AbstractCegarLoop]: Abstraction has 713 states and 864 transitions. [2019-10-02 06:52:19,170 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-02 06:52:19,171 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 864 transitions. [2019-10-02 06:52:19,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-10-02 06:52:19,173 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:52:19,173 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 5, 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, 1, 1] [2019-10-02 06:52:19,174 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:52:19,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:52:19,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1227244508, now seen corresponding path program 13 times [2019-10-02 06:52:19,174 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:52:19,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:52:19,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:52:19,179 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 06:52:19,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:52:19,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:52:19,616 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 7 proven. 496 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-10-02 06:52:19,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 06:52:19,617 INFO L224 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-10-02 06:52:19,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 06:52:19,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:52:19,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 1508 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-02 06:52:19,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 06:52:20,078 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 19 proven. 496 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 06:52:20,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 06:52:20,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-10-02 06:52:20,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-02 06:52:20,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-02 06:52:20,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-02 06:52:20,086 INFO L87 Difference]: Start difference. First operand 713 states and 864 transitions. Second operand 20 states. [2019-10-02 06:52:20,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:52:20,246 INFO L93 Difference]: Finished difference Result 1396 states and 1700 transitions. [2019-10-02 06:52:20,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-02 06:52:20,247 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 260 [2019-10-02 06:52:20,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:52:20,251 INFO L225 Difference]: With dead ends: 1396 [2019-10-02 06:52:20,251 INFO L226 Difference]: Without dead ends: 727 [2019-10-02 06:52:20,254 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-02 06:52:20,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2019-10-02 06:52:20,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 721. [2019-10-02 06:52:20,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2019-10-02 06:52:20,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 874 transitions. [2019-10-02 06:52:20,288 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 874 transitions. Word has length 260 [2019-10-02 06:52:20,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:52:20,289 INFO L475 AbstractCegarLoop]: Abstraction has 721 states and 874 transitions. [2019-10-02 06:52:20,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-02 06:52:20,289 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 874 transitions. [2019-10-02 06:52:20,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-10-02 06:52:20,293 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:52:20,294 INFO L411 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 5, 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, 1, 1] [2019-10-02 06:52:20,294 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:52:20,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:52:20,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1166090749, now seen corresponding path program 14 times [2019-10-02 06:52:20,295 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:52:20,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:52:20,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:52:20,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 06:52:20,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:52:20,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:52:20,656 INFO L134 CoverageAnalysis]: Checked inductivity of 621 backedges. 11 proven. 17 refuted. 0 times theorem prover too weak. 593 trivial. 0 not checked. [2019-10-02 06:52:20,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 06:52:20,658 INFO L224 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-10-02 06:52:20,767 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 06:52:21,009 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 06:52:21,009 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 06:52:21,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 1520 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-02 06:52:21,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 06:52:21,399 INFO L134 CoverageAnalysis]: Checked inductivity of 621 backedges. 19 proven. 561 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 06:52:21,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 06:52:21,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 20] total 29 [2019-10-02 06:52:21,406 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-02 06:52:21,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-02 06:52:21,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=588, Unknown=0, NotChecked=0, Total=812 [2019-10-02 06:52:21,407 INFO L87 Difference]: Start difference. First operand 721 states and 874 transitions. Second operand 29 states. [2019-10-02 06:52:21,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:52:21,933 INFO L93 Difference]: Finished difference Result 1424 states and 1743 transitions. [2019-10-02 06:52:21,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-02 06:52:21,934 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 264 [2019-10-02 06:52:21,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:52:21,938 INFO L225 Difference]: With dead ends: 1424 [2019-10-02 06:52:21,938 INFO L226 Difference]: Without dead ends: 738 [2019-10-02 06:52:21,940 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=238, Invalid=754, Unknown=0, NotChecked=0, Total=992 [2019-10-02 06:52:21,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2019-10-02 06:52:21,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 732. [2019-10-02 06:52:21,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 732 states. [2019-10-02 06:52:21,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 887 transitions. [2019-10-02 06:52:21,983 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 887 transitions. Word has length 264 [2019-10-02 06:52:21,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:52:21,983 INFO L475 AbstractCegarLoop]: Abstraction has 732 states and 887 transitions. [2019-10-02 06:52:21,983 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-02 06:52:21,983 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 887 transitions. [2019-10-02 06:52:21,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-10-02 06:52:21,986 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:52:21,986 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 6, 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, 1, 1] [2019-10-02 06:52:21,987 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:52:21,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:52:21,987 INFO L82 PathProgramCache]: Analyzing trace with hash -547779595, now seen corresponding path program 15 times [2019-10-02 06:52:21,987 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:52:21,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:52:21,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:52:21,991 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 06:52:21,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:52:22,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:52:22,356 INFO L134 CoverageAnalysis]: Checked inductivity of 696 backedges. 11 proven. 23 refuted. 0 times theorem prover too weak. 662 trivial. 0 not checked. [2019-10-02 06:52:22,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 06:52:22,357 INFO L224 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) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 06:52:22,466 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 06:52:24,421 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-02 06:52:24,421 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 06:52:24,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 1089 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-02 06:52:24,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 06:52:24,635 INFO L134 CoverageAnalysis]: Checked inductivity of 696 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 683 trivial. 0 not checked. [2019-10-02 06:52:24,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 06:52:24,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2019-10-02 06:52:24,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 06:52:24,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 06:52:24,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2019-10-02 06:52:24,646 INFO L87 Difference]: Start difference. First operand 732 states and 887 transitions. Second operand 18 states. [2019-10-02 06:52:24,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:52:24,962 INFO L93 Difference]: Finished difference Result 1445 states and 1764 transitions. [2019-10-02 06:52:24,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-02 06:52:24,963 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 269 [2019-10-02 06:52:24,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:52:24,967 INFO L225 Difference]: With dead ends: 1445 [2019-10-02 06:52:24,967 INFO L226 Difference]: Without dead ends: 742 [2019-10-02 06:52:24,970 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 263 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2019-10-02 06:52:24,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2019-10-02 06:52:25,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 738. [2019-10-02 06:52:25,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2019-10-02 06:52:25,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 893 transitions. [2019-10-02 06:52:25,004 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 893 transitions. Word has length 269 [2019-10-02 06:52:25,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:52:25,005 INFO L475 AbstractCegarLoop]: Abstraction has 738 states and 893 transitions. [2019-10-02 06:52:25,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 06:52:25,005 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 893 transitions. [2019-10-02 06:52:25,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2019-10-02 06:52:25,007 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:52:25,008 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 7, 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, 1, 1] [2019-10-02 06:52:25,008 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:52:25,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:52:25,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1392142249, now seen corresponding path program 16 times [2019-10-02 06:52:25,009 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:52:25,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:52:25,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:52:25,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 06:52:25,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:52:25,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:52:25,495 INFO L134 CoverageAnalysis]: Checked inductivity of 707 backedges. 14 proven. 31 refuted. 0 times theorem prover too weak. 662 trivial. 0 not checked. [2019-10-02 06:52:25,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 06:52:25,496 INFO L224 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-10-02 06:52:25,595 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 06:52:25,773 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 06:52:25,773 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 06:52:25,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 1114 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-02 06:52:25,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 06:52:25,908 INFO L134 CoverageAnalysis]: Checked inductivity of 707 backedges. 16 proven. 28 refuted. 0 times theorem prover too weak. 663 trivial. 0 not checked. [2019-10-02 06:52:25,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 06:52:25,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 18 [2019-10-02 06:52:25,915 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 06:52:25,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 06:52:25,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2019-10-02 06:52:25,916 INFO L87 Difference]: Start difference. First operand 738 states and 893 transitions. Second operand 18 states. [2019-10-02 06:52:26,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:52:26,233 INFO L93 Difference]: Finished difference Result 1444 states and 1759 transitions. [2019-10-02 06:52:26,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 06:52:26,233 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 271 [2019-10-02 06:52:26,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:52:26,238 INFO L225 Difference]: With dead ends: 1444 [2019-10-02 06:52:26,238 INFO L226 Difference]: Without dead ends: 741 [2019-10-02 06:52:26,240 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2019-10-02 06:52:26,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2019-10-02 06:52:26,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 741. [2019-10-02 06:52:26,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2019-10-02 06:52:26,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 896 transitions. [2019-10-02 06:52:26,275 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 896 transitions. Word has length 271 [2019-10-02 06:52:26,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:52:26,275 INFO L475 AbstractCegarLoop]: Abstraction has 741 states and 896 transitions. [2019-10-02 06:52:26,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 06:52:26,276 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 896 transitions. [2019-10-02 06:52:26,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-10-02 06:52:26,278 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:52:26,279 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 8, 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, 1, 1] [2019-10-02 06:52:26,279 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:52:26,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:52:26,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1292489004, now seen corresponding path program 17 times [2019-10-02 06:52:26,280 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:52:26,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:52:26,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:52:26,283 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 06:52:26,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:52:26,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:52:26,981 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 7 proven. 630 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-10-02 06:52:26,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 06:52:26,981 INFO L224 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-10-02 06:52:27,072 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 06:53:05,781 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2019-10-02 06:53:05,781 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 06:53:05,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-02 06:53:05,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 06:53:05,850 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 19 proven. 630 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-10-02 06:53:05,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 06:53:05,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-10-02 06:53:05,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-02 06:53:05,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-02 06:53:05,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-10-02 06:53:05,875 INFO L87 Difference]: Start difference. First operand 741 states and 896 transitions. Second operand 22 states. [2019-10-02 06:53:06,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:53:06,046 INFO L93 Difference]: Finished difference Result 1452 states and 1764 transitions. [2019-10-02 06:53:06,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-02 06:53:06,047 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 272 [2019-10-02 06:53:06,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:53:06,051 INFO L225 Difference]: With dead ends: 1452 [2019-10-02 06:53:06,052 INFO L226 Difference]: Without dead ends: 755 [2019-10-02 06:53:06,054 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 272 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-10-02 06:53:06,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2019-10-02 06:53:06,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 749. [2019-10-02 06:53:06,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 749 states. [2019-10-02 06:53:06,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 906 transitions. [2019-10-02 06:53:06,091 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 906 transitions. Word has length 272 [2019-10-02 06:53:06,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:53:06,092 INFO L475 AbstractCegarLoop]: Abstraction has 749 states and 906 transitions. [2019-10-02 06:53:06,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-02 06:53:06,092 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 906 transitions. [2019-10-02 06:53:06,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-10-02 06:53:06,095 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:53:06,095 INFO L411 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 8, 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, 1, 1] [2019-10-02 06:53:06,095 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:53:06,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:53:06,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1572771629, now seen corresponding path program 18 times [2019-10-02 06:53:06,096 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:53:06,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:53:06,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:53:06,100 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 06:53:06,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:53:06,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:53:06,608 INFO L134 CoverageAnalysis]: Checked inductivity of 788 backedges. 7 proven. 703 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-10-02 06:53:06,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 06:53:06,609 INFO L224 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-10-02 06:53:06,705 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 06:53:09,854 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-10-02 06:53:09,855 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 06:53:09,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 1123 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-02 06:53:09,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 06:53:10,032 INFO L134 CoverageAnalysis]: Checked inductivity of 788 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 771 trivial. 0 not checked. [2019-10-02 06:53:10,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 06:53:10,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 9] total 29 [2019-10-02 06:53:10,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-02 06:53:10,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-02 06:53:10,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=557, Unknown=0, NotChecked=0, Total=812 [2019-10-02 06:53:10,044 INFO L87 Difference]: Start difference. First operand 749 states and 906 transitions. Second operand 29 states. [2019-10-02 06:53:10,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:53:10,360 INFO L93 Difference]: Finished difference Result 1481 states and 1805 transitions. [2019-10-02 06:53:10,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-02 06:53:10,360 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 276 [2019-10-02 06:53:10,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:53:10,364 INFO L225 Difference]: With dead ends: 1481 [2019-10-02 06:53:10,365 INFO L226 Difference]: Without dead ends: 770 [2019-10-02 06:53:10,367 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 269 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=259, Invalid=611, Unknown=0, NotChecked=0, Total=870 [2019-10-02 06:53:10,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2019-10-02 06:53:10,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 760. [2019-10-02 06:53:10,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 760 states. [2019-10-02 06:53:10,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 919 transitions. [2019-10-02 06:53:10,405 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 919 transitions. Word has length 276 [2019-10-02 06:53:10,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:53:10,409 INFO L475 AbstractCegarLoop]: Abstraction has 760 states and 919 transitions. [2019-10-02 06:53:10,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-02 06:53:10,409 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 919 transitions. [2019-10-02 06:53:10,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2019-10-02 06:53:10,412 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:53:10,413 INFO L411 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 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-10-02 06:53:10,413 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:53:10,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:53:10,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1440049305, now seen corresponding path program 19 times [2019-10-02 06:53:10,413 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:53:10,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:53:10,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:53:10,417 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 06:53:10,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:53:10,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:53:11,038 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 18 proven. 40 refuted. 0 times theorem prover too weak. 812 trivial. 0 not checked. [2019-10-02 06:53:11,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 06:53:11,039 INFO L224 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) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 06:53:11,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 06:53:11,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:53:11,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 1660 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-02 06:53:11,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 06:53:11,889 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 19 proven. 780 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-10-02 06:53:11,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 06:53:11,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 23] total 37 [2019-10-02 06:53:11,896 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-10-02 06:53:11,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-10-02 06:53:11,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=1009, Unknown=0, NotChecked=0, Total=1332 [2019-10-02 06:53:11,897 INFO L87 Difference]: Start difference. First operand 760 states and 919 transitions. Second operand 37 states. [2019-10-02 06:53:12,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:53:12,469 INFO L93 Difference]: Finished difference Result 1502 states and 1833 transitions. [2019-10-02 06:53:12,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-10-02 06:53:12,470 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 281 [2019-10-02 06:53:12,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:53:12,474 INFO L225 Difference]: With dead ends: 1502 [2019-10-02 06:53:12,474 INFO L226 Difference]: Without dead ends: 777 [2019-10-02 06:53:12,477 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=337, Invalid=1223, Unknown=0, NotChecked=0, Total=1560 [2019-10-02 06:53:12,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2019-10-02 06:53:12,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 771. [2019-10-02 06:53:12,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2019-10-02 06:53:12,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 932 transitions. [2019-10-02 06:53:12,530 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 932 transitions. Word has length 281 [2019-10-02 06:53:12,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:53:12,531 INFO L475 AbstractCegarLoop]: Abstraction has 771 states and 932 transitions. [2019-10-02 06:53:12,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-10-02 06:53:12,531 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 932 transitions. [2019-10-02 06:53:12,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-10-02 06:53:12,534 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:53:12,534 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 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-10-02 06:53:12,535 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:53:12,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:53:12,535 INFO L82 PathProgramCache]: Analyzing trace with hash -230476737, now seen corresponding path program 20 times [2019-10-02 06:53:12,536 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:53:12,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:53:12,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:53:12,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 06:53:12,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:53:12,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:53:13,258 INFO L134 CoverageAnalysis]: Checked inductivity of 960 backedges. 7 proven. 861 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-10-02 06:53:13,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 06:53:13,259 INFO L224 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-10-02 06:53:13,363 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 06:53:13,673 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 06:53:13,674 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 06:53:13,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 1700 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-02 06:53:13,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 06:53:13,767 INFO L134 CoverageAnalysis]: Checked inductivity of 960 backedges. 19 proven. 861 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-10-02 06:53:13,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 06:53:13,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-10-02 06:53:13,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-02 06:53:13,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-02 06:53:13,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-10-02 06:53:13,777 INFO L87 Difference]: Start difference. First operand 771 states and 932 transitions. Second operand 25 states. [2019-10-02 06:53:14,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:53:14,011 INFO L93 Difference]: Finished difference Result 1512 states and 1836 transitions. [2019-10-02 06:53:14,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-02 06:53:14,012 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 286 [2019-10-02 06:53:14,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:53:14,017 INFO L225 Difference]: With dead ends: 1512 [2019-10-02 06:53:14,017 INFO L226 Difference]: Without dead ends: 785 [2019-10-02 06:53:14,019 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-10-02 06:53:14,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2019-10-02 06:53:14,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 779. [2019-10-02 06:53:14,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2019-10-02 06:53:14,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 942 transitions. [2019-10-02 06:53:14,055 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 942 transitions. Word has length 286 [2019-10-02 06:53:14,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:53:14,055 INFO L475 AbstractCegarLoop]: Abstraction has 779 states and 942 transitions. [2019-10-02 06:53:14,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-02 06:53:14,056 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 942 transitions. [2019-10-02 06:53:14,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-10-02 06:53:14,059 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:53:14,059 INFO L411 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 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-10-02 06:53:14,059 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:53:14,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:53:14,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1695079334, now seen corresponding path program 21 times [2019-10-02 06:53:14,060 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:53:14,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:53:14,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:53:14,063 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 06:53:14,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:53:14,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:53:14,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1045 backedges. 7 proven. 946 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-10-02 06:53:14,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 06:53:14,707 INFO L224 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-10-02 06:53:14,813 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 06:53:50,225 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-02 06:53:50,225 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 06:53:50,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 1472 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-02 06:53:50,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 06:53:50,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1045 backedges. 22 proven. 45 refuted. 0 times theorem prover too weak. 978 trivial. 0 not checked. [2019-10-02 06:53:50,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 06:53:50,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 17] total 40 [2019-10-02 06:53:50,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-10-02 06:53:50,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-10-02 06:53:50,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=385, Invalid=1175, Unknown=0, NotChecked=0, Total=1560 [2019-10-02 06:53:50,871 INFO L87 Difference]: Start difference. First operand 779 states and 942 transitions. Second operand 40 states. [2019-10-02 06:53:51,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:53:51,748 INFO L93 Difference]: Finished difference Result 1543 states and 1882 transitions. [2019-10-02 06:53:51,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-10-02 06:53:51,748 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 290 [2019-10-02 06:53:51,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:53:51,755 INFO L225 Difference]: With dead ends: 1543 [2019-10-02 06:53:51,755 INFO L226 Difference]: Without dead ends: 796 [2019-10-02 06:53:51,760 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=413, Invalid=1479, Unknown=0, NotChecked=0, Total=1892 [2019-10-02 06:53:51,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2019-10-02 06:53:51,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 790. [2019-10-02 06:53:51,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-10-02 06:53:51,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 955 transitions. [2019-10-02 06:53:51,796 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 955 transitions. Word has length 290 [2019-10-02 06:53:51,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:53:51,797 INFO L475 AbstractCegarLoop]: Abstraction has 790 states and 955 transitions. [2019-10-02 06:53:51,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-10-02 06:53:51,797 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 955 transitions. [2019-10-02 06:53:51,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-10-02 06:53:51,800 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:53:51,800 INFO L411 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 10, 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-10-02 06:53:51,800 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:53:51,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:53:51,801 INFO L82 PathProgramCache]: Analyzing trace with hash 964945394, now seen corresponding path program 22 times [2019-10-02 06:53:51,801 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:53:51,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:53:51,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:53:51,804 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 06:53:51,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:53:51,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:53:52,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1144 backedges. 18 proven. 59 refuted. 0 times theorem prover too weak. 1067 trivial. 0 not checked. [2019-10-02 06:53:52,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 06:53:52,319 INFO L224 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-10-02 06:53:52,459 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 06:53:52,743 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 06:53:52,743 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 06:53:52,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 1238 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-02 06:53:52,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 06:53:52,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1144 backedges. 21 proven. 55 refuted. 0 times theorem prover too weak. 1068 trivial. 0 not checked. [2019-10-02 06:53:52,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 06:53:52,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 23 [2019-10-02 06:53:52,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-02 06:53:52,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-02 06:53:52,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2019-10-02 06:53:52,889 INFO L87 Difference]: Start difference. First operand 790 states and 955 transitions. Second operand 23 states. [2019-10-02 06:53:53,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:53:53,270 INFO L93 Difference]: Finished difference Result 1551 states and 1886 transitions. [2019-10-02 06:53:53,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 06:53:53,271 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 295 [2019-10-02 06:53:53,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:53:53,275 INFO L225 Difference]: With dead ends: 1551 [2019-10-02 06:53:53,275 INFO L226 Difference]: Without dead ends: 793 [2019-10-02 06:53:53,278 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=542, Unknown=0, NotChecked=0, Total=702 [2019-10-02 06:53:53,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2019-10-02 06:53:53,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 793. [2019-10-02 06:53:53,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2019-10-02 06:53:53,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 958 transitions. [2019-10-02 06:53:53,313 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 958 transitions. Word has length 295 [2019-10-02 06:53:53,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:53:53,314 INFO L475 AbstractCegarLoop]: Abstraction has 793 states and 958 transitions. [2019-10-02 06:53:53,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-02 06:53:53,314 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 958 transitions. [2019-10-02 06:53:53,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-10-02 06:53:53,317 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:53:53,317 INFO L411 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 11, 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-10-02 06:53:53,317 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:53:53,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:53:53,318 INFO L82 PathProgramCache]: Analyzing trace with hash -889437139, now seen corresponding path program 23 times [2019-10-02 06:53:53,318 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:53:53,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:53:53,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:53:53,321 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 06:53:53,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:53:53,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:53:54,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1155 backedges. 7 proven. 1035 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-10-02 06:53:54,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 06:53:54,137 INFO L224 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-10-02 06:53:54,249 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 06:56:01,215 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2019-10-02 06:56:01,215 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 06:56:01,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 683 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-02 06:56:01,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 06:56:01,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1155 backedges. 19 proven. 1035 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-10-02 06:56:01,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 06:56:01,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-10-02 06:56:01,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-02 06:56:01,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-02 06:56:01,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-10-02 06:56:01,478 INFO L87 Difference]: Start difference. First operand 793 states and 958 transitions. Second operand 27 states. [2019-10-02 06:56:01,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:56:01,677 INFO L93 Difference]: Finished difference Result 1556 states and 1888 transitions. [2019-10-02 06:56:01,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-02 06:56:01,677 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 296 [2019-10-02 06:56:01,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:56:01,682 INFO L225 Difference]: With dead ends: 1556 [2019-10-02 06:56:01,682 INFO L226 Difference]: Without dead ends: 807 [2019-10-02 06:56:01,684 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-10-02 06:56:01,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2019-10-02 06:56:01,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 801. [2019-10-02 06:56:01,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2019-10-02 06:56:01,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 968 transitions. [2019-10-02 06:56:01,719 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 968 transitions. Word has length 296 [2019-10-02 06:56:01,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:56:01,719 INFO L475 AbstractCegarLoop]: Abstraction has 801 states and 968 transitions. [2019-10-02 06:56:01,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-02 06:56:01,720 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 968 transitions. [2019-10-02 06:56:01,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-10-02 06:56:01,722 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:56:01,723 INFO L411 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 11, 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-10-02 06:56:01,723 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:56:01,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:56:01,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1679890132, now seen corresponding path program 24 times [2019-10-02 06:56:01,723 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:56:01,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:56:01,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:56:01,727 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 06:56:01,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:56:01,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:56:02,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 7 proven. 1128 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-10-02 06:56:02,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 06:56:02,359 INFO L224 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-10-02 06:56:02,460 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 06:57:42,719 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-10-02 06:57:42,719 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 06:57:42,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 1612 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-02 06:57:42,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 06:57:43,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 22 proven. 66 refuted. 0 times theorem prover too weak. 1160 trivial. 0 not checked. [2019-10-02 06:57:43,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 06:57:43,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 19] total 44 [2019-10-02 06:57:43,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-10-02 06:57:43,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-10-02 06:57:43,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=461, Invalid=1431, Unknown=0, NotChecked=0, Total=1892 [2019-10-02 06:57:43,181 INFO L87 Difference]: Start difference. First operand 801 states and 968 transitions. Second operand 44 states. [2019-10-02 06:57:43,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:57:43,991 INFO L93 Difference]: Finished difference Result 1587 states and 1934 transitions. [2019-10-02 06:57:43,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-02 06:57:43,991 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 300 [2019-10-02 06:57:43,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:57:43,997 INFO L225 Difference]: With dead ends: 1587 [2019-10-02 06:57:43,997 INFO L226 Difference]: Without dead ends: 818 [2019-10-02 06:57:44,001 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=489, Invalid=1767, Unknown=0, NotChecked=0, Total=2256 [2019-10-02 06:57:44,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2019-10-02 06:57:44,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 812. [2019-10-02 06:57:44,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 812 states. [2019-10-02 06:57:44,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 981 transitions. [2019-10-02 06:57:44,051 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 981 transitions. Word has length 300 [2019-10-02 06:57:44,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:57:44,052 INFO L475 AbstractCegarLoop]: Abstraction has 812 states and 981 transitions. [2019-10-02 06:57:44,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-10-02 06:57:44,052 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 981 transitions. [2019-10-02 06:57:44,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-10-02 06:57:44,057 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:57:44,058 INFO L411 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 12, 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-10-02 06:57:44,058 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:57:44,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:57:44,059 INFO L82 PathProgramCache]: Analyzing trace with hash -401806012, now seen corresponding path program 25 times [2019-10-02 06:57:44,059 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:57:44,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:57:44,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:57:44,064 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 06:57:44,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:57:44,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:57:44,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 7 proven. 1225 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2019-10-02 06:57:44,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 06:57:44,732 INFO L224 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) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 06:57:44,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 06:57:45,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:57:45,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 1832 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-02 06:57:45,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 06:57:45,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 19 proven. 1225 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-10-02 06:57:45,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 06:57:45,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-10-02 06:57:45,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-02 06:57:45,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-02 06:57:45,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-02 06:57:45,255 INFO L87 Difference]: Start difference. First operand 812 states and 981 transitions. Second operand 29 states. [2019-10-02 06:57:45,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:57:45,552 INFO L93 Difference]: Finished difference Result 1594 states and 1934 transitions. [2019-10-02 06:57:45,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-02 06:57:45,553 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 305 [2019-10-02 06:57:45,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:57:45,571 INFO L225 Difference]: With dead ends: 1594 [2019-10-02 06:57:45,571 INFO L226 Difference]: Without dead ends: 826 [2019-10-02 06:57:45,573 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-02 06:57:45,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2019-10-02 06:57:45,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 820. [2019-10-02 06:57:45,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 820 states. [2019-10-02 06:57:45,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 991 transitions. [2019-10-02 06:57:45,614 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 991 transitions. Word has length 305 [2019-10-02 06:57:45,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:57:45,614 INFO L475 AbstractCegarLoop]: Abstraction has 820 states and 991 transitions. [2019-10-02 06:57:45,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-02 06:57:45,615 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 991 transitions. [2019-10-02 06:57:45,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2019-10-02 06:57:45,618 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:57:45,618 INFO L411 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 12, 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-10-02 06:57:45,619 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:57:45,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:57:45,619 INFO L82 PathProgramCache]: Analyzing trace with hash -232970627, now seen corresponding path program 26 times [2019-10-02 06:57:45,619 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:57:45,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:57:45,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:57:45,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 06:57:45,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:57:45,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:57:46,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 7 proven. 1326 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2019-10-02 06:57:46,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 06:57:46,225 INFO L224 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-10-02 06:57:46,336 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 06:57:46,718 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 06:57:46,718 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 06:57:46,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 1844 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-02 06:57:46,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 06:57:46,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 19 proven. 1326 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-10-02 06:57:46,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 06:57:46,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-10-02 06:57:46,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-02 06:57:46,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-02 06:57:46,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-02 06:57:46,845 INFO L87 Difference]: Start difference. First operand 820 states and 991 transitions. Second operand 30 states. [2019-10-02 06:57:47,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:57:47,166 INFO L93 Difference]: Finished difference Result 1610 states and 1954 transitions. [2019-10-02 06:57:47,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-02 06:57:47,167 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 309 [2019-10-02 06:57:47,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:57:47,171 INFO L225 Difference]: With dead ends: 1610 [2019-10-02 06:57:47,171 INFO L226 Difference]: Without dead ends: 834 [2019-10-02 06:57:47,175 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-02 06:57:47,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2019-10-02 06:57:47,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 828. [2019-10-02 06:57:47,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2019-10-02 06:57:47,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1001 transitions. [2019-10-02 06:57:47,221 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1001 transitions. Word has length 309 [2019-10-02 06:57:47,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:57:47,221 INFO L475 AbstractCegarLoop]: Abstraction has 828 states and 1001 transitions. [2019-10-02 06:57:47,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-02 06:57:47,222 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1001 transitions. [2019-10-02 06:57:47,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-10-02 06:57:47,225 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:57:47,228 INFO L411 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 12, 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-10-02 06:57:47,228 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:57:47,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:57:47,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1702094026, now seen corresponding path program 27 times [2019-10-02 06:57:47,229 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:57:47,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:57:47,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:57:47,235 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 06:57:47,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:57:47,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:57:47,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1563 backedges. 18 proven. 82 refuted. 0 times theorem prover too weak. 1463 trivial. 0 not checked. [2019-10-02 06:57:47,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 06:57:47,941 INFO L224 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-10-02 06:57:48,102 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 06:58:30,926 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-10-02 06:58:30,926 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 06:58:30,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 1568 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-02 06:58:30,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 06:58:31,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1563 backedges. 22 proven. 78 refuted. 0 times theorem prover too weak. 1463 trivial. 0 not checked. [2019-10-02 06:58:31,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 06:58:31,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 26 [2019-10-02 06:58:31,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 06:58:31,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 06:58:31,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=483, Unknown=0, NotChecked=0, Total=650 [2019-10-02 06:58:31,158 INFO L87 Difference]: Start difference. First operand 828 states and 1001 transitions. Second operand 26 states. [2019-10-02 06:58:31,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:58:31,504 INFO L93 Difference]: Finished difference Result 1627 states and 1978 transitions. [2019-10-02 06:58:31,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 06:58:31,506 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 313 [2019-10-02 06:58:31,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:58:31,510 INFO L225 Difference]: With dead ends: 1627 [2019-10-02 06:58:31,510 INFO L226 Difference]: Without dead ends: 831 [2019-10-02 06:58:31,512 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=199, Invalid=671, Unknown=0, NotChecked=0, Total=870 [2019-10-02 06:58:31,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2019-10-02 06:58:31,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 831. [2019-10-02 06:58:31,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2019-10-02 06:58:31,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1004 transitions. [2019-10-02 06:58:31,552 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1004 transitions. Word has length 313 [2019-10-02 06:58:31,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:58:31,553 INFO L475 AbstractCegarLoop]: Abstraction has 831 states and 1004 transitions. [2019-10-02 06:58:31,553 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 06:58:31,553 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1004 transitions. [2019-10-02 06:58:31,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-10-02 06:58:31,556 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:58:31,556 INFO L411 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 13, 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-10-02 06:58:31,556 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:58:31,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:58:31,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1963280535, now seen corresponding path program 28 times [2019-10-02 06:58:31,557 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:58:31,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:58:31,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:58:31,560 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 06:58:31,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:58:32,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:58:33,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1576 backedges. 18 proven. 95 refuted. 0 times theorem prover too weak. 1463 trivial. 0 not checked. [2019-10-02 06:58:33,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 06:58:33,349 INFO L224 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) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 06:58:33,501 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 06:58:33,736 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 06:58:33,736 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 06:58:33,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 1346 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-02 06:58:33,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 06:58:33,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1576 backedges. 22 proven. 91 refuted. 0 times theorem prover too weak. 1463 trivial. 0 not checked. [2019-10-02 06:58:33,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 06:58:33,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 27 [2019-10-02 06:58:33,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-02 06:58:33,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-02 06:58:33,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=519, Unknown=0, NotChecked=0, Total=702 [2019-10-02 06:58:33,883 INFO L87 Difference]: Start difference. First operand 831 states and 1004 transitions. Second operand 27 states. [2019-10-02 06:58:34,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 06:58:34,433 INFO L93 Difference]: Finished difference Result 1636 states and 1987 transitions. [2019-10-02 06:58:34,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-02 06:58:34,434 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 314 [2019-10-02 06:58:34,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 06:58:34,438 INFO L225 Difference]: With dead ends: 1636 [2019-10-02 06:58:34,439 INFO L226 Difference]: Without dead ends: 834 [2019-10-02 06:58:34,441 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=230, Invalid=762, Unknown=0, NotChecked=0, Total=992 [2019-10-02 06:58:34,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2019-10-02 06:58:34,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 834. [2019-10-02 06:58:34,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 834 states. [2019-10-02 06:58:34,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1007 transitions. [2019-10-02 06:58:34,494 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1007 transitions. Word has length 314 [2019-10-02 06:58:34,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 06:58:34,495 INFO L475 AbstractCegarLoop]: Abstraction has 834 states and 1007 transitions. [2019-10-02 06:58:34,495 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-02 06:58:34,495 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1007 transitions. [2019-10-02 06:58:34,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-10-02 06:58:34,499 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 06:58:34,500 INFO L411 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 14, 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-10-02 06:58:34,500 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 06:58:34,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 06:58:34,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1470127722, now seen corresponding path program 29 times [2019-10-02 06:58:34,501 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 06:58:34,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 06:58:34,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:58:34,507 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 06:58:34,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 06:58:35,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 06:58:35,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1590 backedges. 18 proven. 109 refuted. 0 times theorem prover too weak. 1463 trivial. 0 not checked. [2019-10-02 06:58:35,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 06:58:35,418 INFO L224 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-10-02 06:58:35,532 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 07:01:02,285 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 28 check-sat command(s) [2019-10-02 07:01:02,285 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 07:01:02,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 815 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-02 07:01:02,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 07:01:03,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1590 backedges. 19 proven. 1431 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2019-10-02 07:01:03,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 07:01:03,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 30] total 50 [2019-10-02 07:01:03,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-10-02 07:01:03,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-10-02 07:01:03,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=586, Invalid=1864, Unknown=0, NotChecked=0, Total=2450 [2019-10-02 07:01:03,167 INFO L87 Difference]: Start difference. First operand 834 states and 1007 transitions. Second operand 50 states. [2019-10-02 07:01:03,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 07:01:03,930 INFO L93 Difference]: Finished difference Result 1656 states and 2015 transitions. [2019-10-02 07:01:03,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-10-02 07:01:03,931 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 315 [2019-10-02 07:01:03,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 07:01:03,935 INFO L225 Difference]: With dead ends: 1656 [2019-10-02 07:01:03,935 INFO L226 Difference]: Without dead ends: 851 [2019-10-02 07:01:03,938 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=618, Invalid=2352, Unknown=0, NotChecked=0, Total=2970 [2019-10-02 07:01:03,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2019-10-02 07:01:03,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 845. [2019-10-02 07:01:03,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2019-10-02 07:01:03,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1020 transitions. [2019-10-02 07:01:03,981 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1020 transitions. Word has length 315 [2019-10-02 07:01:03,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 07:01:03,982 INFO L475 AbstractCegarLoop]: Abstraction has 845 states and 1020 transitions. [2019-10-02 07:01:03,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-10-02 07:01:03,982 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1020 transitions. [2019-10-02 07:01:03,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-10-02 07:01:03,985 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 07:01:03,986 INFO L411 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 15, 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-10-02 07:01:03,986 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 07:01:03,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 07:01:03,987 INFO L82 PathProgramCache]: Analyzing trace with hash -2014841296, now seen corresponding path program 30 times [2019-10-02 07:01:03,987 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 07:01:03,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 07:01:03,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 07:01:03,990 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 07:01:03,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 07:01:04,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 07:01:04,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1714 backedges. 7 proven. 1540 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2019-10-02 07:01:04,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 07:01:04,977 INFO L224 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-10-02 07:01:05,096 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 07:03:37,018 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2019-10-02 07:03:37,018 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 07:03:37,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 1772 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-02 07:03:37,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 07:03:37,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1714 backedges. 22 proven. 120 refuted. 0 times theorem prover too weak. 1572 trivial. 0 not checked. [2019-10-02 07:03:37,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 07:03:37,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 23] total 52 [2019-10-02 07:03:37,680 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-10-02 07:03:37,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-10-02 07:03:37,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=637, Invalid=2015, Unknown=0, NotChecked=0, Total=2652 [2019-10-02 07:03:37,681 INFO L87 Difference]: Start difference. First operand 845 states and 1020 transitions. Second operand 52 states. [2019-10-02 07:03:38,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 07:03:38,674 INFO L93 Difference]: Finished difference Result 1678 states and 2041 transitions. [2019-10-02 07:03:38,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-10-02 07:03:38,675 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 320 [2019-10-02 07:03:38,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 07:03:38,678 INFO L225 Difference]: With dead ends: 1678 [2019-10-02 07:03:38,678 INFO L226 Difference]: Without dead ends: 862 [2019-10-02 07:03:38,681 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 669 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=677, Invalid=2515, Unknown=0, NotChecked=0, Total=3192 [2019-10-02 07:03:38,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2019-10-02 07:03:38,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 856. [2019-10-02 07:03:38,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2019-10-02 07:03:38,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1033 transitions. [2019-10-02 07:03:38,719 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1033 transitions. Word has length 320 [2019-10-02 07:03:38,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 07:03:38,720 INFO L475 AbstractCegarLoop]: Abstraction has 856 states and 1033 transitions. [2019-10-02 07:03:38,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-10-02 07:03:38,720 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1033 transitions. [2019-10-02 07:03:38,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2019-10-02 07:03:38,722 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 07:03:38,723 INFO L411 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 16, 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-10-02 07:03:38,723 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 07:03:38,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 07:03:38,723 INFO L82 PathProgramCache]: Analyzing trace with hash -76881176, now seen corresponding path program 31 times [2019-10-02 07:03:38,724 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 07:03:38,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 07:03:38,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 07:03:38,729 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 07:03:38,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 07:03:38,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 07:03:39,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1843 backedges. 7 proven. 1653 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-10-02 07:03:39,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 07:03:39,625 INFO L224 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-10-02 07:03:39,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 07:03:40,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 07:03:40,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 1992 conjuncts, 31 conjunts are in the unsatisfiable core [2019-10-02 07:03:40,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 07:03:40,199 INFO L134 CoverageAnalysis]: Checked inductivity of 1843 backedges. 19 proven. 1653 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-10-02 07:03:40,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 07:03:40,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-10-02 07:03:40,206 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-02 07:03:40,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-02 07:03:40,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-10-02 07:03:40,208 INFO L87 Difference]: Start difference. First operand 856 states and 1033 transitions. Second operand 33 states. [2019-10-02 07:03:40,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 07:03:40,428 INFO L93 Difference]: Finished difference Result 1682 states and 2038 transitions. [2019-10-02 07:03:40,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-02 07:03:40,428 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 325 [2019-10-02 07:03:40,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 07:03:40,430 INFO L225 Difference]: With dead ends: 1682 [2019-10-02 07:03:40,431 INFO L226 Difference]: Without dead ends: 870 [2019-10-02 07:03:40,436 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 325 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-10-02 07:03:40,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2019-10-02 07:03:40,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 864. [2019-10-02 07:03:40,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 864 states. [2019-10-02 07:03:40,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1043 transitions. [2019-10-02 07:03:40,485 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1043 transitions. Word has length 325 [2019-10-02 07:03:40,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 07:03:40,486 INFO L475 AbstractCegarLoop]: Abstraction has 864 states and 1043 transitions. [2019-10-02 07:03:40,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-02 07:03:40,486 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1043 transitions. [2019-10-02 07:03:40,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2019-10-02 07:03:40,489 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 07:03:40,489 INFO L411 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 16, 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-10-02 07:03:40,489 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 07:03:40,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 07:03:40,490 INFO L82 PathProgramCache]: Analyzing trace with hash 976438689, now seen corresponding path program 32 times [2019-10-02 07:03:40,490 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 07:03:40,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 07:03:40,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 07:03:40,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 07:03:40,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 07:03:40,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 07:03:41,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1960 backedges. 7 proven. 1770 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-10-02 07:03:41,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 07:03:41,323 INFO L224 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-10-02 07:03:41,445 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 07:03:41,815 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 07:03:41,815 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 07:03:41,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 2004 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-02 07:03:41,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 07:03:41,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1960 backedges. 19 proven. 1770 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (38)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 07:03:41,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 07:03:41,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-10-02 07:03:41,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-02 07:03:41,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-02 07:03:41,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-10-02 07:03:41,921 INFO L87 Difference]: Start difference. First operand 864 states and 1043 transitions. Second operand 34 states. [2019-10-02 07:03:42,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 07:03:42,141 INFO L93 Difference]: Finished difference Result 1698 states and 2058 transitions. [2019-10-02 07:03:42,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-02 07:03:42,142 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 329 [2019-10-02 07:03:42,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 07:03:42,144 INFO L225 Difference]: With dead ends: 1698 [2019-10-02 07:03:42,144 INFO L226 Difference]: Without dead ends: 878 [2019-10-02 07:03:42,146 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-10-02 07:03:42,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2019-10-02 07:03:42,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 872. [2019-10-02 07:03:42,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2019-10-02 07:03:42,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1053 transitions. [2019-10-02 07:03:42,186 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1053 transitions. Word has length 329 [2019-10-02 07:03:42,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 07:03:42,186 INFO L475 AbstractCegarLoop]: Abstraction has 872 states and 1053 transitions. [2019-10-02 07:03:42,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-02 07:03:42,186 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1053 transitions. [2019-10-02 07:03:42,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-10-02 07:03:42,189 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 07:03:42,189 INFO L411 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 16, 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-10-02 07:03:42,190 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 07:03:42,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 07:03:42,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1143579610, now seen corresponding path program 33 times [2019-10-02 07:03:42,190 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 07:03:42,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 07:03:42,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 07:03:42,193 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 07:03:42,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 07:03:42,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 07:03:43,164 INFO L134 CoverageAnalysis]: Checked inductivity of 2081 backedges. 7 proven. 1891 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-10-02 07:03:43,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 07:03:43,165 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 07:03:43,289 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 07:04:54,921 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-10-02 07:04:54,921 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 07:04:54,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 1704 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-02 07:04:54,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 07:04:55,537 INFO L134 CoverageAnalysis]: Checked inductivity of 2081 backedges. 22 proven. 136 refuted. 0 times theorem prover too weak. 1923 trivial. 0 not checked. [2019-10-02 07:04:55,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 07:04:55,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 24] total 56 [2019-10-02 07:04:55,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-10-02 07:04:55,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-10-02 07:04:55,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=751, Invalid=2329, Unknown=0, NotChecked=0, Total=3080 [2019-10-02 07:04:55,606 INFO L87 Difference]: Start difference. First operand 872 states and 1053 transitions. Second operand 56 states. [2019-10-02 07:04:56,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 07:04:56,462 INFO L93 Difference]: Finished difference Result 1732 states and 2107 transitions. [2019-10-02 07:04:56,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-10-02 07:04:56,464 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 333 [2019-10-02 07:04:56,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 07:04:56,467 INFO L225 Difference]: With dead ends: 1732 [2019-10-02 07:04:56,467 INFO L226 Difference]: Without dead ends: 889 [2019-10-02 07:04:56,469 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 768 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=791, Invalid=2869, Unknown=0, NotChecked=0, Total=3660 [2019-10-02 07:04:56,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2019-10-02 07:04:56,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 883. [2019-10-02 07:04:56,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 883 states. [2019-10-02 07:04:56,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1066 transitions. [2019-10-02 07:04:56,510 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1066 transitions. Word has length 333 [2019-10-02 07:04:56,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 07:04:56,510 INFO L475 AbstractCegarLoop]: Abstraction has 883 states and 1066 transitions. [2019-10-02 07:04:56,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-10-02 07:04:56,511 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1066 transitions. [2019-10-02 07:04:56,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2019-10-02 07:04:56,514 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 07:04:56,514 INFO L411 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 17, 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-10-02 07:04:56,514 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 07:04:56,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 07:04:56,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1650007892, now seen corresponding path program 34 times [2019-10-02 07:04:56,515 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 07:04:56,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 07:04:56,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 07:04:56,519 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 07:04:56,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 07:04:57,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 07:04:57,886 INFO L134 CoverageAnalysis]: Checked inductivity of 2223 backedges. 7 proven. 2016 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-10-02 07:04:57,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 07:04:57,886 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 07:04:58,007 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 07:05:10,649 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 07:05:10,649 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 07:05:10,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 2056 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-02 07:05:10,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 07:05:10,739 INFO L134 CoverageAnalysis]: Checked inductivity of 2223 backedges. 19 proven. 2016 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-10-02 07:05:10,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 07:05:10,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-10-02 07:05:10,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-02 07:05:10,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-02 07:05:10,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-10-02 07:05:10,813 INFO L87 Difference]: Start difference. First operand 883 states and 1066 transitions. Second operand 36 states. [2019-10-02 07:05:11,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 07:05:11,102 INFO L93 Difference]: Finished difference Result 1736 states and 2104 transitions. [2019-10-02 07:05:11,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-02 07:05:11,103 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 338 [2019-10-02 07:05:11,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 07:05:11,106 INFO L225 Difference]: With dead ends: 1736 [2019-10-02 07:05:11,106 INFO L226 Difference]: Without dead ends: 897 [2019-10-02 07:05:11,108 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 338 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-10-02 07:05:11,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2019-10-02 07:05:11,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 891. [2019-10-02 07:05:11,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 891 states. [2019-10-02 07:05:11,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1076 transitions. [2019-10-02 07:05:11,152 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1076 transitions. Word has length 338 [2019-10-02 07:05:11,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 07:05:11,153 INFO L475 AbstractCegarLoop]: Abstraction has 891 states and 1076 transitions. [2019-10-02 07:05:11,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-02 07:05:11,153 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1076 transitions. [2019-10-02 07:05:11,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2019-10-02 07:05:11,156 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 07:05:11,157 INFO L411 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 17, 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-10-02 07:05:11,157 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 07:05:11,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 07:05:11,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1001098605, now seen corresponding path program 35 times [2019-10-02 07:05:11,158 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 07:05:11,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 07:05:11,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 07:05:11,161 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 07:05:11,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 07:05:11,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 07:05:12,277 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 7 proven. 2145 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-10-02 07:05:12,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 07:05:12,277 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 07:05:12,404 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1